English
Related papers

Related papers: Effective resistances for supercritical percolatio…

200 papers

We study the robustness under perturbations of mixing times, by studying mixing times of random walks in percolation clusters inside boxes in $\Z^d$. We show that for $d \geq 2$ and $p > p_c(\Z^d)$, the mixing time of simple random walk on…

Probability · Mathematics 2007-05-23 Itai Benjamini , Elchanan Mossel

For the supercritical Bernoulli bond percolation on $\mathbb{Z}^d$ ($d \geq 2$), we give a coupling between the random walk on the infinite cluster and its limit Brownian motion, such that the maximum distance between the paths during…

Probability · Mathematics 2025-08-05 Chenlin Gu , Zhonggen Su , Ruizhe Xu

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

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

Let $R_n$ be the range of a critical branching random walk with $n$ particles on $\mathbb Z^d$, which is the set of sites visited by a random walk indexed by a critical Galton--Watson tree conditioned on having exactly $n$ vertices. For…

Probability · Mathematics 2023-07-27 Tianyi Bai , Yueyun Hu

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 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 prove the almost sure ('quenched') invariance principle for a random walker on an infinite Bernoulli percolation cluster in $\Z^d$ where $d$ is larger or equal than 2.

Probability · Mathematics 2012-09-11 P. Mathieu , A. L. Piatnitski

In this paper we prove that, under the assumption of quasi-transitivity, if a branching random walk on ${{\mathbb{Z}}^d}$ survives locally (at arbitrarily large times there are individuals alive at the origin), then so does the same process…

Probability · Mathematics 2015-06-22 Daniela Bertacchi , Fabio Zucca

We consider a $d$-dimensional correlated percolation problem of sites {\em not} visited by a random walk on a hypercubic lattice $L^d$ for $d=3$, 4 and 5. The length of the random walk is ${\cal N}=uL^d$. Close to the critical value…

Statistical Mechanics · Physics 2024-08-21 Raz Halifa Levi , Yacov Kantor

We consider (near-)critical percolation on the square lattice. Let M_n be the size of the largest open cluster contained in the box [-n,n]^2, and let pi(n) be the probability that there is an open path from O to the boundary of the box. It…

Probability · Mathematics 2012-08-23 Jacob van den Berg , Rene Conijn

Let $\mathcal{C}_1$ denote the largest connected component of the critical Erd\H{o}s--R\'{e}nyi random graph $G(n,{\frac{1}{n}})$. We show that, typically, the diameter of $\mathcal{C}_1$ is of order $n^{1/3}$ and the mixing time of the…

Probability · Mathematics 2009-09-29 Asaf Nachmias , Yuval Peres

Consider critical bond percolation on a large 2n by 2n box on the square lattice. It is well-known that the size (i.e. number of vertices) of the largest open cluster is, with high probability, of order n^2 \pi(n), where \pi(n) denotes the…

Probability · Mathematics 2013-12-13 Jacob van den Berg , Rene Conijn

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 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 prove that the heat kernel on the infinite Bernoulli percolation cluster in Z^d almost surely decays faster than t^{-d/2}. We also derive estimates on the mixing time for the random walk confined to a finite box. Our approach is based on…

Probability · Mathematics 2012-09-11 Pierre Mathieu , Elisabeth Remy

We consider critical oriented Bernoulli percolation on the square lattice $\mathbb{Z}^2$. We prove a Russo-Seymour-Welsh type result which allows us to derive several new results concerning the critical behavior: - We establish that the…

Probability · Mathematics 2016-11-01 Hugo Duminil-Copin , Vincent Tassion , Augusto Teixeira

We discuss the following type of results about critical Bernoulli percolation in high dimensions: The collection of clusters that do contain large (self-avoiding) loops in a large box is tight. The collection of these large loops has…

Probability · Mathematics 2025-08-07 Amelia Carpenter , Wendelin Werner

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
‹ Prev 1 2 3 10 Next ›