English
Related papers

Related papers: Critical Parameters for Loop and Bernoulli Percola…

200 papers

We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…

Combinatorics · Mathematics 2022-01-12 Nikolaos Fountoulakis , Felix Joos , Guillem Perarnau

We prove Schramm's locality conjecture for Bernoulli bond percolation on transitive graphs: If $(G_n)_{n\geq 1}$ is a sequence of infinite vertex-transitive graphs converging locally to a vertex-transitive graph $G$ and $p_c(G_n) \neq 1$…

Probability · Mathematics 2023-10-18 Philip Easo , Tom Hutchcroft

We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…

Probability · Mathematics 2026-03-03 Sébastien Martineau , Christoforos Panagiotis

We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…

Probability · Mathematics 2022-07-28 Tom Hutchcroft

We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

Probability · Mathematics 2016-02-09 D. A. Dawson , L. G. Gorostiza

On a locally finite, infinite tree $T$, let $p_c(T)$ denote the critical probability for Bernoulli percolation. We prove that every positively associated, finite-range dependent percolation model on $T$ with marginals $p > p_c(T)$ must…

Probability · Mathematics 2024-05-14 Laurin Köhler-Schindler , Aurelio L. Sulser

The unitarily invariant probability measures on infinite Hermitian matrices have been classified by Pickrell, and by Olshanski and Vershik. This classification is equivalent to determining the boundary of a certain inhomogeneous Markov…

Probability · Mathematics 2020-08-21 Theodoros Assiotis , Joseph Najnudel

We show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…

Combinatorics · Mathematics 2018-01-18 Felix Joos , Guillem Perarnau

The vacant set of random interlacements on ${\mathbb{Z}}^d$, $d\ge3$, has nontrivial percolative properties. It is known from Sznitman [Ann. Math. 171 (2010) 2039--2087], Sidoravicius and Sznitman [Comm. Pure Appl. Math. 62 (2009) 831--858]…

Probability · Mathematics 2010-12-08 Alain-Sol Sznitman

We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…

Probability · Mathematics 2022-05-31 Naoki Kubota , Masato Takei

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 consider the convergence of the eigenvalues to the support of the equilibrium measure in the $\beta$ ensemble models under a critical condition. We show a phase transition phenomenon, namely that, with probability one, all eigenvalues…

Probability · Mathematics 2015-05-29 Chenjie Fan , Alice Guionnet , Yuqi Song , Andi Wang

The Hamming torus of dimension $d$ is the graph with vertices $\{1,\dots,n\}^d$ and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with threshold $\theta$ starts with a random set of open…

Probability · Mathematics 2015-01-26 Janko Gravner , Christopher Hoffman , James Pfeiffer , David Sivakoff

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

Probability · Mathematics 2025-12-18 Remco van der Hofstad

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 give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…

Probability · Mathematics 2021-06-09 Olivier Garet , Régine Marchand

For a general class of percolation models with long-range correlations on $\mathbb Z^d$, $d\geq 2$, introduced in arXiv:1212.2885, we establish regularity conditions of Barlow arXiv:math/0302004 that mesoscopic subballs of all large enough…

Probability · Mathematics 2015-12-04 Artem Sapozhnikov

We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…

Probability · Mathematics 2017-02-16 Souvik Dhara , Remco van der Hofstad , Johan S. H. van Leeuwaarden , Sanchayan Sen

We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite clusters at critical Bernoulli percolation. In the case of heavy…

Probability · Mathematics 2016-08-14 Ádám Timár
‹ Prev 1 3 4 5 6 7 10 Next ›