pith. sign in

arxiv: 0908.2206 · v1 · pith:2RLEKNZ5new · submitted 2009-08-17 · 🧮 math.PR · math-ph· math.MP

Connectivity Bounds for the Vacant Set of Random Interlacements

classification 🧮 math.PR math-phmath.MP
keywords interlacementsrandomvacantarxivbiggerconnectivitycriticalparameter
0
0 comments X
read the original abstract

The model of random interlacements on Z^d, d bigger or equal to 3, was recently introduced in arXiv:0704.2560. A non-negative parameter u parametrizes the density of random interlacements on Z^d. In the present note we investigate the connectivity properties of the vacant set left by random interlacements at level u, in the non-percolative regime, where u is bigger than the non-degenerate critical parameter for percolation of the vacant set, see arXiv:0704.2560, arXiv:0808.3344. We prove a stretched exponential decay of the connectivity function for the vacant set at level u, when u is bigger than an other critical parameter. It is presently an open problem whether these two critical parameters actually coincide.

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.