Related papers: Cluster aggregation model for discontinuous percol…
Percolation refers to the emergence of a giant connected cluster in a disordered system when the number of connections between nodes exceeds a critical value. The percolation phase transitions were believed to be continuous until recently…
The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…
There is still much to discover about the mechanisms and nature of discontinuous percolation transitions. Much of the past work considers graph evolution algorithms known as Achlioptas processes in which a single edge is added to the graph…
This paper investigates the parallel complexity of several non-equilibrium growth models. Invasion percolation, Eden growth, ballistic deposition and solid-on-solid growth are all seemingly highly sequential processes that yield…
The recent work by Achlioptas, D'Souza, and Spencer opened up the possibility of obtaining a discontinuous (explosive) percolation transition by changing the stochastic rule of bond occupation. Despite the active research on this subject,…
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…
It is widely believed that certain simple modifications of the random graph process lead to discontinuous phase transitions. In particular, starting with the empty graph on $n$ vertices, suppose that at each step two pairs of vertices are…
We investigate percolation on growing networks where the evolution of connected components resembles a non-equilibrium version of the multiplicative coalescent. The supercritical $\pi> \pi_c$ regime for a host of such models was conjectured…
Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the…
The physics of $k$-core percolation pertains to those systems whose constituents require a minimum number of $k$ connections to each other in order to participate in any clustering phenomenon. Examples of such a phenomenon range from…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…
Networks growing according to the rule that every new node has a probability p_k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power law decays of the distribution of cluster sizes in the…
A hybrid percolation transition (HPT) exhibits both discontinuity of the order parameter and critical behavior at the transition point. Such dynamic transitions can occur in two ways: by cluster pruning with suppression of loop formation of…
Understanding what types of phenomena lead to discontinuous phase transitions in the connectivity of random networks is an outstanding challenge. Here we show that a simple stochastic model of graph evolution leads to a discontinuous…
When dynamics in a system proceeds under suppressive external bias, the system can undergo an abrupt phase transition, as it occurs for example in the epidemic spreading. Recently, an explosive percolation (EP) model was introduced in line…
The existence of explosive phase transitions in random (Erd\H os R\'enyi-type) networks has been recently documented by Achlioptas et al.\ [Science {\bf 323}, 1453 (2009)] via simulations. In this Letter we describe the underlying mechanism…
The exchange-driven growth (EDG) model describes the evolution of clusters through the exchange of single monomers between pairs of interacting clusters. The dynamics of this process are primarily influenced by the interaction kernel…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
We analyze an idealized model for the transmission or flow of particles, or discrete packets of information, in a weight bearing branching hierarchical 2-D networks, and its variants. The capacities add hierarchically down the clusters.…
Studying particle-laden flows is essential to understand diverse physical processes such as rain formation in clouds, pathogen transmission, and pollutant dispersal. Distinct clustering patterns are formed in such flows with particles of…