Random walks on randomly evolving graphs

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution in time that is at most polynomial in the size of the graph. This fundamental property, however, only holds if the graph does not change over time; on the other hand, many distributed networks are inherently dynamic, and their topology is subjected to potentially drastic changes.

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

[2]  Luca Trevisan,et al.  Information spreading in dynamic graphs , 2011, PODC '12.

[3]  Andrea E. F. Clementi,et al.  Information Spreading in Stationary Markovian Evolving Graphs , 2009, IEEE Transactions on Parallel and Distributed Systems.

[4]  Perla Sousi,et al.  Random walk on dynamical percolation , 2019 .

[5]  Lu Liu,et al.  Modeling the Trend of Credit Card Usage Behavior for Different Age Groups Based on Singular Spectrum Analysis , 2018, Algorithms.

[6]  Matthew Kahle,et al.  Spectral Gaps of Random Graphs and Applications , 2012, International Mathematics Research Notices.

[7]  Colin Cooper,et al.  Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful , 2011, SIROCCO.

[8]  Andrea E. F. Clementi,et al.  Rumor spreading in random evolving graphs , 2013, Random Struct. Algorithms.

[9]  George Giakkoupis,et al.  Randomized Rumor Spreading in Dynamic Graphs , 2014, ICALP.

[10]  Paul G. Spirakis,et al.  Cover Time in Edge-Uniform Stochastically-Evolving Graphs , 2017, SSS.

[11]  Paul G. Spirakis,et al.  Cover Time in Edge-Uniform Stochastically-Evolving Graphs , 2018, Algorithms.

[12]  George Giakkoupis,et al.  Bounds on the Voter Model in Dynamic Networks , 2016, ICALP.

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

[14]  Anisur Rahaman Molla,et al.  Distributed computation in dynamic networks via random walks , 2015, Theor. Comput. Sci..

[15]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[16]  Chen Avin,et al.  Cover time and mixing time of random walks on dynamic graphs , 2018, Random Struct. Algorithms.

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

[18]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[19]  J. Welch.  Distributed Algorithmic Foundations of Dynamic Networks , 2016 .

[20]  Luís E. T. Rodrigues,et al.  Random Walks on Evolving Graphs with Recurring Topologies , 2014, DISC.

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

[22]  Andrea E. F. Clementi,et al.  Flooding Time of Edge-Markovian Evolving Graphs , 2010, SIAM J. Discret. Math..

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

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

[25]  L. Saloff-Coste,et al.  Merging for time inhomogeneous finite Markov chains, Part I: singular values and stability , 2009 .

[26]  Y. Peres,et al.  Markov Chains and Mixing Times: Second Edition , 2017 .

[27]  L. Saloff-Coste,et al.  Merging for inhomogeneous finite Markov chains, part II: Nash and log-Sobolev inequalities , 2011, 1104.1560.

[28]  Ravi Montenegro,et al.  Mathematical Aspects of Mixing Times in Markov Chains , 2006, Found. Trends Theor. Comput. Sci..

[29]  Fabian Kuhn,et al.  Dynamic networks: models and algorithms , 2011, SIGA.

[30]  L. Saloff-Coste,et al.  Merging and stability for time inhomogeneous finite Markov chains , 2010, 1004.2296.