Related papers: Generalized threshold-based epidemics in random gr…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for $r$-neighbour bootstrap percolation on Galton--Watson trees in…
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…
In the past few decades, the frequency of pandemics has been increased due to the growth of urbanization and mobility among countries. Since a disease spreading in one country could become a pandemic with a potential worldwide humanitarian…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
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…
Considerable attention has been paid, in recent years, to the use of networks in modeling complex real-world systems. Among the many dynamical processes involving networks, propagation processes -- in which final state can be obtained by…
Threshold models of global cascades have been extensively used to model real-world collective behavior, such as the contagious spread of fads and the adoption of new technologies. A common property of those cascade models is that a…
Graph bootstrap percolation is a simple cellular automaton introduced by Bollob\'as in 1968. Given a graph $H$ and a set $G \subseteq E(K_n)$ we initially "infect" all edges in $G$ and then, in consecutive steps, we infect every $e \in K_n$…
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…
Given a graph $G$ and assuming that some vertices of $G$ are infected, the $r$-neighbor bootstrap percolation rule makes an uninfected vertex $v$ infected if $v$ has at least $r$ infected neighbors. The $r$-percolation number, $m(G,r)$, of…
For graphs $H$, we study the extremal function $M_H(n)$ which is the maximum running time (until stabilisation) of an $H$-bootstrap percolation process on $n$ vertices. Building on previous work in the clique case $H=K_k$, we develop a…
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…
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…
We study bootstrap percolation processes on random simplicial complexes of some fixed dimension $d \geq 3$. Starting from a single simplex of dimension $d$, we build our complex dynamically in the following fashion. We introduce new…
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…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…
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…