Amir Dembo, Alain-Sol Sznitman
Published 2007-01-15, updated 2008-07-28Version 2
We study the asymptotic behavior for large N of the disconnection time T_N of simple random walk on a discrete cylinder with base a d-dimensional discrete torus of side-length N. When d is sufficiently large, we are able to substantially improve the lower bounds obtained by the authors in a previous article when d is bigger or equal to 2. We show here that the laws of N^(2d)/T_N are tight.
Comments: 17 pages, this article appears in the volume In and Out of Equilibrium 2, V. Sidoravicius and M. E. Vares Editors
Journal: In and Out of Equilibrium 2, Progress in Probability, vol. 60, 211-227, Birkhauser, (2008)
How universal are asymptotics of disconnection times in discrete cylinders?
On the Domination of Random Walk on a Discrete Cylinder by Random Interlacements
A lower bound on the critical parameter of interlacement percolation in high dimension
![QR code for arXiv:math/0701414 [math.PR]](http://oss.arxitics.com/images/favicon.svg)