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

DOI10.1007/S00440-002-0246-YMaRDI QIDQ1400829zbMATH OpenOpenAlexFDO

Authors Itai Benjamini, Elchanan Mossel

Publication date 14 August 2003

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

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

Mathematics Subject Classification ID

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

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.

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

Cited in

(42)

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

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)