Related papers: Explosive percolation in graphs
We study a random graph model which is a superposition of the bond percolation model on $Z^d$ with probability $p$ of an edge, and a classical random graph $G(n, c/n)$. We show that this model, being a {\it homogeneous} random graph, has a…
Percolation is a concept widely used in many fields of research and refers to the propagation of substances through porous media (e.g., coffee filtering), or the behaviour of complex networks (e.g., spreading of diseases). Percolation…
Recently, new results on percolation of interdependent networks have shown that the percolation transition can be first order. In this paper we show that, when considering antagonistic interactions between interacting networks, the…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
The location and nature of the percolation transition in random networks is a subject of intense interest. Recently, a series of graph evolution processes have been introduced that lead to discontinuous percolation transitions where the…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
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…
Bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realization of the graph with a given number of initially active nodes. At each step those vertices which have not been active but have at…
Bootstrap percolation on a graph is a deterministic process that 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…
In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation…
This Letter studies the critical point as well as the discontinuity of a class of explosive site percolation in Erd\"{o}s and R\'{e}nyi (ER) random network. The class of the percolation is implemented by introducing a best-of-m rule. Two…
Recently it has been demonstrated that the connectivity transition from microscopic connectivity to macroscopic connectedness, known as percolation, is generically announced by a cascade of microtransitions of the percolation order…
We study a model for coupled networks introduced recently by Buldyrev et al., Nature 464, 1025 (2010), where each node has to be connected to others via two types of links to be viable. Removing a critical fraction of nodes leads to a…
The jigsaw percolation process, introduced by Brummitt, Chatterjee, Dey and Sivakoff, was inspired by a group of people collectively solving a puzzle. It can also be seen as a measure of whether two graphs on a common vertex set are…
Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the…
Transition points mark qualitative changes in the macroscopic properties of large complex systems. Explosive transitions, exhibiting properties of both continuous and discontinuous phase transitions, have recently been uncovered in network…
False-vacuum eternal inflation can be described as a random walk on the network of vacua of the string landscape. In this paper we show that the problem can be mapped naturally to a problem of directed percolation. The mapping relies on two…
We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…
To establish the bond-site duality of explosive percolations in 2 dimension, the site and bond explosive percolation models are carefully defined on a square lattice. By studying the cluster distribution function and the behavior of the…
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…