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

Abstract

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\ge 2$. 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\ge 2$.

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)

References in corpus (1)

• How universal are asymptotics of disconnection times in discrete cylinders?

Cited by in corpus (10)

• Decoupling inequalities and interlacement percolation on G x Z
• Equality of critical parameters for percolation of Gaussian free field level-sets
• Giant vacant component left by a random walk in a random d-regular graph
• The effect of small quenched noise on connectivity properties of random interlacements
• Critical fragmentation properties of random drilling: How many random holes need to be drilled to collapse a wooden cube?
• Cover levels and random interlacements
• Connectivity Bounds for the Vacant Set of Random Interlacements
• Random interlacements and amenability
• On the critical parameter of interlacement percolation in high dimension
• First passage percolation with long-range correlations and applications to random Schrödinger operators