Mixing time of the lazy and simple random walk on a randomly twisted hypercube

Source abstract

We consider a randomly twisted hypercube on $N$ vertices and study a simple or lazy random walk on this graph. We show that for both walks the mixing time is of order $\log N$, and the model does not exhibit cutoff. We also establish that both walks have cover time of order $N\log N$, and we show that the chromatic number of the graph diverges.