On the mixing time of a simple random walk on the super critical percolation cluster

DOI10.1007/S00440-002-0246-YzbMATH Open1020.60037arXivmath/0011092OpenAlexW2082188103MaRDI QIDQ1400829FDOQ1400829

Itai Benjamini, Elchanan Mossel

Publication date: 14 August 2003

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Abstract: We study the robustness under perturbations of mixing times, by studying mixing times of random walks in percolation clusters inside boxes in $$. We show that for $dgeq2$ and $$, the mixing time of simple random walk on the largest cluster inside ${-n,\mathrm{...},n}^d$ is $Theta(n^2)$ - thus the mixing time is robust up to constant factor.

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

Recommendations

• Mixing time for random walk on supercritical dynamical percolation
• Random walks on supercritical percolation clusters
• The evolution of the mixing rate of a simple random walk on the giant component of a random graph
• Mixing time of near-critical random graphs
• Effective resistances for supercritical percolation clusters in boxes

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Sums of independent random variables; random walks (60G50) Percolation (82B43)

Cited In (39)

• The peculiar phase structure of random graph bisection
• Mixing time for random walk on supercritical dynamical percolation
• Smoothed Analysis on Connected Graphs
• Recent progress on the random conductance model
• Uniformity of the uncovered set of random walk and cutoff for lamplighter chains
• Anomalous heat-kernel decay for random walk among bounded random conductances
• Quenched invariance principles for random walks and elliptic diffusions in random media with boundary
• Mixing time of near-critical random graphs
• Existence of the anchored isoperimetric profile in supercritical bond percolation in dimension two and higher
• Isoperimetric inequalities and mixing time for a random walk on a random point process
• Mean field conditions for coalescing random walks
• Evolving sets, mixing and heat kernel bounds
• Faster mixing and small bottlenecks
• Queues on a dynamically evolving graph
• Growing in time IDLA cluster is recurrent
• Random walks on supercritical percolation clusters
• Long-Range Percolation Mixing Time
• Quantitative homogenization of the parabolic and elliptic Green's functions on percolation clusters
• Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
• Invariance principle for the random conductance model in a degenerate ergodic environment
• Mixing of the symmetric exclusion processes in terms of the corresponding single-particle random walk
• The maximum of log‐correlated Gaussian fields in random environment
• Isoperimetry in Two-Dimensional Percolation
• Cover times for sequences of reversible Markov chains on random graphs
• Quenched invariance principle for random walks with time-dependent ergodic degenerate weights
• Trapping in the random conductance model
• Quenched invariance principle for simple random walk on clusters in correlated percolation models
• On the range of a random walk in a torus and random interlacements
• The mixing time of the giant component of a random graph
• Isoperimetry in supercritical bond percolation in dimensions three and higher
• Intrinsic isoperimetry of the giant component of supercritical bond percolation in dimension two
• Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
• Effective resistances for supercritical percolation clusters in boxes
• An interlacing technique for spectra of random walks and its application to finite percolation clusters
• Mixing times of random walks on dynamic configuration models
• Separation profile, isoperimetry, growth and compression
• The Alexander-Orbach conjecture holds in high dimensions
• Optimal Cheeger cuts and bisections of random geometric graphs
• Isoperimetry and heat kernel decay on percolation clusters.

This page was built for publication: On the mixing time of a simple random walk on the super critical percolation cluster

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