Related papers: A Hamiltonian approach for explosive percolation
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
Explosive Percolation describes the abrupt onset of large-scale connectivity that results from a simple random process designed to delay the onset of the transition on an underlying random network or lattice. Explosive percolation…
The evolution of the Erd\H{o}s-R\'enyi (ER) network by adding edges can be viewed as a cluster aggregation process. Such ER processes can be described by a rate equation for the evolution of the cluster-size distribution with the connection…
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…
We introduce a correlated static model and investigate a percolation transition. The model is a modification of the static model and is characterized by assortative degree-degree correlation. As one varies the edge density, the network…
Percolation is a fundamental concept that brought new understanding on the robustness properties of complex systems. Here we consider percolation on weakly interacting networks, that is, network layers coupled together by much less…
Discontinuous percolation transitions and the associated tricritical points are manifest in a wide range of both equilibrium and non-equilibrium cooperative phenomena. To demonstrate this, we present and relate the continuous and first…
The biased link occupation rule in the Achlioptas process (AP) discourages the large clusters to grow much ahead of others and encourages faster growth of clusters which lag behind. In this paper we propose a model where this tendency is…
We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which…
We study numerically a model of nonequilibrium networks where nodes and links are added at each time step with aging of nodes and connectivity- and age-dependent attachment of links. By varying the effects of age in the attachment…
In this paper we introduce a novel description of the equilibrium state of a bond percolation process on random graphs using the exact method of generating functions. This allows us to find the expected size of the giant connected component…
Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…
Percolation on networks is a common framework to model a wide range of processes, from cascading failures to epidemic spreading. Standard percolation assumes short-range interactions, implying that nodes can merge into clusters only if they…
The development of percolation theory was historically shaped by its numerous applications in various branches of science, in particular in statistical physics, and was mainly constrained to the case of Euclidean spaces. One of its central…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
Frozen percolation on the binary tree was introduced by Aldous around fifteen years ago, inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, where connected components stop growing ("freeze") as…
Classical blockmodel is known as the simplest among models of networks with community structure. The model can be also seen as an extremely simply example of interconnected networks. For this reason, it is surprising that the percolation…
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…
We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…
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…