arXiv Analytics

Sign in

arXiv:math/0610802 [math.PR]AbstractReferencesReviewsResources

Giant Component and Vacant Set for Random Walk on a Discrete Torus

Itai Benjamini, Alain-Sol Sznitman

Published 2006-10-26, updated 2008-01-11Version 2

We consider random walk on a discrete torus E of side-length N, in sufficiently high dimension d. We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk up to time uN^d. We show that when u is chosen small, as N tends to infinity, there is with overwhelming probability a unique connected component in the vacant set which contains segments of length const log N. Moreover, this connected component occupies a non-degenerate fraction of the total number of sites N^d of E, and any point of E lies within distance an arbitrary fractional power of N from this component.

Comments: 38 pages
Journal: J. Eur. Math. Soc. 10, 133-172, 2008
Categories: math.PR, math-ph, math.CO, math.MP
Subjects: 60K35, 60G50, 82C41, 05C80
Related articles: Most relevant | Search more
arXiv:0804.4097 [math.PR] (Published 2008-04-25)
Logarithmic components of the vacant set for random walk on a discrete torus
arXiv:1010.4595 [math.PR] (Published 2010-10-21, updated 2011-04-16)
Asymptotic normality of the size of the giant component via a random walk
arXiv:math/0607805 [math.PR] (Published 2006-07-31, updated 2007-10-31)
Isoperimetric inequalities and mixing time for a random walk on a random point process