English
Related papers

Related papers: A note on some critical thresholds of Bernoulli pe…

200 papers

The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…

Physics and Society · Physics 2016-06-23 Filippo Radicchi , Claudio Castellano

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

We provide a detailed analysis of the correlation length in the direction parallel to a line of modified coupling constants in the ferromagnetic Potts model on $\mathbb{Z}^d$ at temperatures $T>T_c$. We also describe how a line of weakened…

Mathematical Physics · Physics 2018-08-16 Sébastien Ott , Yvan Velenik

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

A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…

Combinatorics · Mathematics 2022-08-12 Victor Falgas-Ravry , Vincent Pfenninger

The Hamming graph $H(d,n)$ is the Cartesian product of $d$ complete graphs on $n$ vertices. Let $m=d(n-1)$ be the degree and $V = n^d$ be the number of vertices of $H(d,n)$. Let $p_c^{(d)}$ be the critical point for bond percolation on…

Probability · Mathematics 2020-02-19 Lorenzo Federico , Remco van der Hofstad , Frank den Hollander , Tim Hulshof

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

Combinatorics · Mathematics 2025-11-17 Sahar Diskin , Michael Krivelevich

We show that adding epsilon-Bernoulli percolation to an everywhere percolating subgraph of Z^2 results in a graph which has large scale geometry similar to that of supercritical Bernoulli percolation, in various specific senses. We…

Probability · Mathematics 2009-10-31 Itai Benjamini , Olle Häggström , Oded Schramm

Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…

Probability · Mathematics 2025-06-03 Paul Drouvillé

We provide a new proof of the near-critical scaling relation $\beta=\xi_1\nu$ for Bernoulli percolation on the square lattice already proved by Kesten in 1987. We rely on a novel approach that does not invoke Russo's formula, but rather…

Probability · Mathematics 2021-11-30 Hugo Duminil-Copin , Ioan Manolescu , Vincent Tassion

Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…

Statistical Mechanics · Physics 2025-06-16 Fabian Coupette , Tanja Schilling

We consider a first-passage percolation model on a Delaunay triangulation of the plane. In this model each edge is independently equipped with a nonnegative random variable, with distribution function F, which is interpreted as the time it…

Probability · Mathematics 2011-08-15 Leandro P. R. Pimentel

We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…

Probability · Mathematics 2015-12-23 M. Eckhoff , J. Goodman , R. van der Hofstad , F. R. Nardi

We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…

Probability · Mathematics 2023-09-25 Tyler Helmuth , Will Perkins , Michail Sarantis

Despite the recent advances in developing more effective thresholding methods to convert weighted networks to unweighted counterparts, there are still several limitations that need to be addressed. One such limitation is the inability of…

Quantitative Methods · Quantitative Biology 2017-12-04 Farnaz Zamani Esfahlani , Hiroki Sayama

Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…

Probability · Mathematics 2018-04-18 Jan Czajkowski

In this article, we first extend the construction of random interlacements, introduced by A.S. Sznitman in [arXiv:0704.2560], to the more general setting of transient weighted graphs. We prove the Harris-FKG inequality for this model and…

Probability · Mathematics 2009-07-03 Augusto Teixeira

We consider isoperimetric sets, i.e., sets with minimal vertex boundary for a prescribed volume, of the infinite cluster of supercritical site percolation on the triangular lattice. Let $p$ be the percolation parameter and let $p_c$ be the…

Probability · Mathematics 2023-12-19 Chang-Long Yao

We prove that the rescaled one-point fluctuations of the boundary of the percolation cluster in the Bernoulli-Exponential first passage percolation around the diagonal converge to a new family of distributions. The limit law is indexed by…

Probability · Mathematics 2024-09-06 Bálint Vető

We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…

Probability · Mathematics 2015-05-19 Massimo Franceschetti , Mathew D. Penrose , Tom Rosoman