English
Related papers

Related papers: $\mathcal{U}$-bootstrap percolation: critical prob…

200 papers

Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^3$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,3\}$,…

Probability · Mathematics 2019-09-02 Daniel Blanquicett

In this paper we study monotone cellular automata in $d$ dimensions. We develop a general method for bounding the growth of the infected set when the initial configuration is chosen randomly, and then use this method to prove a lower bound…

Probability · Mathematics 2022-11-08 Paul Balister , Béla Bollobás , Robert Morris , Paul Smith

Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…

Combinatorics · Mathematics 2024-06-26 Maurício Collares , Joshua Erde , Anna Geisler , Mihyun Kang

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

We study the onset of the bootstrap percolation transition as a model of generalized dynamical arrest. We develop a new importance-sampling procedure in simulation, based on rare events around "holes", that enables us to access bootstrap…

Statistical Mechanics · Physics 2009-11-10 Paolo De Gregorio , Aonghus Lawlor , Phil Bradley , Kenneth A. Dawson

Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in…

Social and Information Networks · Computer Science 2016-03-16 Michele Garetto , Emilio Leonardi , Giovanni Luca Torrisi

By bootstrap percolation we mean the following deterministic process on a graph $G$. Given a set $A$ of vertices "infected" at time 0, new vertices are subsequently infected, at each time step, if they have at least $r\in\mathbb{N}$…

Combinatorics · Mathematics 2009-08-31 József Balogh , Béla Bollobás , Robert Morris

In the $r$-neighbour bootstrap process on a graph $G$, vertices are infected (in each time step) if they have at least $r$ already-infected neighbours. Motivated by its close connections to models from statistical physics, such as the Ising…

Probability · Mathematics 2020-02-27 Ivailo Hartarsky , Robert Morris

We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^{\alpha}$. Setting the ratio of the size of the…

Physics and Society · Physics 2014-08-07 Jian Gao , Tao Zhou , Yanqing Hu

In many interacting particle systems, relaxation to equilibrium is thought to occur via the growth of 'droplets', and it is a question of fundamental importance to determine the critical length at which such droplets appear. In this paper…

Probability · Mathematics 2023-08-22 Paul Balister , Béla Bollobás , Robert Morris , Paul Smith

Phase transitions from an active into an absorbing, inactive state are generically described by the critical exponents of directed percolation (DP), with upper critical dimension d_c = 4. In the framework of single-species…

Condensed Matter · Physics 2009-10-31 Y. Y. Goldschmidt , H. Hinrichsen , M. Howard , U. C. Täuber

We study bootstrap percolation (BP) on hyperbolic lattices obtained by regular tilings of the hyperbolic plane. Our work is motivated by the connection between the BP transition and the dynamical transition of kinetically constrained…

Statistical Mechanics · Physics 2009-12-10 François Sausset , Cristina Toninelli , Giulio Biroli , Gilles Tarjus

Graph bootstrap percolation is a deterministic cellular automaton which was introduced by Bollob\'as in 1968, and is defined as follows. Given a graph $H$, and a set $G \subset E(K_n)$ of initially `infected' edges, we infect, at each time…

Combinatorics · Mathematics 2012-11-27 József Balogh , Béla Bollobás , Robert Morris

Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…

Probability · Mathematics 2022-10-25 Nils Detering , Thilo Meyer-Brandis , Konstantinos Panagiotou

We consider the Erd\"{o}s--R\'{e}nyi random graph $G_{n,p}$ and we analyze the simple irreversible epidemic process on the graph, known in the literature as bootstrap percolation. We give a quantitative version of some results by Janson et…

Probability · Mathematics 2020-01-17 Giovanni Luca Torrisi , Michele Garetto , Emilio Leonardi

In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…

Combinatorics · Mathematics 2019-10-09 Andrew J. Uzzell

We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point…

Probability · Mathematics 2024-12-10 Benedikt Jahnel , Lukas Lüchtrath

Explosive percolation (EP) has received significant research attention due to its rich and anomalous phenomena near criticality. In our recent study [Phys. Rev. Lett. 130, 147101 (2023)], we demonstrated that the correct critical behaviors…

Statistical Mechanics · Physics 2024-09-20 Ming Li , Junfeng Wang , Youjin Deng

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

We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…

Probability · Mathematics 2025-12-23 Joost Jorritsma , Pascal Maillard , Peter Mörters