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 .

[1]  Ronald L. Graham,et al.  Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions , 1990, Random Struct. Algorithms.

[2]  Shing-Tung Yau,et al.  Eigenvalues of Graphs and Sobolev Inequalities , 1995, Combinatorics, Probability and Computing.

[3]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[4]  P. Diaconis,et al.  Walks on generating sets of Abelian groups , 1996 .

[5]  Fan Chung Graham,et al.  Random walks on generating sets for finite groups , 1996, Electron. J. Comb..