arXiv Analytics

Sign in

arXiv:0907.2184 [math.PR]AbstractReferencesReviewsResources

On the Domination of Random Walk on a Discrete Cylinder by Random Interlacements

Alain-Sol Sznitman

Published 2009-07-13Version 1

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of side-length almost of order N, at certain random times comparable to the square of the number of sites in the base. We show a domination control in terms of the trace left in similar boxes by random interlacements in the infinite (d+1)-dimensional cubic lattice at a suitably adjusted level. As an application we derive a lower bound on the disconnection time of the discrete cylinder, which as a by-product shows the tightness of the laws of the ratio of the square of the number of sites in the base to the disconnection time. This fact had previously only been established when d is at least 17, in arXiv: math/0701414.

Comments: 33 pages, accepted for publication in the Electronic Journal of Probability
Journal: Electron. J. Probab., 14, 1670-1704, 2009
Categories: math.PR, math-ph, math.MP
Subjects: 60G50, 60K35, 82C41
Related articles: Most relevant | Search more
arXiv:0805.4516 [math.PR] (Published 2008-05-29)
Random Walks on Discrete Cylinders and Random Interlacements
arXiv:0909.4422 [math.PR] (Published 2009-09-24)
Upper bound on the disconnection time of discrete cylinders and random interlacements
arXiv:math/0701414 [math.PR] (Published 2007-01-15, updated 2008-07-28)
A Lower Bound on the Disconnection Time of a Discrete Cylinder