Strong uniform times and finite random walks

Authors:
David Aldous;Persi Diaconis
Affiliations:
University of California, Berkeley, California 94720, USA and Stanford University, Stanford, California 94305 USA;University of California, Berkeley, California 94720, USA and Stanford University, Stanford, California 94305 USA
Venue:
Advances in Applied Mathematics
Year:
1987

Citing 0
Cited 10

Stationarity detection in the initial transient problem

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Approximate load balancing on dynamic and asynchronous networks

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An interruptible algorithm for perfect sampling via Markov chains

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Using stopping times to bound mixing times

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Rapidly Mixing Random Walks and Bounds on Characters of the Symmetric Group

Journal of Algebraic Combinatorics: An International Journal
Distributed communication algorithms for ad hoc mobile networks

Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
The cutoff phenomenon for randomized riffle shuffles

Random Structures & Algorithms
On the cut-off phenomenon for the transitivity of randomly generated subgroups

Random Structures & Algorithms
Strong stationary duality for Möbius monotone Markov chains

Queueing Systems: Theory and Applications
Classical hardness of learning with errors

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are several techniques for obtaining bounds on the rate of convergence to the stationary distribution for Markov chains with strong symmetry properties, in particular random walks on finite groups. An elementary method, strong uniform times, is often effective. We prove such times always exist, and relate this method to coupling and Fourier analysis.