English
Related papers

Related papers: A lower bound on the two-arms exponent for critica…

200 papers

Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. Cerf (2015) pointed out that from classical work by Aizenman, Kesten and Newman (1987) and Gandolfi, Grimmett and Russo (1988) one can obtain that the two-arms exponent…

Probability · Mathematics 2020-09-29 Jacob van den Berg , Diederik van Engelenburg

Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…

Probability · Mathematics 2014-04-09 Demeter Kiss

Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. We prove a lower bound of order $n^{- d^2}$ for point-to-point connection probabilities, where $n$ is the distance between the points. Most of the work in our proof…

Probability · Mathematics 2019-12-24 J. van den Berg , H. Don

We introduce a notion of capacity for high dimensional critical percolation by showing that for any finite set $A$, the suitably rescaled probability that the cluster of $z$ intersects $A$ converges as $\|z\|\to\infty$. This can be viewed…

Probability · Mathematics 2025-09-26 Amine Asselah , Bruno Schapira , Perla Sousi

For two-dimensional percolation at criticality, we discuss the inequality $\alpha_4 > 1$ for the polychromatic four-arm exponent (and stronger versions, the strongest so far being $\alpha_4 \geq 1 + \frac{\alpha_2}{2}$, where $\alpha_2$…

Probability · Mathematics 2020-08-05 Jacob van den Berg , Pierre Nolin

We examine the incipient infinite cluster (IIC) of critical percolation in regimes where mean-field behavior has been established, namely when the dimension d is large enough or when d>6 and the lattice is sufficiently spread out. We find…

Probability · Mathematics 2015-05-13 Gady Kozma , Asaf Nachmias

We provide the first nontrivial upper bound for the chemical distance exponent in two-dimensional critical percolation. Specifically, we prove that the expected length of the shortest horizontal crossing path of a box of side length $n$ in…

Probability · Mathematics 2017-08-15 Michael Damron , Jack Hanson , Philippe Sosoe

We study the alternating $k$-arm incipient infinite cluster (IIC) of site percolation on the triangular lattice $\mathbb{T}$. Using Camia and Newman's result that the scaling limit of critical site percolation on $\mathbb{T}$ is CLE$_6$, we…

Probability · Mathematics 2017-07-14 Chang-Long Yao

We study long-range Bernoulli percolation on $\mathbb{Z}^d$ in which each two vertices $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta \|x-y\|^{-d-\alpha})$. It is a theorem of Noam Berger (CMP, 2002) that if…

Probability · Mathematics 2021-02-15 Tom Hutchcroft

We study independent long-range percolation on $\mathbb{Z}^d$ where the vertices $x$ and $y$ are connected with probability $1-e^{-\beta\|x-y\|^{-d-\alpha}}$ for $\alpha > 0$. Provided the critical exponents $\delta$ and $2-\eta$ defined by…

Probability · Mathematics 2024-10-15 Johannes Bäumler , Noam Berger

We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…

Probability · Mathematics 2021-07-14 Agelos Georgakopoulos , Christoforos Panagiotis

Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p=1/2 bond percolation on the square lattice) from general results on the uniqueness of an…

Probability · Mathematics 2009-05-08 Bela Bollobas , Oliver Riordan

In long-range percolation on $\mathbb{Z}^d$, we connect each pair of distinct points $x$ and $y$ by an edge independently at random with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta\geq 0$ is a…

Probability · Mathematics 2024-04-12 Tom Hutchcroft

We provide a complete proof of the diagrammatic bounds on the lace-expansion coefficients for oriented percolation, which are used in [arXiv:math/0703455] to investigate critical behavior for long-range oriented percolation above…

Probability · Mathematics 2007-08-22 Akira Sakai

In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…

Probability · Mathematics 2013-06-10 Vincent Beffara , Hugo Duminil-Copin

We continue our study of the chemical (graph) distance inside large critical percolation clusters in dimension two. We prove new estimates, which involve the three-arm probability, for the point-to-surface and point-to-point distances. We…

Probability · Mathematics 2016-01-15 Michael Damron , Jack Hanson , Philippe Sosoe

We study the size of the near-critical window for Bernoulli percolation on $\mathbb Z^d$. More precisely, we use a quantitative Grimmett-Marstrand theorem to prove that the correlation length, both below and above criticality, is bounded…

Probability · Mathematics 2020-02-07 Hugo Duminil-Copin , Gady Kozma , Vincent Tassion

We discuss a general method to prove quantitative improvements on correlation inequalities and apply it to arm estimates for Bernoulli bond percolation on the square lattice. Our first result is that the two-arm exponent is strictly larger…

Probability · Mathematics 2025-08-27 Ritvik Ramanan Radhakrishnan , Vincent Tassion

All (in)homogeneous bond percolation models on the square, triangular, and hexagonal lattices belong to the same universality class, in the sense that they have identical critical exponents at the critical point (assuming the exponents…

Probability · Mathematics 2021-12-21 Geoffrey R. Grimmett , Ioan Manolescu

For the critical level-set of the Gaussian free field on the metric graph of $\mathbb Z^d$, we consider the one-arm probability $\theta_d(N)$, i.e., the probability that the boundary of a box of side length $2N$ is connected to the center.…

Probability · Mathematics 2024-07-15 Zhenhao Cai , Jian Ding
‹ Prev 1 2 3 10 Next ›