Linking the mixing times of random walks on static and dynamic random graphs
Authors:
- Luca AvenaLALuca Avena
- Hakan GüldaşHGHakan Güldaş
- Remco van der HofstadRHRemco van der Hofstad
- Frank Den HollanderFHFrank Den Hollander
- Oliver NagyONOliver Nagy
Open Access
- 1 August 2022
- journal article
- research article
- Published by Elsevier in Stochastic Processes and their Applications
- Vol. 153, 145-182
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
This publication has 26 references indexed in Scilit:
- Cutoff for nonbacktracking random walks on sparse random graphsThe Annals of Probability, 2017
- Distributed Algorithmic Foundations of Dynamic NetworksACM SIGACT News, 2016
- Distributed computation in dynamic networks via random walksTheoretical Computer Science, 2015
- Random walks on dynamical percolation: mixing times, mean squared displacement and hitting timesProbability Theory and Related Fields, 2014
- Information spreading in dynamic graphsDistributed Computing, 2014
- Characterizing continuous time random walks on time varying graphsACM SIGMETRICS Performance Evaluation Review, 2012
- Dynamic networksACM SIGACT News, 2011
- Cutoff phenomena for random walks on random regular graphsDuke Mathematical Journal, 2010
- Distances in random graphs with finite variance degreesRandom Structures & Algorithms, 2005
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsEuropean Journal of Combinatorics, 1980