English
Related papers

Related papers: A new proof of the sharpness of the phase transiti…

200 papers

We prove a local limit theorem for the probability of a site to be connected by disjoint paths to three points in subcritical Bernoulli percolation on $\mathbb{Z}^{d},\,d\geq2$ in the limit where their distances tend to infinity.

Probability · Mathematics 2011-03-11 Massimo Campanino , Michele Gianfelice

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

A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…

Probability · Mathematics 2024-02-21 Geoffrey R. Grimmett , Zhongyang Li

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 perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different…

Statistical Mechanics · Physics 2009-03-19 Tomoaki Nogawa , Takehisa Hasegawa

Consider supercritical long-range percolation on $\Z^d$ where two vertices $x,y \in \Z^d$ are connected with probability asymptotic to $\|x-y\|^{-s}$ for some $s>2d$. Conditioned that the origin is in the infinite cluster, we prove a shape…

Probability · Mathematics 2026-04-29 Johannes Bäumler

Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…

Probability · Mathematics 2010-02-16 Nina Gantert , Yueyun Hu , Zhan Shi

The purpose of this modest note is to point out that the proof of the recent result of Huchcroft concerning continuity of phase transition in Bernoulli percolation is applicable to the setting of the Ising model with free boundary…

Probability · Mathematics 2016-06-14 Aran Raoufi

We study the independent alignment percolation model on $\mathbb{Z}^d$ introduced by Beaton, Grimmett and Holmes [arXiv:1908.07203]. It is a model for random intersecting line segments defined as follows. First the sites of $\mathbb{Z}^d$…

Probability · Mathematics 2026-02-02 Marcelo Hilário , Daniel Ungaretti

We consider the Constrained-degree percolation model in random environment (CDPRE) on the square lattice. In this model, each vertex $v$ has an independent random constraint $\kappa_v$ which takes the value $j\in \{0,1,2,3\}$ with…

Probability · Mathematics 2025-04-30 Diogo C. dos Santos , Roger W. C. Silva

In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…

Probability · Mathematics 2018-06-12 Irina Cristali , Matthew Junge , Rick Durrett

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…

Probability · Mathematics 2020-08-12 Agelos Georgakopoulos , John Haslegrave

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 constrained-degree percolation on the hypercubic lattice. Initially, all edges are closed, and each edge independently attempts to open at a uniformly distributed random time; the attempt succeeds if, at that instant, both…

Probability · Mathematics 2026-02-13 Ivailo Hartarsky , Roger W. C. Silva

Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…

Probability · Mathematics 2026-05-15 Shu Kanazawa , Omer Bobrowski , Primoz Skraba

Several results are presented for site percolation on quasi-transitive, planar graphs $G$ with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1,G_2)$ is a matching pair derived from some quasi-transitive…

Probability · Mathematics 2024-09-12 Geoffrey R. Grimmett , Zhongyang Li

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

On the square lattice raindrops fall on an edge with midpoint $x$ at rate $\|x\|_\infty^{-\alpha}$. The edge becomes open when the first drop falls on it. Let $\rho(x,t)$ be the probability that the edge with midpoint $x=(x_1,x_2)$ is open…

Probability · Mathematics 2017-12-12 Irina Cristali , Matthew Junge , Rick Durrett

We consider the standard site percolation model on the three dimensional cubic lattice. Starting solely with the hypothesis that $\theta(p)>0$, we prove that, for any $\alpha>0$, there exists $\kappa>0$ such that, with probability larger…

Probability · Mathematics 2013-07-12 Raphaël Cerf

Let $\{G_n\}_{n=1}^{\infty}$ be a sequence of transitive infinite connected graphs with $\sup\limits_{n\geq 1} p_c(G_n) < 1,$ where each $p_c(G_n)$ is bond percolation critical probability on $G_n.$ Schramm (2008) conjectured that if $G_n$…

Probability · Mathematics 2014-10-14 He Song , Kai-Nan Xiang , Song-Chao-Hao Zhu