English
Related papers

Related papers: Nontrivial upper bound for chemical distance on th…

200 papers

We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…

Probability · Mathematics 2025-11-13 Shirshendu Chatterjee , Pranav Chinmay , Jack Hanson , Philippe Sosoe

We consider translationally-invariant percolation models on $\mathbb{Z}^d$ satisfying the finite energy and the FKG properties. We provide explicit upper bounds on the probability of having two distinct clusters going from the endpoints of…

Probability · Mathematics 2016-09-23 Hugo Duminil-Copin , Dmitry Ioffe , Yvan Velenik

We initiate the study on chemical distances of percolation clusters for level sets of two-dimensional discrete Gaussian free fields as well as loop clusters generated by two-dimensional random walk loop soups. One of our results states that…

Probability · Mathematics 2018-02-27 Jian Ding , Li Li

The chemical distance D(x,y) is the length of the shortest open path between two points x and y in an infinite Bernoulli percolation cluster. In this work, we study the asymptotic behaviour of this random metric, and we prove that, for an…

Probability · Mathematics 2007-07-31 Olivier Garet , Régine Marchand

We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…

Probability · Mathematics 2020-11-24 Achillefs Tzioufas

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

The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…

Mathematical Physics · Physics 2009-09-29 E. S. Antonova , Yu. P. Virchenko

We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.

Probability · Mathematics 2026-03-17 Pablo A. Gomes , Alan Pereira , Remy Sanchis

We show quenched large deviations for the simple random walk on a certain class of percolations with long-range correlations. This class contains the supercritical Bernoulli percolations, the model considered by Drewitz, R'ath and…

Probability · Mathematics 2013-11-04 Kazuki Okamura

This paper studies the critical and near-critical regimes of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4]$ using novel coupling techniques. More precisely, we derive the scaling relations between the…

Probability · Mathematics 2020-12-01 Hugo Duminil-Copin , Ioan Manolescu

We derive an estimate for the distance, measured in lattice spacings, inside two-dimensional critical percolation clusters from the origin to the boundary of the box of side length $2n$, conditioned on the existence of an open connection.…

Probability · Mathematics 2022-01-31 Philippe Sosoe , Lily Reeves

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

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

In this paper, we derive upper bounds for the heat kernel of the simple random walk on the infinite cluster of a supercritical long range percolation process. For any $d \geq 1$ and for any exponent $s \in (d, (d+2) \wedge 2d)$ giving the…

Probability · Mathematics 2009-11-30 Nicholas Crawford , Allan Sly

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

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

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

We consider the standard site percolation model on the $d$-dimensional lattice. A direct consequence of the proof of the uniqueness of the infinite cluster of Aizenman, Kesten and Newman [Comm. Math. Phys. 111 (1987) 505-531] is that the…

Probability · Mathematics 2015-10-30 Raphaël Cerf

Considering supercritical Bernoulli percolation on $\mathbb{Z}^d$, Garet and Marchand [GM09] proved a diffusive concentration for the graph distance. In this paper, we sharpen this result by establishing the subdiffusive concentration…

Probability · Mathematics 2025-08-27 Van Hao Can , Van Quyet Nguyen
‹ Prev 1 2 3 10 Next ›