Random Walks on Randomly Evolving Graphs
Pages 111 - 128
Abstract
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.
In this work we study the mixing (i.e., convergence) properties of random walks on graphs subjected to random changes over time. Specifically, we consider the edge-Markovian random graph model: for each edge slot, there is a two-state Markov chain with transition probabilities p (add a non-existing edge) and q (remove an existing edge). We derive several positive and negative results that depend on both the density of the graph and the speed by which the graph changes.
References
[1]
Alon N and Milman VD isoperimetric inequalities for graphs, and superconcentrators J. Combin. Theory Ser. B 1985 38 1 73-88
[2]
Augustine J, Pandurangan G, and Robinson P Distributed algorithmic foundations of dynamic networks SIGACT News 2016 47 1 69-98
[3]
Avin C, Koucký M, and Lotker Z Cover time and mixing time of random walks on dynamic graphs Random Struct. Algorithms 2018 52 4 576-596
[4]
Berenbrink, P., Giakkoupis, G., Kermarrec, A., Mallmann-Trenn, F.: Bounds on the voter model in dynamic networks. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). LIPIcs, vol. 55, pp. 146:1–146:15 (2016)
[5]
Clementi A, Crescenzi P, Doerr C, Fraigniaud P, Pasquale F, and Silvestri R Rumor spreading in random evolving graphs Random Struct. Algorithms 2016 48 2 290-312
[6]
Clementi A, Monti A, Pasquale F, and Silvestri R Information spreading in stationary Markovian evolving graphs IEEE Trans. Parallel Distrib. Syst. 2011 22 9 1425-1432
[7]
Clementi AEF, Macci C, Monti A, Pasquale F, and Silvestri R Flooding time of edge-markovian evolving graphs SIAM J. Discrete Math. 2010 24 4 1694-1712
[8]
Clementi A, Silvestri R, and Trevisan L Information spreading in dynamic graphs Distrib. Comput. 2014 28 1 55-73
[9]
Cooper C Kosowski A and Yamashita M Random walks, interacting particles, dynamic networks: randomness can be helpful Structural Information and Communication Complexity 2011 Heidelberg Springer 1-14
[10]
Denysyuk O and Rodrigues L Kuhn F Random walks on evolving graphs with recurring topologies Distributed Computing 2014 Heidelberg Springer 333-345
[11]
Giakkoupis G, Sauerwald T, and Stauffer A Esparza J, Fraigniaud P, Husfeldt T, and Koutsoupias E Randomized Rumor Spreading in Dynamic Graphs Automata, Languages, and Programming 2014 Heidelberg Springer 495-507
[12]
Hermon, J., Sousi, P.: Random walk on dynamical percolation. arXiv preprint arXiv:1902.02770 (2019)
[13]
Hoffman, C., Kahle, M., Paquette, E.: Spectral gaps of random graphs and applications. International Mathematics Research Notices, May 2019
[14]
Kuhn F and Oshman R Dynamic networks: models and algorithms SIGACT News 2011 42 1 82-96
[15]
Lamprou I, Martin R, and Spirakis P Cover time in edge-uniform stochastically-evolving graphs Algorithms 2018 11 10 15 (Paper No. 149)
[16]
Levin DA and Peres Y Markov Chains and Mixing Times 2017 Providence American Mathematical Society
[17]
Michail O and Spirakis PG Elements of the theory of dynamic networks Commun. ACM 2018 61 2 72
[18]
Montenegro, R., Tetali, P.: Mathematical aspects of mixing times in Markov chains. Found. Trends Theor. Comput. Sci. 1(3), x+121 (2006)
[19]
Peres Y, Sousi P, and Steif J Mixing time for random walk on supercritical dynamical percolation Probab. Theory Relat. Fields 2020 176 809-849
[20]
Peres Y, Stauffer A, and Steif JE Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times Probab. Theory Relat. Fields 2015 162 3–4 487-530
[21]
Saloff-Coste L and Zúñiga J Merging for time inhomogeneous finite Markov chains. I. Singular values and stability Electron. J. Probab. 2009 14 1456-1494
[22]
Saloff-Coste L and Zúñiga J Merging for inhomogeneous finite Markov chains, Part II: Nash and log-Sobolev inequalities Ann. Probab. 2011 39 3 1161-1203
[23]
Saloff-Coste, L., Zúñiga, J.: Merging and stability for time inhomogeneous finite Markov chains. In: Surveys in Stochastic Processes, pp. 127–151. EMS Series of Congress Reports, European Mathematical Society, Zürich (2011)
[24]
Sarma AD, Molla AR, and Pandurangan G Distributed computation in dynamic networks via random walks Theor. Comput. Sci. 2015 581 45-66
[25]
Sauerwald, T., Zanetti, L.: Random walks on dynamic graphs: Mixing times, hitting times, and return probabilities. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). LIPIcs, vol. 132, pp. 93:1–93:15 (2019)
[26]
Sousi, P., Thomas, S.: Cutoff for random walk on dynamical Erdos-Renyi graph. arXiv preprint arXiv:1807.04719 (2018)
Index Terms
- Random Walks on Randomly Evolving Graphs
Index terms have been assigned to the content through auto-classification.
Recommendations
Multiple Random Walks in Random Regular Graphs
We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random $r$-regular ...
Fast Random Walks on Finite Graphs and Graph Topological Information
ICNC '11: Proceedings of the 2011 Second International Conference on Networking and ComputingA random walk on a graph is a process in which a particle on a vertex repeatedly moves to its adjacent vertex according to transition probability, which is given in advance. The behavior of random walks depend on its transition probability, and the ``...
Coalescing random walks and voting on graphs
PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computingIn a coalescing random walk, a set of particles make independent discrete-time random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph. ...
Comments
Information & Contributors
Information
Published In
Jun 2020
387 pages
ISBN:978-3-030-54920-6
DOI:10.1007/978-3-030-54921-3
- Editors:
- Andrea Werneck Richa,
- Christian Scheideler
© Springer Nature Switzerland AG 2020.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 29 June 2020
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 11 Feb 2025