English
Related papers

Related papers: Soft local times and decoupling of random interlac…

200 papers

In this paper we obtain a decoupling feature of the random interlacements process $\mathcal{I}^u \subset \mathbb{Z}^d$, at level $u$, $d\geq 3$. More precisely, we show that the trace of the random interlacements process on two disjoint…

Probability · Mathematics 2019-11-06 Diego F. de Bernardini , Christophe Gallesco , Serguei Popov

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…

Probability · Mathematics 2013-10-31 Alexander Drewitz , Balazs Rath , Artem Sapozhnikov

In this article, we consider the interlacement set $\mathcal{I}^u$ at level $u>0$ on $\mathbb{Z}^d$, $d \geq3$, and its finite range version $\mathcal{I}^{u,L}$ for $L >0$, given by the union of the ranges of a Poisson cloud of random walks…

For $d\ge 3$ we construct a new coupling of the trace left by a random walk on a large $d$-dimensional discrete torus with the random interlacements on $\mathbb Z^d$. This coupling has the advantage of working up to macroscopic subsets of…

Probability · Mathematics 2014-12-01 Jiří Černý , Augusto Teixeira

In this paper we consider the field of local times of a discrete-time Markov chain on a general state space, and obtain uniform (in time) upper bounds on the total variation distance between this field and the one of a sequence of $n$…

Probability · Mathematics 2019-03-25 Diego F. de Bernardini , Christophe Gallesco , Serguei Popov

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$…

Probability · Mathematics 2012-07-05 Hubert Lacoin , Johan Tykesson

We prove a shape theorem for the internal (graph) distance on the interlacement set $\mathcal{I}^u$ of the random interlacement model on $\mathbb Z^d$, $d\ge 3$. We provide large deviation estimates for the internal distance of distant…

Probability · Mathematics 2015-03-19 Jiří Černý , Serguei Popov

We consider suspensions of rigid bodies in a two-dimensional viscous fluid. Even with high-fidelity numerical methods, unphysical contact between particles occurs because of spatial and temporal discretization errors. We apply the method of…

Numerical Analysis · Mathematics 2018-05-01 Lukas Bystricky , Sachin Shanbhag , Bryan D. Quaife

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…

Probability · Mathematics 2009-07-06 Alain-Sol Sznitman

We consider the the vacant set $\mathcal{V}^u$ of random interlacements on $\mathbb{Z}^d$ in dimensions $d \ge 3$. For varying intensity $u > 0$, the connectivity properties of $\mathcal V^u$ undergo a percolation phase transition across a…

Probability · Mathematics 2025-10-21 Subhajit Goswami , Pierre-François Rodriguez , Yuriy Shulzhenko

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…

Probability · Mathematics 2015-05-13 Vladas Sidoravicius , Alain-Sol Sznitman

The random interlacements $\mathscr{I}(u)$ at level $u$ has been introduced by Sznitman, as a Poissonian collection of independent simple random walk trajectories on $\mathbb{Z}^d$, $d\geq 3$, with intensity $u>0$. Since then, several works…

Probability · Mathematics 2025-05-22 Nicolas Bouchot

We investigate the relation between the local picture left by the trajectory of a simple random walk on the torus (Z/NZ)^d, d >= 3, until u N^d time steps, u > 0, and the model of random interlacements recently introduced by Sznitman. In…

Probability · Mathematics 2009-07-22 David Windisch

We investigate the asymptotic disconnection time of a large discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^{d}\times \mathbb{Z}$, $d\geq 2$, by simple and biased random walks. For simple random walk, we derive a sharp asymptotic lower bound…

Probability · Mathematics 2024-09-27 Xinyi Li , Yu Liu , Yuanzheng Wang

We consider a percolation model, the vacant set $\mathcal{V}^u$ of random interlacements on $\mathbb{Z}^d$, $d \geq 3$, in the regime of parameters $u>0$ in which it is strongly percolative. By definition, such values of $u$ pinpoint a…

Consider the random set composed of particles initially distributed on Zd, d >= 2, according to a Poisson point process of intensity u > 0 and moving as independent simple symmetric random walks, the trap particles. We are interested in the…

Probability · Mathematics 2025-07-22 Gonzalo Panizo , Carlos Martínez

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…

Probability · Mathematics 2013-02-08 Balazs Rath , Artem Sapozhnikov

We study the asymptotic behavior for large $N$ of the disconnection time $T_N$ of a simple random walk on the discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}$, when $d\ge2$. We explore its connection with the model of random…

Probability · Mathematics 2009-09-25 Alain-Sol Sznitman

In this article we obtain uniform estimates on the absorption of Brownian motion by porous interfaces surrounding a compact set. An important ingredient is the construction of certain resonance sets, which are hard to avoid for Brownian…

Probability · Mathematics 2020-07-08 Maximilian Nitzschner , Alain-Sol Sznitman

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…

Probability · Mathematics 2012-03-19 Balázs Ráth , Artëm Sapozhnikov
‹ Prev 1 2 3 10 Next ›