pith. sign in

arxiv: 0909.4422 · v1 · submitted 2009-09-24 · 🧮 math.PR

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

classification 🧮 math.PR
keywords mathbbrandominterlacementstimewhendisconnectiondiscretelarge
0
0 comments X
read the original 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\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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.