English
Related papers

Related papers: Coupling between Brownian motion and random walks …

200 papers

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

We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of…

Probability · Mathematics 2007-05-23 Dayue Chen , Fuxi Zhang

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 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 consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…

Probability · Mathematics 2018-08-10 Jan-Erik Lübbers , Matthias Meiners

Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation…

Probability · Mathematics 2017-06-20 Florian Sobieczky

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

Probability · Mathematics 2012-10-08 Christophe Gallesco , Serguei Popov

We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one…

Probability · Mathematics 2007-10-12 Francis Comets , Francois Simenhaus

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

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 show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the…

Probability · Mathematics 2008-09-26 H. Duminil-Copin

We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…

Probability · Mathematics 2024-12-02 Amine Asselah , Bruno Schapira

Let $\mathcal{C}^n$ be the largest open cluster for supercritical Bernoulli bond percolation in $[-n, n]^d \cap \mathbb{Z}^d$ with $d \ge 2$. We obtain a sharp estimate for the effective resistance on $\mathcal{C}^n$. As an application we…

Probability · Mathematics 2013-06-25 Yoshihiro Abe

We study here a detailed conjecture regarding one of the most important cases of anomalous diffusion, i.e the behavior of the "ant in the labyrinth". It is natural to conjecture (see [16] and [8]) that the scaling limit for random walks on…

Probability · Mathematics 2016-09-16 Gérard Ben Arous , Manuel Cabezas , Alexander Fribergh

We prove that, after centering and diffusively rescaling space and time, the collection of rightmost infinite open paths in a supercritical oriented percolation configuration on the space-time lattice Z^2_{even}:={(x,i) in Z^2: x+i is even}…

Probability · Mathematics 2013-02-06 Anish Sarkar , Rongfeng Sun

We show that the Gromov-Hausdorff-Prohorov scaling limit of a critical percolation cluster on a random hyperbolic triangulation of the half-plane is the Brownian continuum random tree. As a corollary, we obtain that a simple random walk on…

Probability · Mathematics 2023-11-21 Eleanor Archer , David A. Croydon

Let Z_N be the number of self-avoiding paths of length N starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on Z^d with parameter p>p_c(Z^d). The object of this paper is to study the connective…

Probability · Mathematics 2013-06-27 Hubert Lacoin

Consider a random walk among random conductances on $\mathbb{Z}^d$ with $d\geq 2$. We study the quenched limit law under the usual diffusive scaling of the random walk conditioned to have its first coordinate positive. We show that the…

Probability · Mathematics 2013-03-12 Christophe Gallesco , Nina Gantert , Serguei Popov , Marina Vachkovskaia

We derive asymptotics for the probability of the origin to be an extremal point of a random walk in R^n. We show that in order for the probability to be roughly 1/2, the number of steps of the random walk should be between e^{c n / log n}$…

Probability · Mathematics 2013-03-19 Ronen Eldan
‹ Prev 1 2 3 10 Next ›