Random walks on finite groups and rapidly mixing markov chains

@article{Aldous1983RandomWO,
  title={Random walks on finite groups and rapidly mixing markov chains},
  author={David J. Aldous},
  journal={Lecture Notes in Mathematics},
  year={1983},
  volume={17},
  pages={243-297}
}
  • D. Aldous
  • Published 1983
  • Mathematics
  • Lecture Notes in Mathematics
© Springer-Verlag, Berlin Heidelberg New York, 1983, tous droits reserves. L’acces aux archives du seminaire de probabilites (Strasbourg) (http://www-irma. u-strasbg.fr/irma/semproba/index.shtml), implique l’accord avec les conditions generales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systematique est constitutive d’une infraction penale. Toute copie ou impression de ce fichier doit contenir la presente mention de copyright. 

Limit Profiles for Markov Chains

In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random

Random walk on sparse random digraphs

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter

Limit profiles for reversible Markov chains

In a recent breakthrough, Teyssier (Ann Probab 48(5):2323–2343, 2020) introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the

Total variation cutoff in birth-and-death chains

The cutoff phenomenon describes a case where a Markov chain exhibits a sharp transition in its convergence to stationarity. Diaconis [Proc Natl Acad Sci USA 93(4):1659–1664, 1996] surveyed this

Cutoff for non-backtracking random walks on sparse random graphs

A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time

Markov Chains, Eigenvalues, and Coupling

This is an expository paper which presents certain basic ideas related to non-asymptotic rates of convergence for Markov chains. In particular, we describe eigenvalue analysis, random walks on

Cutoff for permuted Markov chains

Abstract. Let P be a bistochastic matrix of size n, and let Π be a permutation matrix of size n. In this paper, we are interested in the mixing time of the Markov chain whose transition matrix is

Convergence Rates of Markov Chains Acknowledgements. I Thank Eric Belsley for Comments and Corrections, and Thank

This is an expository paper which presents various ideas related to non-asymptotic rates of convergence for Markov chains. Such rates are of great importance for stochastic algorithms which are

Characterization of cutoff for reversible Markov chains

It is shown that a sequence of lazy Markov chains on finite trees exhibits a cutoff iff the ratio of their relaxation-times and their (lazy) mixing-times tends to 0.

Convergence Rates for Markov Chains

Various mathematical techniques that have been used to bound nonasymptotic rates of convergence for Markov chains are described, including eigenvalue analysis, random walks on groups, coupling, and minorization conditions.
...

References

SHOWING 1-10 OF 19 REFERENCES

Problemes classiques de probabilite sur un couple de Gelfand

This paper describes Gelfand pairs to statisticians and probabilists and deals with six typical examples : euclidean space, sphere and cube; Poincare half-plane, homogeneous tree and commutative

Finite Markov chains

This lecture reviews the theory of Markov chains and introduces some of the high quality routines for working with Markov Chains available in QuantEcon.jl.

Markov chains with almost exponential hitting times

On the time taken by random walks on finite groups to visit every state

SummaryConsider a random walk on a finite group G. Suppose that the time taken for the transition probabilities to approach the uniform distribution is small compared with #G. Then the time taken for

Markov Chain Models--Rarity And Exponentiality

0. Introduction and Summary.- 1. Discrete Time Markov Chains Reversibility in Time.- 1.00. Introduction.- 1.0. Notation, Transition Laws.- 1.1. Irreducibility, Aperiodicity, Ergodicity Stationary

A First Course on Stochastic Processes

The Basic Limit Theorem of Markov Chains and Applications and Classical Examples of Continuous Time Markov chains are presented.

The Theory of Gambling and Statistical Logic, Revised Edition

Richard Epsteins classic book on gambling and its mathematical analysis covers the full range of games from penny matching, to blackjack and other casino games, to the stock market (including

An introduction to probability theory

This classic text and reference introduces probability theory for both advanced undergraduate students of statistics and scientists in related fields, drawing on real applications in the physical and

Group theory in statistics

  • 1982