Mixing time trichotomy in regenerating dynamic digraphs

We study convergence to stationarity for random walks on dynamic random digraphs with given degree sequences. The digraphs undergo full regeneration at independent geometrically distributed random time intervals with parameter $\a$. Relaxation to stationarity is the result of a competition between regeneration and mixing on the static digraph. When the number of vertices $n$ tends to infinity and the parameter $\a$ tends to zero, we find three scenarios according to whether $\a\log n$ converges to zero, infinity or to some finite positive value: when the limit is zero, relaxation to stationarity occurs in two separate stages, the first due to mixing on the static digraph, and the second due to regeneration; when the limit is infinite, there is not enough time for the static digraph to mix and the relaxation to stationarity is dictated by the regeneration only; finally, when the limit is a finite positive value we find a mixed behaviour interpolating between the two extremes. A crucial ingredient of our analysis is the control of suitable approximations for the unknown stationary distribution.

[1]  Justin Salez,et al.  Cutoff at the “entropic time” for sparse Markov chains , 2016, Probability Theory and Related Fields.

[3]  G. Roberts,et al.  Regeneration-enriched Markov processes with application to Monte Carlo , 2019, The Annals of Applied Probability.

[4]  Paul G. Spirakis,et al.  Elements of the theory of dynamic networks , 2018, Commun. ACM.

[5]  F. Hollander,et al.  Mixing times of random walks on dynamic configuration models , 2016, The Annals of Applied Probability.

[6]  Quansheng Liu,et al.  Asymptotic properties and absolute continuity of laws stable by random weighted mean , 2001 .

[7]  Dmitry Dolgopyat,et al.  Random walk in Markovian environment , 2007, math/0702100.

[8]  Ofer Zeitouni,et al.  Random Walk in Dynamic Markovian Random Environment , 2005 .

[9]  Vijay Subramanian,et al.  Restart perturbations for lazy, reversible Markov chains: trichotomy and pre-cutoff equivalence , 2019, ArXiv.

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

[11]  S. Chatterjee.  Stein’s method for concentration inequalities , 2006, math/0604352.

[12]  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.

[13]  Thomas Sauerwald,et al.  Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities , 2019, ICALP.

[14]  F. Hollander,et al.  Law of Large Numbers for a Class of Random Walks in Dynamic Random Environments , 2009, 0911.2385.

[15]  Donald F. Towsley,et al.  Characterizing continuous time random walks on time varying graphs , 2012, SIGMETRICS '12.

[16]  F. Hollander,et al.  Random walks on dynamic configuration models:A trichotomy , 2018, Stochastic Processes and their Applications.

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

[18]  Quansheng Liu.  Products of Random Weights Indexed by Galton-Watson Trees , 1997 .

[19]  Perla Sousi,et al.  Cutoff for random walk on dynamical Erdős–Rényi graph , 2018, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques.

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

[21]  Simon Coste.  The spectral gap of sparse random digraphs , 2017, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques.

[22]  Matteo Quattropani,et al.  Mixing time of PageRank surfers on sparse random digraphs , 2019, Random Struct. Algorithms.

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

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

[25]  Y. Peres,et al.  Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times , 2013, 1308.6193.

[26]  Alessandro Pellegrinotti,et al.  Almost-sure central limit theorem for a Markov model of random walk in dynamical random environment , 1997 .

[27]  Mixing time for random walk on supercritical dynamical percolation , 2017, Probability Theory and Related Fields.

[28]  Perla Sousi,et al.  Cutoff for Random Walk on Dynamical Erd\H{o}s-R\'enyi Graph , 2018 .

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

[30]  Borja Balle,et al.  Diameter and Stationary Distribution of Random $r$-out Digraphs , 2015, Electron. J. Comb..