Related papers: Sharpness and locality for percolation on finite t…
We study the bond percolation on finite graphs induced by the level-sets of zero-average Gaussian free field on the associated metric graph above a given height (level) parameter $h \in \mathbb{R}$. We characterize the near- and…
Let $G$ be an infinite, connected, locally finite planar graph and consider i.i.d.\ Bernoulli$(p)$ site percolation. Write $p_c^{\mathrm{site}}(G)$ and $p_u^{\mathrm{site}}(G)$ for the critical and uniqueness thresholds. Using a…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We prove that the heavy clusters are indistinguishable for Bernoulli percolation on quasi-transitive nonunimodular graphs. As an application, we show that the uniqueness threshold of any quasi-transitive graph is also the threshold for…
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…
We investigate generalisations of the classical percolation critical probabilities $p_c$, $p_T$ and the critical probability $\tilde{p_c}$ defined by Duminil-Copin and Tassion (2015) to bounded degree unimodular random graphs. We further…
We show that there exists a connected graph G with subexponential volume growth such that critical percolation on the product of G with the line has infinitely many infinite clusters. We also give some conditions under which this cannot…
Rigidity Percolation with g degrees of freedom per site is analyzed on randomly diluted Erdos-Renyi graphs with average connectivity gamma, in the presence of a field h. In the (gamma,h) plane, the rigid and flexible phases are separated by…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
Several results are presented for site percolation on quasi-transitive, planar graphs $G$ with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1,G_2)$ is a matching pair derived from some quasi-transitive…
We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…
In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
We prove that the connectivity of the level sets of a wide class of smooth centred planar Gaussian fields exhibits a phase transition at the zero level that is analogous to the phase transition in Bernoulli percolation. In addition to…
We prove that the supercritical phase of Voronoi percolation on $\mathbb{R}^d$, $d\geq 3$, is well behaved in the sense that for every $p>p_c(d)$ local uniqueness of macroscopic clusters happens with high probability. As a consequence,…
A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…
Any infinite graph has site and bond percolation critical probabilities satisfying $p_c^{site}\geq p_c^{bond}$. The strict version of this inequality holds for many, but not all, infinite graphs. In this paper, the class of graphs for which…
We study random subgraphs of an arbitrary finite connected transitive graph $\mathbb G$ obtained by independently deleting edges with probability $1-p$. Let $V$ be the number of vertices in $\mathbb G$, and let $\Omega$ be their degree. We…
We study asymptotic percolation as $N\to \infty$ in an infinite random graph ${\cal G}_N$ embedded in the hierarchical group of order $N$, with connection probabilities depending on an ultrametric distance between vertices. ${\cal G}_N$ is…
Classical bond percolation theory studies the conditions for a given point in a random graph to be connected to infinity, or "escape" to infinity, via a sequence of random edges. In this work, we present a higher-dimensional generalization…