Related papers: Degree-ordered percolation on hierarchical scale-f…
We introduce models of generic rigidity percolation in two dimensions on hierarchical networks, and solve them exactly by means of a renormalization transformation. We then study how the possibility for the network to self organize in order…
Hyperuniform many-particle systems, which encompass crystals, quasicrystals and certain exotic disordered systems, exhibit an anomalous suppression of density fluctuations on macroscopic length scales relative to those of conventional…
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under…
Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak…
Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…
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…
Percolation is an emblematic model to assess the robustness of interconnected systems when some of their components are corrupted. It is usually investigated in simple scenarios, such as the removal of the system's units in random order, or…
A sandpile model with stochastic toppling rule is studied. The control parameters and the phase diagram are determined through a MF approach, the subcritical and critical regions are analyzed. The model is found to have some similarities…
We study the effect of the connectivity pattern of complex networks on the propagation dynamics of epidemics. The growth time scale of outbreaks is inversely proportional to the network degree fluctuations, signaling that epidemics spread…
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…
Percolation on complex networks has been used to study computer viruses, epidemics, and other casual processes. Here, we present conditions for the existence of a network specific, observation dependent, phase transition in the updated…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
We investigate topologically biased failure in scale-free networks with degree distribution $P(k) \propto k^{-\gamma}$. The probability $p$ that an edge remains intact is assumed to depend on the degree $k$ of adjacent nodes $i$ and $j$…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We introduce a guided network growth model, which we call the degree product rule process, that uses solely local information when adding new edges. For small numbers of candidate edges our process gives rise to a second order phase…
A model of directed percolation processes with colors and flavors that is equivalent to a population model with many species near their extinction thresholds is presented. We use renormalized field theory and demonstrate that all…
We show that to correctly describe the position of the critical line in the Kauffman random boolean networks one must take into account percolation phenomena underlying the process of damage spreading. For this reason, since the issue of…
We study the percolation transition in growing networks under an Achlioptas process (AP). At each time step, a node is added in the network and, with the probability $\delta$, a link is formed between two nodes chosen by an AP. We find that…
The percolation phase transition in complex network systems attracts much attention and has numerous applications in various research fields. Finite size effects smooth the transition and make it difficult to predict the critical point of…