Mixing times of random walks on dynamic configuration models

DOI10.1214/17-AAP1289zbMath1402.60013arXiv1606.07639MaRDI QIDQ1617116

Remco van der Hofstad, Hakan Güldaş, W. Th. F. den Hollander, Luca Avena

Publication date: 7 November 2018

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.07639

zbMATH Keywords

random walkmixing timerandom graphcouplingdynamic configuration model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Ergodicity, mixing, rates of mixing (37A25) Combinatorial probability (60C05)

Related Items

Complex networks: structure and functionality, A threshold for cutoff in two-community random graphs, Cutoff for rewiring dynamics on perfect matchings, The degree-wise effect of a second step for a random walk on a graph, Speeding up Markov chains with deterministic jumps, A comparison principle for random walk on dynamical percolation, Random walks on dynamic configuration models: a trichotomy, Cutoff for random walk on dynamical Erdős-Rényi graph, Mixing time trichotomy in regenerating dynamic digraphs, On a random walk that grows its own tree, Correction to: ``Speeding up Markov chains with deterministic jumps, Tree builder random walk: recurrence, transience and ballisticity, Linking the mixing times of random walks on static and dynamic random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Mixing time of near-critical random graphs
• Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
• Critical random graphs: Diameter and mixing time
• Cutoff phenomena for random walks on random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• On the mixing time of a simple random walk on the super critical percolation cluster
• Random walks on the random graph
• Cutoff for nonbacktracking random walks on sparse random graphs
• Random walk on sparse random digraphs
• Random Graphs and Complex Networks
• The mixing time of the giant component of a random graph
• The evolution of the mixing rate of a simple random walk on the giant component of a random graph
• The Probability That a Random Multigraph is Simple
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence
• The probability that a random multigraph is simple. II
• The switch Markov chain for sampling irregular graphs (Extended Abstract)
• Critical Window for Connectivity in the Configuration Model