English
Related papers

Related papers: Directed percolation and random walk

200 papers

We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary…

Probability · Mathematics 2013-06-18 Matthias Birkner , Jiri Cerny , Andrej Depperschmidt , Nina Gantert

We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\sim\beta/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is…

Probability · Mathematics 2014-03-04 Noam Berger

We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a…

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

Probability · Mathematics 2018-11-27 Mark Holmes , Thomas S. Salisbury

We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…

Probability · Mathematics 2024-09-26 Sebastian Andres , Nina Gantert , Dominik Schmid , Perla Sousi

We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…

Probability · Mathematics 2026-02-25 Alberto Chiarini , Zhizhou Liu , Maximilian Nitzschner

We study biased random walks on dynamical percolation in $\mathbb{Z}^d$, which were recently introduced by Andres et al. We provide a second order expansion for the asymptotic speed and show for $d \ge 2$ that the speed of the biased random…

Probability · Mathematics 2025-02-13 Assylbek Olzhabayev , Dominik Schmid

We prove quenched invariance principle for simple random walk on the unique infinite percolation cluster for a general class of percolation models on Z^d, d>=2, with long-range correlations introduced in arXiv:1212.2885, solving one of the…

Probability · Mathematics 2015-09-28 Eviatar Procaccia , Ron Rosenthal , Artem Sapozhnikov

We consider random walks in a random environment that is given by i.i.d. Dirichlet distributions at each vertex of Z^d or, equivalently, oriented edge reinforced random walks on Z^d. The parameters of the distribution are a 2d-uplet of…

Probability · Mathematics 2013-09-20 Christophe Sabot , Laurent Tournier

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

Probability · Mathematics 2016-02-09 D. A. Dawson , L. G. Gorostiza

We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary…

Probability · Mathematics 2019-09-12 Matthias Birkner , Nina Gantert , Sebastian Steiber

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

Probability · Mathematics 2010-01-28 Nicholas Crawford , Allan Sly

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…

Quantum Physics · Physics 2014-02-12 Bálint Kollár , Jaroslav Novotný , Tamás Kiss , Igor Jex

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

Probability · Mathematics 2009-10-05 Lorenz A. Gilch , Sebastian Müller

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…

Probability · Mathematics 2007-09-01 Martin T. Barlow , Antal A. Jarai , Takashi Kumagai , Gordon Slade

We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in $\Z^d$ with $d\ge2$. We prove that, for almost every percolation configuration, the path distribution of the walk converges weakly to…

Probability · Mathematics 2007-05-23 Noam Berger , Marek Biskup

We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…

Probability · Mathematics 2013-10-18 Alexander Fribergh , Alan Hammond

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

Probability · Mathematics 2022-09-30 Ercan Sönmez , Arnaud Rousselle

We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…

Probability · Mathematics 2021-06-09 Olivier Garet , Régine Marchand

We show that the problem of directed percolation on an arbitrary lattice is equivalent to the problem of m directed random walkers with rather general attractive interactions, when suitably continued to m=0. In 1+1 dimensions, this is dual…

Statistical Mechanics · Physics 2009-10-31 John Cardy , Francesca Colaiori
‹ Prev 1 2 3 10 Next ›