arXiv Analytics

Sign in

arXiv:0909.4422 [math.PR]AbstractReferencesReviewsResources

Upper bound on the disconnection time of discrete cylinders and random interlacements

Alain-Sol Sznitman

Published 2009-09-24Version 1

We study the asymptotic behavior for large $N$ of the disconnection time $T_N$ of a simple random walk on the discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}$, when $d\ge2$. We explore its connection with the model of random interlacements on $\mathbb{Z}^{d+1}$ recently introduced in [Ann. Math., in press], and specifically with the percolative properties of the vacant set left by random interlacements. As an application we show that in the large $N$ limit the tail of $T_N/N^{2d}$ is dominated by the tail of the first time when the supremum over the space variable of the Brownian local times reaches a certain critical value. As a by-product, we prove the tightness of the laws of $T_N/N^{2d}$, when $d\ge2$.

Comments: Published in at http://dx.doi.org/10.1214/09-AOP450 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)
Journal: Annals of Probability 2009, Vol. 37, No. 5, 1715-1746
Categories: math.PR
Subjects: 60G50, 60K35, 82C41
Related articles: Most relevant | Search more
arXiv:0907.2184 [math.PR] (Published 2009-07-13)
On the Domination of Random Walk on a Discrete Cylinder by Random Interlacements
arXiv:0805.4516 [math.PR] (Published 2008-05-29)
Random Walks on Discrete Cylinders and Random Interlacements
arXiv:1103.2079 [math.PR] (Published 2011-03-10)
Cover times in the discrete cylinder