Related papers: Attacks and Infections in Percolation Processes
The dynamic behaviour of stochastic spreading processes on a network model based on k-regular graphs is investigated. The contact process and the susceptible-infected-susceptible model for the spread of epidemics are considered as prototype…
Majority bootstrap percolation is a model of infection spreading in networks. Starting with a set of initially infected vertices, new vertices become infected once half of their neighbours are infected. Balogh, Bollob\'{a}s and Morris…
We study the asymptotics of the point process induced by an interacting particle system with mean-field drift interaction. Under suitable assumptions, we establish propagation of chaos for this point process: it has the same weak limit as…
We investigate continuum percolation for Cox point processes, that is, Poisson point processes driven by random intensity measures. First, we derive sufficient conditions for the existence of non-trivial sub- and super-critical percolation…
How the giant component of a network disappears under attacking nodes or links addresses a key aspect of network robustness, which can be framed into percolation problems. Various strategies to select the node to be deactivated have been…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
We conducted Monte Carlo simulations to analyze the percolation transition of a non-symmetric loop model on a regular three-dimensional lattice. We calculated the critical exponents for the percolation transition of this model. The…
The existence or not of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree…
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…
We study the Susceptible-Infected-Recovered model of epidemics in the vicinity of the threshold infectivity. We derive the distribution of total outbreak size in the limit of large population size $N$. This is accomplished by mapping the…
In a recent Letter, Friedman and Landsberg discussed the underlying mechanism of explosive phase transitions on complex networks [Phys. Rev. Lett. 103, 255701 (2009)]. This Brief Report presents a modest, though more insightful extension of…
In this Letter, we show that the explosive percolation is a novel continuous phase transition. The order-parameter-distribution histogram at the percolation threshold is studied in Erd\H{o}s-R\'{e}nyi networks, scale-free networks, and…
This article reviews and presents various solved and open problems in the development, analysis, and control of epidemic models. We are interested in presenting a relatively concise report for new engineers looking to enter the field of…
We study invasion percolation in two dimensions. We compare connectivity properties of the origin's invaded region to those of (a) the critical percolation cluster of the origin and (b) the incipient infinite cluster. To exhibit…
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…
Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…
Every realistic instance of a percolation problem is faced with some degree of polydispersity, e.g., the pore-size distribution of an inhomogeneous medium, the size distribution of filler particles in composite materials, or the vertex…
Temporal networks, whose links are activated or deactivated over time, are used to represent complex systems such as social interactions or collaborations occurring at specific times. Such networks facilitate the spread of information and…
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…
We present an exact solution of percolation in a generalized class of Watts-Strogatz graphs defined on a 1-dimensional underlying lattice. We find a non-classical critical point in the limit of the number of long-range bonds in the system…