A lower bound on the critical parameter of interlacement percolation in high dimension (Q718896): Difference between revisions

The notion of random interlacements refers to a microscopic picture left by random walks on large recurrent graphs and is helpful in understanding how random walks create large separating interfaces. The paper extends previous results by the author [Ann. Math. (2) 171, No.~3, 2039--2087 (2010; Zbl 1202.60160)], and \textit{V. Sidoravicius} and the author [Commun. Pure Appl. Math. 62, No.~6, 831--858 (2009; Zbl 1168.60036)] on percolation for a vacant set of random interlacements. The density of random interlacements is controlled by a non-negative parameter \(u\). Little is known about its percolation threshold \(u_*\) in the general setting. The main result of the present work gives an asymptotic lower bound on \(u_*\), which is in agreement with the heuristic paradigm: for large dimension \(d\), random interlacements on \(\mathbb{Z}^d\) ought to exhibit similarities to random interlacements on \(2d\)-regular trees, for which an explicit analytic expression of the critical parameter value is available [\textit{A. Teixeira}, Electron. J. Probab. 14, 1604--1627 (2009; Zbl 1192.60108)].