Stratified random walks on the n-cube

In this paper we present a method for analyzing a general class of random walks on the n-cube (and certain subgraphs of it). These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to guarantee that the resulting distribution is close to the (uniform) stationary distribution. © 1997 John Wiley & Sons, Inc. Random Struct. Alg., 11 , 199–222, 1997