Cutoff at the “entropic time” for sparse Markov chains

We study convergence to equilibrium for a class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix P the mass is essentially concentrated on few entries. Moreover, the entries are exchangeable within each row. This includes various models of random walks on sparse random directed graphs. The models are generally non reversible and the equilibrium distribution is itself unknown. In this general setting we establish the cutoff phenomenon for the total variation distance to equilibrium, with mixing time given by the logarithm of the number of states times the inverse of the average row entropy of P. As an application, we consider the case where the rows of P are i.i.d. random vectors in the domain of attraction of a Poisson–Dirichlet law with index $$\alpha \in (0,1)$$α∈(0,1). Our main results are based on a detailed analysis of the weight of the trajectory followed by the walker. This approach offers an interpretation of cutoff as an instance of the concentration of measure phenomenon.

[1]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[2]  Characterization of cutoff for reversible Markov chains , 2015, SODA 2015.

[3]  D. Freedman.  On Tail Probabilities for Martingales , 1975 .

[4]  C. Bordenave,et al.  Spectrum of large random Markov chains: Heavy-tailed weights on the oriented complete graph , 2016, 1610.01836.

[5]  Martin Hildebrand.  A survey of results on random random walks on finite groups , 2004 .

[6]  Jian Ding,et al.  Total variation cutoff in birth-and-death chains , 2008, 0801.2625.

[7]  Persi Diaconis,et al.  Separation cut-offs for birth and death chains , 2006, math/0702411.

[8]  Gábor Lugosi,et al.  Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.

[9]  P. Diaconis,et al.  The cutoff phenomenon in finite Markov chains. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[11]  David B. Wilson.  Random random walks on ℤ2d , 1997 .

[12]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[13]  Justin Salez,et al.  Cutoff for non-backtracking random walks on sparse random graphs , 2015 .

[14]  J. Pitman,et al.  The two-parameter Poisson-Dirichlet distribution derived from a stable subordinator , 1997 .

[15]  Justin Salez,et al.  Random walk on sparse random digraphs , 2015, Probability Theory and Related Fields.

[16]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[17]  Aaron Smith,et al.  The cutoff phenomenon for random birth and death chains , 2012, Random Struct. Algorithms.

[18]  Persi Diaconis,et al.  Random doubly stochastic tridiagonal matrices , 2013, Random Struct. Algorithms.

[19]  Allan Sly,et al.  Cutoff phenomena for random walks on random regular graphs , 2008, 0812.0060.

[20]  Y. Peres,et al.  Cutoff on all Ramanujan graphs , 2015, 1507.04725.

[21]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[22]  Allan Sly,et al.  Random walks on the random graph , 2015, 1504.01999.

[23]  P. Diaconis,et al.  SHUFFLING CARDS AND STOPPING-TIMES , 1986 .