Related papers: Vacant Set of Random Interlacements and Percolatio…
We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…
The vacant set of random interlacements at level $u>0$, introduced in arXiv:0704.2560, is a percolation model on $\mathbb{Z}^d$, $d \geq 3$ which arises as the set of sites avoided by a Poissonian cloud of doubly infinite trajectories,…
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…
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…
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]…
We consider the set of points visited by the random walk on the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, for $d \geq 3$, at times of order $uN^d$, for a parameter $u>0$ in the large-$N$ limit. We prove that the vacant set left by the…
We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…
Random interlacements at level u is a one parameter family of connected random subsets of Z^d, d>=3 introduced in arXiv:0704.2560. Its complement, the vacant set at level u, exhibits a non-trivial percolation phase transition in u, as shown…
In this paper we establish some properties of percolation for the vacant set of random interlacements, for d at least 5 and small intensity u. The model of random interlacements was first introduced by A.S. Sznitman in arXiv:0704.2560. It…
The model of random interlacements is a one-parameter family $\mathcal I^u,$ $u \ge 0,$ of random subsets of $\mathbb{Z}^d,$ which locally describes the trace of simple random walk on a $d$-dimensional torus run up to time $u$ times its…
We consider a Poisson point process on the space of lines in R^d, where a multiplicative factor u>0 of the intensity measure determines the density of lines. Each line in the process is taken as the axis of a bi-infinite cylinder of radius…
We study the percolative properties of random interlacements on the product of G with the integer line Z, when G is a weighted graph satisfying certain sub-Gaussian estimates attached to the parameters alpha > 1, measuring the volume growth…
We consider a simple random walk on a discrete torus (Z/NZ)^d with dimension d at least 3 and large side length N. For a fixed constant u > 0, we study the percolative properties of the vacant set, consisting of the set of vertices not…
The main focus of this article concerns the strongly percolative regime of the vacant set of random interlacements on $ \mathbb{Z}^d$, with $d \ge 3$. We investigate the occurrence in a large box of an excessive fraction of sites that get…
We consider continuous-time random interlacements on Z^d, d greater or equal to 3, and investigate the percolation model where a site x of Z^d is occupied if the total amount of time spent at x by all the trajectories of the interlacement…
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…
For the model of two-dimensional random interlacements in the critical regime (i.e., $\alpha=1$), we prove that the vacant set is a.s.\ infinite, thus solving an open problem from arXiv:1502.03470. Also, we prove that the entrance measure…
In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [arXiv:0704.2560], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and…
We consider the simple random walk on a random d-regular graph with n vertices, and investigate percolative properties of the set of vertices not visited by the walk until time un, where u > 0 is a fixed positive parameter. It was shown in…
We consider $Z^d$, with d bigger or equal to three. We investigate the vacant set of random interlacements in the strongly percolative regime, the vacant set of the simple random walk, and the excursion set above a given level of the…