English
Related papers

Related papers: The critical probability for confetti percolation …

200 papers

Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…

Probability · Mathematics 2008-04-26 Jozsef Balogh , Yuval Peres , Gabor Pete

An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…

Probability · Mathematics 2008-03-31 Yuval Peres , Gabor Pete , Ariel Scolnicov

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

Consider a uniformly random regular graph of a fixed degree $d\ge3$, with $n$ vertices. Suppose that each edge is open (closed), with probability $p(q=1-p)$, respectively. In 2004 Alon, Benjamini and Stacey proved that $p^*=(d-1)^{-1}$ is…

Probability · Mathematics 2008-08-27 Boris Pittel

Random arrangements of points in the plane, interacting only through a simple hard core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved…

Mathematical Physics · Physics 2014-08-18 David Aristoff

We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…

Statistical Mechanics · Physics 2015-05-14 Christian R. Scullard , Robert M. Ziff

Corner percolation is a dependent bond percolation model on Z^2 introduced by B\'alint T\'oth, in which each vertex has exactly two incident edges, perpendicular to each other. G\'abor Pete has proven in 2008 that under the maximal entropy…

Probability · Mathematics 2022-12-09 Régine Marchand , Irène Marcovici , Pierrick Siest

The probability that the cluster of the origin in critical site percolation on the triangular grid has diameter larger than $R$ is proved to decay like $R^{-5/48}$ as $R\to\infty$.

Probability · Mathematics 2007-05-23 Gregory F. Lawler , Oded Schramm , Wendelin Werner

We consider the Constrained-degree percolation model in random environment (CDPRE) on the square lattice. In this model, each vertex $v$ has an independent random constraint $\kappa_v$ which takes the value $j\in \{0,1,2,3\}$ with…

Probability · Mathematics 2025-04-30 Diogo C. dos Santos , Roger W. C. Silva

We consider a critical Fortuin-Kasteleyn (FK) percolation with cluster weight $q \in [1,4)$ in the plane, and color its clusters in red (respectively blue) with probability $r \in (0,1)$ (respectively $1-r$), independently of each other. We…

Probability · Mathematics 2025-01-17 Laurin Köhler-Schindler , Matthis Lehmkuehler

We study bootstrap percolation with the threshold parameter $\theta \geq 2$ and the initial probability $p$ on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of…

Probability · Mathematics 2013-12-02 Milan Bradonjić , Iraj Saniee

Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…

Probability · Mathematics 2021-07-22 Bernardo N. B. de Lima , Sébastien Martineau , Humberto C. Sanna , Daniel Valesin

A region of two-dimensional space has been filled randomly with large number of growing circular discs allowing only a `slight' overlapping among them just before their growth stop. More specifically, each disc grows from a nucleation…

Disordered Systems and Neural Networks · Physics 2014-03-11 Abhijit Chakraborty , S. S. Manna

We present an "ultimate" proof of Cardy's formula for the critical percolation on the hexagonal lattice \cite{Smirnov01criticalpercolation}, showing the existence of the universal and conformally invariant scaling limit of crossing…

Probability · Mathematics 2021-12-01 Mikhail Khristoforov , Stanislav Smirnov

We conjecture an exact form for an universal ratio of four-point cluster connectivities in the critical two-dimensional $Q$-color Potts model. We also provide analogous results for the limit $Q\rightarrow 1$ that corresponds to percolation…

Statistical Mechanics · Physics 2018-12-24 Giacomo Gori , Jacopo Viti

In this paper we investigate the critical probability $p_c(Q_n,r)$ for bootstrap percolation with the infection threshold $r$ on the $n$-dimensional hypercube $Q_n$ with vertex set $V(Q_n)=\{0,1\}^n$ and edges connecting the pairs at…

Combinatorics · Mathematics 2025-06-18 Fengxing Zhu

At the critical point in two dimensions, the number of percolation clusters of enclosed area greater than A is proportional to 1/A, with a proportionality constant C that is universal. We show theoretically (based upon Coulomb gas methods),…

Disordered Systems and Neural Networks · Physics 2007-05-23 John Cardy , Robert Ziff

We present a general method for predicting bond percolation thresholds and critical surfaces for a broad class of two-dimensional periodic lattices, reproducing many known exact results and providing excellent approximations for several…

Disordered Systems and Neural Networks · Physics 2009-11-13 Christian R. Scullard , Robert M. Ziff

A method to treat a N-component percolation model as effective one component model is presented by introducing a scaled control variable $p_{+}$. In Monte Carlo simulations on $16^{3}$, $32^{3}$, $64^{3}$ and $128^{3}$ simple cubic lattices…

Disordered Systems and Neural Networks · Physics 2009-02-05 H. M. Harreis , W. Bauer