English
Related papers

Related papers: The Alexander-Orbach conjecture holds in high dime…

200 papers

In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form…

Probability · Mathematics 2021-08-02 Shirshendu Chatterjee , Jack Hanson , Philippe Sosoe

We study the Incipient Infinite Cluster (IIC) of high-dimensional bond percolation on $\mathbb{Z}^d$. We prove that the mass dimension of IIC almost surely equals $4$ and the volume growth exponent of IIC almost surely equals $2$.

Probability · Mathematics 2014-05-30 Wouter Cames van Batenburg

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

In this work, we characterize cluster-invariant point processes for critical branching spatial processes on R d for all large enough d when the motion law is $\alpha$-stable or has a finite discrete range. More precisely, when the motion is…

Probability · Mathematics 2022-06-17 Valentin Rapenne

Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…

Statistical Mechanics · Physics 2008-01-13 Richard A. Neher , Klaus Mecke , Herbert Wagner

We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…

Probability · Mathematics 2016-08-15 Gabor Pete

Despite great progress in the study of critical percolation on $\mathbb{Z}^d$ for $d$ large, properties of critical clusters in high-dimensional fractional spaces and boxes remain poorly understood, unlike the situation in two dimensions.…

Probability · Mathematics 2018-10-10 Shirshendu Chatterjee , Jack Hanson

Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven…

Statistical Mechanics · Physics 2009-11-10 Dirk Osterkamp , Dietrich Stauffer , Amnon Aharony

In random percolation one finds that the mean field regime above the upper critical dimension can simply be explained through the coexistence of infinite percolating clusters at the critical point. Because of the mapping between percolation…

High Energy Physics - Lattice · Physics 2009-11-07 G. Andronico , A. Coniglio , S. Fortunato

We study the probability that the origin is connected to the sphere of radius r (an arm event) in critical percolation in high dimensions, namely when the dimension d is large enough or when d>6 and the lattice is sufficiently spread out.…

Probability · Mathematics 2009-11-05 Gady Kozma , Asaf Nachmias

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

We consider high-dimensional percolation at the critical threshold. We condition the origin to be disjointly connected to two points, $x$ and $x'$, and subsequently take the limit as $|x|$, $|x'|$ as well as $|x-x'|$ diverge to infinity.…

Probability · Mathematics 2025-06-10 Manuel Cabezas , Alexander Fribergh , Markus Heydenreich , Antal A. Járai

We study a model of an i.i.d.~random environment in general dimensions $d\ge 2$, where each site is equipped with one of two environments. The model comes with a parameter $p$ which governs the frequency of the first environment, and for…

Probability · Mathematics 2022-08-30 Mark Holmes , Thomas S. Salisbury

Consider percolation on $T\times \mathbb{Z}^d$, the product of a regular tree of degree $k\geq 3$ with the hypercubic lattice $\mathbb{Z}^d$. It is known that this graph has $0<p_c<p_u<1$, so that there are non-trivial regimes in which…

Probability · Mathematics 2024-12-23 Tom Hutchcroft , Minghao Pan

Consider 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}d ud v\}$ for $|i-j|>1$ for some fixed $\beta>0$ and with…

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

The probabilities of clusters spanning a hypercube of dimensions two to seven along one axis of a percolation system under criticality were investigated numerically. We used a modified Hoshen--Kopelman algorithm combined with Grassberger's…

Statistical Mechanics · Physics 2009-11-07 Lev N. Shchur , Timofey Rostunov

We study biased random walk on the infinite connected component of supercritical percolation on the integer lattice $\mathbb{Z}^d$ for $d\geq 2$. For this model, Fribergh and Hammond showed the existence of an exponent $\gamma$ such that:…

Probability · Mathematics 2022-05-10 Adam M. Bowditch , David A. Croydon

The Gaussian model of discontinuous percolation, recently introduced by Ara\'ujo and Herrmann [Phys. Rev. Lett., 105, 035701 (2010)], is numerically investigated in three dimensions, disclosing a discontinuous transition. For the…

Statistical Mechanics · Physics 2011-10-26 K. J. Schrenk , N. A. M. Araújo , H. J. Herrmann

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

Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…

Probability · Mathematics 2007-05-23 Noga Alon , Itai Benjamini , Alan Stacey