English
Related papers

Related papers: The second term for two-neighbour bootstrap percol…

200 papers

A uniform attachment graph (with parameter $k$), denoted $G_{n,k}$ in the paper, is a random graph on the vertex set $[n]$, where each vertex $v$ makes $k$ selections from $[v-1]$ uniformly and independently, and these selections determine…

Combinatorics · Mathematics 2018-11-15 Hüseyin Acan , Boris Pittel

We consider long-range self-avoiding walk, percolation and the Ising model on $\mathbb{Z}^d$ that are defined by power-law decaying pair potentials of the form $D(x)\asymp|x|^{-d-\alpha}$ with $\alpha>0$. The upper-critical dimension…

Mathematical Physics · Physics 2015-03-18 Lung-Chi Chen , Akira Sakai

In the present article, numerical simulations have been performed to find the bond and site percolation thresholds on two-dimensional Gabriel graphs (GG) for Poisson point processes. GGs belong to the family of proximity graphs and are…

Statistical Mechanics · Physics 2014-06-04 Christoph Norrenbrock

In the bootstrap percolation model, sites in an $L$ by $L$ square are initially independently declared active with probability $p$. At each time step, an inactive site becomes active if at least two of its four neighbours are active. We…

Probability · Mathematics 2007-05-23 Alexander E. Holroyd

Suitable cluster definitions have allowed researchers to describe many ordering transitions in spin systems as geometric phenomena related to percolation. For spin glasses and some other systems with quenched disorder, however, such a…

Disordered Systems and Neural Networks · Physics 2023-05-04 Lambert Münster , Martin Weigel

We present a review of the recent progress on percolation scaling limits in two dimensions. In particular, we will consider the convergence of critical crossing probabilities to Cardy's formula and of the critical exploration path to…

Probability · Mathematics 2008-10-08 Federico Camia

We introduce a simple method for proving lower bounds for the size of the smallest percolating set in a certain graph bootstrap process. We apply this method to determine the sizes of the smallest percolating sets in multidimensional tori…

Combinatorics · Mathematics 2021-05-11 Lianna Hambardzumyan , Hamed Hatami , Yingjie Qian

We study Voronoi percolation on a large class of $d$-dimensional Riemannian manifolds, which includes the hyperbolic spaces $\mathbb{H}^d$, $d\geq 2$. We prove that as the intensity $\lambda$ of the underlying Poisson point process tends to…

Probability · Mathematics 2025-08-07 Tillmann Bühler , Barbara Dembin , Ritvik Ramanan Radhakrishnan , Franco Severo

Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube B_n ={0,1}^n with nearest neighbor edges. For oriented and unoriented percolation, p=e/n and p=1/n are the respective critical…

Probability · Mathematics 2007-05-23 James Allen Fill , Robin Pemantle

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…

Probability · Mathematics 2023-05-17 Daniel Contreras , Sébastien Martineau , Vincent Tassion

We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…

Probability · Mathematics 2020-11-24 Achillefs Tzioufas

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 study percolation on self-dual hypergraphs that contain hyperedges with four bounding vertices, or "four-edges", using three different generators, each containing bonds or sites with three distinct probabilities $p$, $r$, and $t$…

Disordered Systems and Neural Networks · Physics 2015-09-18 Ojan Khatib Damavandi , Robert M. Ziff

Majority bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realisation of the graph with a given number of initially active nodes. At each step those vertices which have more active…

Probability · Mathematics 2015-03-25 Sigurdur Örn Stefánsson , Thomas Vallier

Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…

Probability · Mathematics 2019-10-29 Bernardo N. B. de Lima , Humberto C. Sanna

Two-dimensional bootstrap percolation is usually characterized by bulk observables, but whether increasing the activation threshold qualitatively reorganizes the geometry of the absorbing state has remained unclear. Here we show that the…

Statistical Mechanics · Physics 2026-05-05 Fangfang Wang , Wei Liu , Kai Qi , Ying Tang , Zengru Di

We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+\lambda\delta^{1/\nu}$, with $\nu=4/3$, as the lattice spacing $\delta \to 0$. Our proposed framework extends previous analyses for $p=p_c$, based…

Statistical Mechanics · Physics 2015-06-25 F. Camia , L. R. G. Fontes , C. M. Newman

Given two independent Poisson point processes $\Phi^{(1)},\Phi^{(2)}$ in $R^d$, the continuum AB percolation model is the graph with points of $\Phi^{(1)}$ as vertices and with edges between any pair of points for which the intersection of…

Probability · Mathematics 2010-12-20 Srikanth K. Iyer , D. Yogeshwaran

Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…

Probability · Mathematics 2015-02-19 Christian Hirsch

We consider bootstrap percolation on uncorrelated complex networks. We obtain the phase diagram for this process with respect to two parameters: $f$, the fraction of vertices initially activated, and $p$, the fraction of undamaged vertices…

Statistical Mechanics · Physics 2015-03-13 G J Baxter , S N Dorogovtsev , A V Goltsev , J F F Mendes