Mixing Times for Random Walks on Finite Lamplighter Groups
暂无分享,去创建一个
[1] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .
[2] Clyde H. SchoolfieldJr.. Random Walks on Wreath Products of Groups , 2002 .
[3] Johan Jonasson,et al. Rates of convergence for lamplighter processes , 1997 .
[4] Yuval Peres,et al. Glauber dynamics on trees and hyperbolic graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[5] Amenable groups, isoperimetric profiles and random walks , 1999 .
[6] Elchanan Mossel,et al. Glauber dynamics on trees and hyperbolic graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[7] P. Matthews. Covering Problems for Brownian Motion on Spheres , 1988 .
[8] Andrei Z. Broder,et al. Bounds on the cover time , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[9] Clusters of a Random Walk on the Plane , 1993 .
[10] Amir Dembo,et al. Cover times for Brownian motion and random walks in two dimensions , 2001 .
[11] D. Aldous. Threshold limits for cover times , 1991 .
[12] James Allen Fill,et al. Mixing Times for Markov Chains on Wreath Products and Related Homogeneous Spaces , 2000 .
[13] P. Diaconis,et al. Strong uniform times and finite random walks , 1987 .
[14] Mu-Fa Chen,et al. Trilogy of Couplings and General Formulas for Lower Bound of Spectral Gap , 1998 .