Related papers: On the transience of random interlacements
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…
We consider the model of random interlacements on transient graphs, which was first introduced by Sznitman [Ann. of Math. (2) (2010) 171 2039-2087] for the special case of ${\mathbb{Z}}^d$ (with $d\geq3$). In Sznitman [Ann. of Math. (2)…
The random interlacement point process (introduced by Sznitman, generalized by Teixeira) is a Poisson point process on the space of labeled doubly infinite nearest neighbour trajectories modulo time-shift on a transient graph $G$. We show…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
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,…
We consider the random interlacements process with intensity $u$ on ${\mathbb Z}^d$, $d\ge 5$ (call it $I^u$), built from a Poisson point process on the space of doubly infinite nearest neighbor trajectories on ${\mathbb Z}^d$. For $k\ge 3$…
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…
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…
The random interlacements (at level u) is a one parameter family of random subsets of Z^d introduced by Sznitman in arXiv:0704.2560. The vacant set at level u is the complement of the random interlacement at level u. In this paper, we study…
We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…
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 consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and…
We consider continuous-time random interlacements on a transient weighted graph. We prove an identity in law relating the field of occupation times of random interlacements at level u to the Gaussian free field on the weighted graph. This…
We investigate a spatial random graph model whose vertices are given as a marked Poisson process on $\mathbb{R}^d$. Edges are inserted between any pair of points independently with probability depending on the spatial displacement of the…
We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…
We prove the uniqueness of the infinite connected component for the vacant set of random interlacements on general vertex-transitive amenable transient graphs. Our approach is based on connectedness of random interlacements and differs from…
We consider a version of continuum long-range percolation on finite boxes of $\mathbb{R}^d$ in which the vertex set is given by the points of a Poisson point process and each pair of two vertices at distance $r$ is connected with…