English
Related papers

Related papers: Phase transition for the vacant set of random walk…

200 papers

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…

Probability · Mathematics 2015-05-20 Jiri Cerny , Augusto Teixeira , David Windisch

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…

Probability · Mathematics 2013-12-12 Alexander Drewitz , Dirk Erhard

We study the simple random walk on the giant component of a supercritical Erd\H{o}s-R\'enyi random graph on $n$ vertices, in particular the so-called vacant set at level $u$, the complement of the trajectory of the random walk run up to a…

Probability · Mathematics 2013-10-18 Tobias Wassmer

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…

Probability · Mathematics 2013-08-05 Augusto Teixeira , David Windisch

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…

Probability · Mathematics 2010-06-08 Alain-Sol Sznitman

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

Probability · Mathematics 2015-01-23 Balazs Rath

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…

Probability · Mathematics 2011-01-12 Jiri Cerny , Augusto Teixeira

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

Probability · Mathematics 2010-12-08 Alain-Sol Sznitman

We consider random walk on a discrete torus E of side-length N, in sufficiently high dimension d. We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk…

Probability · Mathematics 2011-11-09 Itai Benjamini , Alain-Sol Sznitman

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

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

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

This work continues the investigation, initiated in a recent work by Benjamini and Sznitman, of percolative properties of the set of points not visited by a random walk on the discrete torus (Z/NZ)^d up to time uN^d in high dimension d. If…

Probability · Mathematics 2009-07-22 David Windisch

Let $X$ be a random walk on the torus of side length $N$ in dimension $d\geq 3$ with uniform starting point, and $t_{\text{cov}}$ be the expected value of its cover time, which is the first time that $X$ has visited every vertex of the…

Probability · Mathematics 2023-09-07 Alexis Prévost , Pierre-François Rodriguez , Perla Sousi

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…

Probability · Mathematics 2011-09-01 Alain-Sol Sznitman

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

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

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

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…

Probability · Mathematics 2009-07-06 Vladas Sidoravicius , 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 ›