Related papers: Critical percolation on mesoscopic triangulations
Let G be a planar graph with polynomial growth and isoperimetric dimension bigger than 1. Then the critical p for Bernoulli percolation on G satisfies p<1.
A question relating the critical probability for percolation, the critical probability for a unique infinite cluster and graph limits is presented, together with some partial results.
We consider a modification of the contact process incorporating higher-order reaction terms. The original contact process exhibits a non-equilibrium phase transition belonging to the universality class of directed percolation. The…
We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under…
Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0,1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized…
Percolation is a cornerstone concept in physics, providing crucial insights into critical phenomena and phase transitions. In this study, we adopt a kinetic perspective to reveal the scaling behaviors of higher-order gaps in the largest…
We show that the Gromov-Hausdorff-Prohorov scaling limit of a critical percolation cluster on a random hyperbolic triangulation of the half-plane is the Brownian continuum random tree. As a corollary, we obtain that a simple random walk on…
By the Grunbaum-Aksenov Theorem (extending Grotzsch's Theorem) every planar graph with at most three triangles is 3-colorable. However, there are infinitely many planar 4-critical graphs with exactly four triangles. We describe all such…
Through the rotational invariance of the 2-d critical bond percolation exploration path on the square lattice we express Smirnov's edge parafermionic observable as a sum of two new edge observables. With the help of these two new edge…
Let us consider subcritical Bernoulli percolation on a connected, transitive, infinite and locally finite graph. In this paper, we propose a new (and short) proof of the exponential decay property for the volume of clusters. We do not rely…
We expand the critical point for site percolation on the $d$-dimensional hypercubic lattice in terms of inverse powers of $2d$, and we obtain the first three terms rigorously. This is achieved using the lace expansion.
We rigorously prove the existence and the conformal invariance of scaling limits of the magnetization and multi-point spin correlations in the critical Ising model on arbitrary simply connected planar domains. This solves a number of…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…
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…
Previously we developed a local model for a spherically contracting/expanding gas cloud that can be used to study turbulence and small scale instabilities in such flows. In this work we generalise the super-comoving variables used in…
I report on the experimental confirmation that critical percolation statistics underlie the ordering kinetics of twisted nematic phases in the Allen-Cahn universality class. Soon after the ordering starts from a homogeneous disordered phase…
We further study the interfaces arising in a situation of inhomogeneity. More precisely, we identify a characteristic length for the gradient percolation model, that enables us to tighten previous estimates established for it. This allows…
We establish the global lower mass-bound property for the largest connected components in the critical window for the configuration model when the degree distribution has an infinite third moment. The scaling limit of the critical…
Jamming and percolation transitions in the standard random sequential adsorption of particles on regular lattices are characterized by a universal set of critical exponents. The universality class is preserved even in the presence of…