pith. sign in

arxiv: 1003.1289 · v2 · pith:JGMFSZ2Enew · submitted 2010-03-05 · 🧮 math.PR · math-ph· math.MP

On the critical parameter of interlacement percolation in high dimension

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

The vacant set of random interlacements on ${\mathbb{Z}}^d$, $d\ge3$, has nontrivial percolative properties. It is known from Sznitman [Ann. Math. 171 (2010) 2039--2087], Sidoravicius and Sznitman [Comm. Pure Appl. Math. 62 (2009) 831--858] that there is a nondegenerate critical value $u_*$ such that the vacant set at level $u$ percolates when $u<u_*$ and does not percolate when $u>u_*$. We derive here an asymptotic upper bound on $u_*$, as $d$ goes to infinity, which complements the lower bound from Sznitman [Probab. Theory Related Fields, to appear]. Our main result shows that $u_*$ is equivalent to $\log d$ for large $d$ and thus has the same principal asymptotic behavior as the critical parameter attached to random interlacements on $2d$-regular trees, which has been explicitly computed in Teixeira [Electron. J. Probab. 14 (2009) 1604--1627].

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.