The evolution of the mixing rate of a simple random walk on the giant component of a random graph
From MaRDI portal
Publication:3522830
DOI10.1002/rsa.20210zbMath1147.60316OpenAlexW4247423216MaRDI QIDQ3522830
Nikolaos Fountoulakis, Bruce A. Reed
Publication date: 4 September 2008
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20210
Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50)
Related Items (21)
Mixing times of random walks on dynamic configuration models ⋮ Stochastic forms of non-negative matrices and Perron-regularity ⋮ The mixing time of the giant component of a random graph ⋮ Mean field conditions for coalescing random walks ⋮ Random walk on sparse random digraphs ⋮ Fast mixing via polymers for random graphs with unbounded degree ⋮ Smoothed Analysis on Connected Graphs ⋮ Simple random walk on long range percolation clusters. I: Heat kernel bounds ⋮ Algebraic and combinatorial expansion in random simplicial complexes ⋮ Speeding up random walk mixing by starting from a uniform vertex ⋮ Rankings in directed configuration models with heavy tailed in-degrees ⋮ A random walk on the Rado graph ⋮ Mixing time of near-critical random graphs ⋮ Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk ⋮ Critical random graphs: Diameter and mixing time ⋮ Random walks on the random graph ⋮ Hypercube percolation ⋮ Cutoff for random walk on dynamical Erdős-Rényi graph ⋮ Anatomy of a young giant component in the random graph ⋮ Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs ⋮ Expansion in supercritical random subgraphs of the hypercube and its consequences
Cites Work
This page was built for publication: The evolution of the mixing rate of a simple random walk on the giant component of a random graph
