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

Simple item page
dc.creatorBenjamini, Itai
dc.creatorMossel, Elchanan
dc.date2000-11-14
dc.date2002-02-26
dc.date.accessioned2026-07-07T04:38:35Z
dc.date.available2026-07-07T04:38:35Z
dc.descriptionWe study the robustness under perturbations of mixing times, by studying mixing times of random walks in percolation clusters inside boxes in $\Z^d$. We show that for $d \geq 2$ and $p > p_c(\Z^d)$, the mixing time of simple random walk on the largest cluster inside $\{-n,...,n\}^d$ is $Θ(n^2)$ - thus the mixing time is robust up to constant factor.
dc.identifierhttps://arxiv.org/abs/math/0011092
dc.identifierhttp://arxiv.org/abs/math/0011092
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60336
dc.subjectProbability
dc.subjectCombinatorics
dc.titleOn the mixing time of simple random walk on the super critical percolation cluster
dc.typetext

Files

Collections

arXiv