English
Related papers

Related papers: Bootstrap Percolation on Periodic Trees

200 papers

The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…

Probability · Mathematics 2014-12-23 Mohammed Amin Abdullah , Nikolaos Fountoulakis

In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L,p)->(infinity,0),…

Probability · Mathematics 2007-05-23 Janko Gravner , Alexander E. Holroyd

We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…

Probability · Mathematics 2019-08-28 Peter Mühlbacher

This paper analyzes various questions pertaining to bootstrap percolation on the $d$-dimensional Hamming torus where each node is open with probability $p$ and the percolation threshold is 2. For each $d'<d$ we find the critical exponent…

Probability · Mathematics 2017-11-02 Erik Slivken

We consider the $d$-neighbor bootstrap percolation process on the $d$-dimensional torus, with vertex set $V=\{1,\cdots,n\}^d$ and edge set $\{xy:\sum_{i=1}^d|x_i-y_i (\text{mod} \; n)|=1\}$. We determine the percolation time up to a…

Combinatorics · Mathematics 2025-05-19 Fengxing Zhu

We consider bootstrap percolation and diffusion in sparse random graphs with fixed degrees, constructed by configuration model. Every node has two states: it is either active or inactive. We assume that to each node is assigned a…

Probability · Mathematics 2022-09-27 Hamed Amini , Erhan Bayraktar , Suman Chakraborty

We investigate the critical phenomena of the degree-ordered percolation (DOP) model on the hierarchical $(u,v)$ flower network. Using the renormalization-group like procedure, we derive the recursion relations for the percolating…

Statistical Mechanics · Physics 2014-07-01 Hyun Keun Lee , Pyoung-Seop Shim , Jae Dong Noh

We analyze the metastable states near criticality of the bootstrap percolation on Galton-Watson trees. We find that, depending on the exact choice of the offspring distribution, it is possible to have several distinct metastable states,…

Probability · Mathematics 2020-06-17 Assaf Shapira

We study bond percolations on hierarchical scale-free networks with the open bond probability of the shortcuts $\tilde{p}$ and that of the ordinary bonds $p$. The system has a critical phase in which the percolating probability $P$ takes an…

Disordered Systems and Neural Networks · Physics 2010-10-05 Takehisa Hasegawa , Masataka Sato , Koji Nemoto

Bootstrap percolation is a deterministic cellular automaton in which vertices of a graph~$G$ begin in one of two states, "dormant" or "active". Given a fixed integer $r$, a dormant vertex becomes active if at any stage it has at least $r$…

We study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $d\geq 3$. Denoting by $h_\star$ the critical value, we obtain the following results: for $h>h_\star$ we derive estimates on conditional…

Probability · Mathematics 2019-09-05 Angelo Abächerli , Jiří Černý

Two-dimensional bootstrap percolation is a cellular automaton in which sites become 'infected' by contact with two or more already infected nearest neighbors. We consider these dynamics, which can be interpreted as a monotone version of the…

Probability · Mathematics 2010-12-27 Janko Gravner , Alexander E. Holroyd , Robert Morris

Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…

Social and Information Networks · Computer Science 2017-04-26 Yuan Lin , Wei Chen , Zhongzhi Zhang

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

Mathematical Physics · Physics 2015-06-12 Rogério G. Alves , Aldo Procacci , Remy Sanchis

Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…

Disordered Systems and Neural Networks · Physics 2017-09-12 Claudio Grimaldi

Percolation for a planar lattice has a single percolation threshold, whereas percolation for a negatively curved lattice displays two separate thresholds. The enhanced binary tree (EBT) can be viewed as a prototype model displaying two…

Statistical Mechanics · Physics 2015-03-13 Petter Minnhagen , Seung Ki Baek

Bond percolation on infinite heavy-tailed power-law random networks lacks a proper phase transition; or one may say, there is a phase transition at {\em zero percolation probability}. Nevertheless, a finite size percolation threshold…

Disordered Systems and Neural Networks · Physics 2007-05-23 Nima Sarshar , Patrick Oscar Boykin , Vwani P. Roychowdhury

We study the critical probability for the metastable phase transition of the two-dimensional anisotropic bootstrap percolation model with $(1,2)$-neighbourhood and threshold $r = 3$. The first order asymptotics for the critical probability…

Probability · Mathematics 2017-10-10 Hugo Duminil-Copin , Aernout C. D. van Enter , Tim Hulshof

Metastability thresholds lie at the heart of bootstrap percolation theory. Yet proving precise lower bounds is notoriously hard. We show that for two of the most classical models, two-neighbour and Frob\"ose, upper bounds are sharp to…

Probability · Mathematics 2024-04-12 Ivailo Hartarsky , Augusto Teixeira

We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…

Probability · Mathematics 2025-09-08 Peter Gracar , Lukas Lüchtrath , Christian Mönch