Critical random graphs: Diameter and mixing time

DOI10.1214/07-AOP358MaRDI QIDQ941296zbMATH OpenOpenAlexFDO

Authors Asaf Nachmias, Yuval Peres

Publication date 4 September 2008

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

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

zbMATH Keywords

Random graphRandom walkConnected componentPercolationMixing time

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Percolation (82B43)

Abstract: Let $mathcal{C}_1$ denote the largest connected component of the critical ErdH{o}s--R'{e}nyi random graph $G(n,frac1n)$. We show that, typically, the diameter of $mathcal{C}_1$ is of order $n^{1/3}$ and the mixing time of the lazy simple random walk on $mathcal{C}_1$ is of order $n$. The latter answers a question of Benjamini, Kozma and Wormald. These results extend to clusters of size $n^{2/3}$ of $p$-bond percolation on any $d$-regular $n$-vertex graph where such clusters exist, provided that $p(d-1)le1+O(n^{-1/3})$.

Recommendations

• Mixing time of near-critical random graphs
• The evolution of the mixing rate of a simple random walk on the giant component of a random graph
• Random walks on the random graph
• The mixing time of the giant component of a random graph
• Comparing mixing times on sparse random graphs

Cites work

• scientific article; zbMATH DE number 3163289 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3978019 (Why is no real title available?)
• scientific article; zbMATH DE number 1380601 (Why is no real title available?)
• scientific article; zbMATH DE number 1418385 (Why is no real title available?)
• scientific article; zbMATH DE number 3255217 (Why is no real title available?)
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Critical percolation on random regular graphs
• Galton-Watson trees with the same mean have the same polar sets
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Random subgraphs of the 2D Hamming graph: The supercritical phase
• Random walk on the incipient infinite cluster on trees
• Random walks and the effective resistance of networks
• Random walks, capacity and percolation on trees
• The Structure of a Random Graph at the Point of the Phase Transition
• The critical random graph, with martingales
• The diameter of sparse random graphs
• The diameter of sparse random graphs
• The electrical resistance of a graph captures its commute and cover times
• The evolution of the mixing rate of a simple random walk on the giant component of a random graph
• The mixing time of the giant component of a random graph
• The phase transition in inhomogeneous random graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(47)

• Critical percolation on random regular graphs
• Scaling window for mean-field percolation of averages
• Random walks on the random graph
• The Alexander-Orbach conjecture holds in high dimensions
• Mixing times of random walks on dynamic configuration models
• On the critical probability in percolation
• Geometry of the minimal spanning tree of a random 3-regular graph
• A note about critical percolation on finite graphs
• Anatomy of a Young giant component in the random graph
• Cutoff for random lifts of weighted graphs
• Hypercube percolation
• Critical percolation on random regular graphs
• Mixing time of near-critical random graphs
• Mixing time of molecules inside of nanoporous gold
• Internal DLA on cylinder graphs: fluctuations and mixing
• Mixing properties for hom-shifts and the distance between walks on associated graphs
• Exceptional times of the critical dynamical Erdős-Rényi graph
• A random walk on the Rado graph
• Linear colouring of binomial random graphs
• The evolution of the mixing rate of a simple random walk on the giant component of a random graph
• The diameter of sparse random graphs
• Expansion of Percolation Critical Points for Hamming Graphs
• Unlacing hypercube percolation: a survey
• Global lower mass-bound for critical configuration models in the heavy-tailed regime
• Diameters in supercritical random graphs via first passage percolation
• On the tree-depth of random graphs
• Random subshifts of finite type
• Convergence of mixing times for sequences of random walks on finite graphs
• A branching process with deletions and mergers that matches the threshold for hypercube percolation
• The continuum limit of critical random graphs
• Diameters of random circulant graphs
• Critical percolation on scale-free random graphs: new universality class for the configuration model
• Critical random graphs and the differential equations technique
• The evolution of the cover time
• The critical window in random digraphs
• Universal finite-size scaling for percolation theory in high dimensions
• Mean-field conditions for percolation on finite graphs
• Cycle structure of percolation on high-dimensional tori
• Long-Range Percolation Mixing Time
• Cutoff for lamplighter chains on fractals
• Random walk on the high-dimensional IIC
• The mixing time of the giant component of a random graph
• Random walk on sparse random digraphs
• The largest component in critical random intersection graphs
• Distances in \(\frac{1}{\|x-y\|^{2d}}\) percolation models for all dimensions
• Extremal regime for one-dimensional Mott variable-range hopping
• Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time

This page was built for publication: Critical random graphs: Diameter and mixing time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941296)