Related papers: Bootstrap percolation on spatial networks
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),…
We develop the theory of the k-core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions. We show that the k-core percolation is an unusual, hybrid phase transition with a jump emergence of the k-core…
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…
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…
Bootstrap, or $k$-core, percolation displays on the Bethe lattice a mixed first/second order phase transition with both a discontinuous order parameter and diverging critical fluctuations. I apply the recently introduced $M$-layer technique…
When real networks are considered, coupled networks with connectivity and feedback-dependency links are not rare but more general. Here we develop a mathematical framework and study numerically and analytically percolation of interacting…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
Bootstrap percolation is an often used model to study the spread of diseases, rumors, and information on sparse random graphs. The percolation process demonstrates a critical value such that the graph is either almost completely affected or…
We consider the $r$-neighbor bootstrap percolation process on the graph with vertex set $V=\{0,1\}^n$ and edges connecting the pairs at Hamming distance $1,2,\dots,k$, where $k\ge 2$. We find asymptotics of the critical probability of…
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…
Motivated by the importance of geometric information in real systems, a new model for long-range correlated percolation in link-adding networks is proposed with the connecting probability decaying with a power-law of the distance on the…
In graph bootstrap percolation, edges of an Erd\H{o}s-R\'enyi random graph ${\mathcal G}_{n,p}$ are initially active. Activation spreads to other edges of the complete graph $K_n$ by an iterative process governed by a fixed graph $H$,…
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…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
Networks are ubiquitous in diverse real-world systems. Many empirical networks grow as the number of nodes increases with time. Percolation transitions in growing random networks can be of infinite order. However, when the growth of large…
Axelrod's model with $F=2$ cultural features, where each feature can assume $k$ states drawn from a Poisson distribution of parameter $q$, exhibits a continuous nonequilibrium phase transition in the square lattice. Here we use extensive…
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…
On a geometric model for complex networks (introduced by Krioukov et al.) we investigate the bootstrap percolation process. This model consists of random geometric graphs on the hyperbolic plane having $N$ vertices, a dependent version of…
We compare phase transition and critical phenomena of bond percolation on Euclidean lattices, nonamenable graphs, and complex networks. On a Euclidean lattice, percolation shows a phase transition between the nonpercolating phase and…