English

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

Probability 2009-09-25 v1

Abstract

We study the asymptotic behavior for large NN of the disconnection time TNT_N of a simple random walk on the discrete cylinder (Z/NZ)d×Z(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}, when d2d\ge2. We explore its connection with the model of random interlacements on Zd+1\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 NN limit the tail of TN/N2dT_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 TN/N2dT_N/N^{2d}, when d2d\ge2.

Keywords

Cite

@article{arxiv.0909.4422,
  title  = {Upper bound on the disconnection time of discrete cylinders and random interlacements},
  author = {Alain-Sol Sznitman},
  journal= {arXiv preprint arXiv:0909.4422},
  year   = {2009}
}

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)