Related papers: Remarks on Bootstrap Percolation in Metric Network…
Bootstrap percolation provides an emblematic instance of phase behavior characterised by an abrupt transition with diverging critical fluctuations. This unusual hybrid situation generally occurs in particle systems in which the occupation…
This paper is dedicated to the study of the interaction between dynamical systems and percolation models, with views towards the study of viral infections whose virus mutate with time. Recall that r-bootstrap percolation describes a…
Graph bootstrap percolation, introduced by Bollob\'as in 1968, is a cellular automaton defined as follows. Given a "small" graph $H$ and a "large" graph $G = G_0 \subseteq K_n$, in consecutive steps we obtain $G_{t+1}$ from $G_t$ by adding…
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…
In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a…
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…
K-core percolation is a fundamental dynamical process in complex networks with applications that span numerous real-world systems. Earlier studies focus primarily on random networks without spatial constraints and reveal intriguing…
A bootstrap percolation process on a graph with infection threshold $r\ge 1$ is a dissemination process that evolves in time steps. The process begins with a subset of infected vertices and in each subsequent step every uninfected vertex…
Assume that you are given a graph $G=(V,E)$ with an initial coloring, where each node is black or white. Then, in discrete-time rounds all nodes simultaneously update their color following a predefined deterministic rule. This process is…
Geometric inhomogeneous random graphs (GIRGs) are a model for scale-free networks with underlying geometry. We study bootstrap percolation on these graphs, which is a process modelling the spread of an infection of vertices starting within…
The $r$-neighbour bootstrap percolation process on a graph $G$ starts with an initial set $A_0$ of "infected" vertices and, at each step of the process, a healthy vertex becomes infected if it has at least $r$ infected neighbours (once a…
The quintessential property of neuronal systems is their intensive patterns of selective synaptic connections. The current work describes a physics-based approach to neuronal shape modeling and synthesis and its consideration for the…
Motivated by the bootstrap percolation process for graphs, we define a new, high-order generalisation to $k$-uniform hypergraphs, in which we infect $j$-sets of vertices for some integer $1\le j \le k-1$. We investigate the smallest…
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…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We study a random graph $G$ with given degree sequence $\boldsymbol{d}$, with the aim of characterising the degree sequence of the subgraph induced on a given set $S$ of vertices. For suitable $\boldsymbol{d}$ and $S$, we show that the…
We consider the problem of bootstrap percolation on a three dimensional lattice and we study its finite size scaling behavior. Bootstrap percolation is an example of Cellular Automata defined on the $d$-dimensional lattice $\{1,2,...,L\}^d$…
The $r$-neighbor bootstrap percolation is a graph infection process based on the update rule by which a vertex with $r$ infected neighbors becomes infected. We say that an initial set of infected vertices propagates if all vertices of a…
We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes (PPPs) in $\bbR ^2$ of intensities $\lambda$ and $\lambda_E$…
For $r\geq1$, the $r$-neighbour bootstrap process in a graph $G$ starts with a set of infected vertices and, in each time step, every vertex with at least $r$ infected neighbours becomes infected. The initial infection percolates if every…