English
Related papers

Related papers: Effective resistances for supercritical percolatio…

200 papers

We show that random walk on the incipient infinite cluster (IIC) of two-dimensional critical percolation is subdiffusive in the chemical distance (i.e., in the intrinsic graph metric). Kesten (1986) famously showed that this is true for the…

Probability · Mathematics 2021-07-23 Shirshendu Ganguly , James R. Lee

We show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…

Combinatorics · Mathematics 2018-01-18 Felix Joos , Guillem Perarnau

We study the graph-theoretic properties of the trace of random walks on pseudorandom graphs. We show that for any $\varepsilon>0$, there exists a constant $C$ such that the cover time of an $(n,d,\lambda)$-graph $G$ with $d/\lambda\ge C$ is…

Combinatorics · Mathematics 2026-02-12 Yaobin Chen , Yiting Wang

Coalescing-branching random walks, or {\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spread of information in networks. In a $k$-cobra walk, at each…

Data Structures and Algorithms · Computer Science 2016-03-22 Michael Mitzenmacher , Rajmohan Rajaraman , Scott Roche

We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…

Probability · Mathematics 2023-01-03 Ivailo Hartarsky , Bernardo N. B. de Lima

We consider a discrete time biased random walk conditioned to avoid Bernoulli obstacles on ${\mathbb Z}^d$ ($d\geq 2$) up to time $N$. This model is known to undergo a phase transition: for a large bias, the walk is ballistic whereas for a…

Probability · Mathematics 2020-09-17 Jian Ding , Ryoki Fukushima , Rongfeng Sun , Changji Xu

We prove that, the diffusivity and conductivity on $\mathbb{Z}^d$-Bernoulli percolation ($d \geq 2$) are infinitely differentiable in supercritical regime. This extends a result by Kozlov [Uspekhi Mat. Nauk 44 (1989), no. 2(266), pp 79 -…

Probability · Mathematics 2025-06-10 Chenlin Gu , Wenhao Zhao

Consider bond percolation on the square lattice. Let ${\cal C}$ be the incipient infinite cluster with the incipient measure $\nu$. If a one-arm path exponent exists and equals $5/48$, it is well known that $E_\nu|{\cal C}\cup [-n,n]^2| =…

Probability · Mathematics 2016-03-22 Yu Zhang

This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a…

Probability · Mathematics 2013-01-29 Jean Bertoin

We study the cover time of random walk on dynamical percolation on the torus $\mathbb{Z}_n^d$ in the subcritical regime. In this model, introduced by Peres, Stauffer and Steif, each edge updates at rate $\mu$ to open with probability $p$…

Probability · Mathematics 2023-12-13 Maarten Markering

Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$ and consider a simple symmetric random walk that is killed upon hitting one of the obstacles. For $d \geq 2$ and $p$ strictly above the critical…

Probability · Mathematics 2021-04-01 Jian Ding , Ryoki Fukushima , Rongfeng Sun , Changji Xu

We consider the model of a directed polymer in a random environment defined on the infinite cluster of supercritical Bernoulli bond percolation in dimensions $d \geq 3$. For this model, it was proved in arXiv:2205.06206 that for almost…

Probability · Mathematics 2025-10-29 Francesca Cottini , Maximilian Nitzschner

We consider a discrete time simple symmetric random walk among Bernoulli obstacles on $\mathbb{Z}^d$, $d\geq 2$, where the walk is killed when it hits an obstacle. It is known that conditioned on survival up to time $N$, the random walk…

Probability · Mathematics 2020-05-19 Jian Ding , Ryoki Fukushima , Rongfeng Sun , Changji Xu

We consider the random walk loop soup on the discrete half-plane and study the percolation problem, i.e. the existence of an infinite cluster of loops. We show that the critical value of the intensity is equal to 1/2. The absence of…

Probability · Mathematics 2020-06-11 Titus Lupu

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 establish several equivalent characterisations of the anchored isoperimetric dimension of supercritical clusters in Bernoulli bond percolation on transitive graphs. We deduce from these characterisations together with a theorem of…

Probability · Mathematics 2022-07-13 Tom Hutchcroft

We study the critical long-range percolation on $\mathbb{Z}$, where an edge connects $i$ and $j$ independently with probability $1-\exp\{-\beta\int_i^{i+1}\int_j^{j+1}|u-v|^{-2}{\rm d} u{\rm d} v\}$ for $|i-j|>1$ for some fixed $\beta>0$…

Probability · Mathematics 2025-06-09 Jian Ding , Zherui Fan , Lu-Jing Huang

A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…

Probability · Mathematics 2013-03-27 Frank den Hollander , Renato dos Santos

While classical percolation is well understood, percolation effects in randomly packed or jammed structures are much less explored. Here we investigate both experimentally and theoretically the electrical percolation in a binary composite…

Materials Science · Physics 2021-04-20 Shiva Pokhrel , Brendon Waters , Solveig Felton , Zhi-Feng Huang , Boris Nadgorny

We consider long-range Bernoulli bond percolation on the $d$-dimensional hierarchical lattice in which each pair of points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $0<\alpha<d$ is…

Probability · Mathematics 2022-11-11 Tom Hutchcroft