We investigate the percolative properties of the vacant set left by random interlacements on Z^d, when d is large. A non-negative parameter u controls the density of random interlacements on Z^d. It is known from arXiv:0704.2560, and arXiv:0808.3344, that there is a non-degenerate critical value u_*, such that the vacant set at level u percolates when u < u_*, and does not percolate when u > u_*. Little is known about u_*, however for large d, random interlacements on Z^d, ought to exhibit similarities to random interlacements on a (2d)-regular tree, for which the corresponding critical parameter can be explicitly computed, see arXiv:0907.0316. We prove in this article a lower bound on u_*, which is equivalent to log(d) as d goes to infinity. This lower bound is in agreement with the above mentioned heuristics.
We consider random interlacements on $\mathbb{Z}^d$, $d \ge 3$. We show that the percolation function that to each $u \ge 0$ attaches the probability that the origin does not belong to an infinite cluster of the vacant set at level $u$, is $C^1$ on an interval $[0,û)$, where $û$ is positive and plausibly coincides with the critical level $u_*$ for the percolation of the vacant set. We apply this finding to a constrained minimization problem that conjecturally expresses the exponential rate of decay of the probability that a large box contains an excessive proportion $ν$ of sites that do not be…
We prove that the critical percolation parameter for Finitary Random Interlacements (FRI) is continuous with respect to the path length parameter $T$. The proof uses a result which is interesting on its own right; equality of natural critical parameters for FRI percolation phase transition.
In this paper, we prove a phase transition in the connectivity of Finitary Random interlacements $\mathcal{FI}^{u,T}$ in $\mathbb{Z}^d$, with respect to the average stopping time. For each $u>0$, with probability one $\mathcal{FI}^{u,T}$ has no infinite connected component for all sufficiently small $T>0$, and a unique infinite connected component for all sufficiently large $T<\infty$. This answers a question of Bowen in the special case of $\mathbb{Z}^d$.
We consider random interlacements on $ \mathbb{Z}^d$, $d \ge 3$, when their vacant set is in a strongly percolative regime. Given a large box centered at the origin, we establish an asymptotic upper bound on the exponential rate of decay of the probability that the box contains an excessive fraction $ν$ of points that are disconnected by random interlacements from the boundary of a concentric box of double size. As an application we show that when $ν$ is not too large, this asymptotic upper bound matches the asymptotic lower bound derived in a previous work of the author, and the exponential r…
On the uniqueness of the infinite cluster of the vacant set of random interlacements
我们考虑Sznitman [Vacant set of random interlacements and percolation（2007）preprint]中介绍的$\mathbb{Z}^d$上的随机交织模型。对于这个模型，我们证明了空集的无限分支的唯一性。作为一个结果，我们得到的概率，起源属于无限组件的超临界阶段$u<u_*$的水平$u$的空集在$u$连续。
In this paper, we study geometric properties of the unique infinite cluster $Γ$ in a sufficiently supercritical Finitary Random Interlacements $\mathcal{FI}^{u,T}$ in $\mathbb{Z}^d, \ d\ge 3$. We prove that the chemical distance in $Γ$ is, with stretched exponentially high probability, of the same order as the Euclidean distance in $\mathbb{Z}^d$. This also implies a shape theorem parallel to those for Bernoulli percolation and random interlacements. We also prove local uniqueness of $\mathcal{FI}^{u,T}$, which says any two large clusters in $\mathcal{FI}^{u,T}$ "close to each other" will with…
It was shown by Le Jan that the occupation field of a Poisson ensemble of Markov loops ("loop soup") of parameter one-half associated to a transient symmetric Markov jump process on a network is half the square of the Gaussian free field on this network. We construct a coupling between these loops and the free field such that an additional constraint holds: the sign of the free field is constant on each cluster of loops. As a consequence of our coupling we deduce that the loop clusters of parameter one-half do not percolate on periodic lattices. We also construct a coupling between the random …
On the size of a finite vacant cluster of random interlacements with small intensity
本文建立了随机交错的空集的渗流的一些性质，其中d至少为5，且强度u较小。随机交织模型是由A.S. Sznitman in arXiv：0704.2560.众所周知，对于小u，几乎可以肯定的是，在由水平u处的随机交错留下的空集合中存在唯一的无限连通分量，参见arXiv：0808.3344和arXiv：0805.4106。我们在这里估计的直径分布和体积的空组件在水平u包含原点，鉴于它是有限的。这是我们的主要定理的副产品，它证明了一个扩展的指数界的概率，交错集分离两个宏观连通集在一个大的立方体。作为另一个应用程序，我们表明，具有很高的概率，唯一的无限连通组件的空集是“无处不在”的大邻域的起源。
In $\mathbb{Z}^d$ with $d\ge 5$, we consider the time constant $ρ_u$ associated to the chemical distance in random interlacements at low intensity $u \ll 1$. We prove an upper bound of order $u^{-1/2}$ and a lower bound of order $u^{-1/2+\varepsilon}$. The upper bound agrees with the conjectured scale in which $u^{1/2}ρ_u$ converges to a constant multiple of the Euclidean norm, as $u\to 0$. Along the proof, we obtain a local lower bound on the chemical distance between the boundaries of two concentric boxes, which might be of independent interest. For both upper and lower bounds, the paper emp…
We introduce a new correlated percolation model on the $d$-dimensional lattice $\mathbb{Z}^d$ called the random length worms model. Assume given a probability distribution on the set of positive integers (the length distribution) and $v \in (0,\infty)$ (the intensity parameter). From each site of $\mathbb{Z}^d$ we start $\mathrm{POI}(v)$ independent simple random walks with this length distribution. We investigate the connectivity properties of the set $\mathcal{S}^v$ of sites visited by this cloud of random walks. It is easy to show that if the second moment of the length distribution is fini…
