Related papers: Percolation on interacting, antagonistic networks
Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to…
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…
In the analysis of the robustness of multiplex networks, it is commonly assumed that a node is functioning only if its interdependent nodes are simultaneously functioning. According to this model, a multiplex network becomes more and more…
In the real world, the stable operation of a network is usually inseparable from the mutual support of other networks. In such an interdependent network, a node in one layer may depend on multiple nodes in another layer, forming a complex…
Hypergraphs capture the higher-order interactions in complex systems and always admit a factor graph representation, consisting of a bipartite network of nodes and hyperedges. As hypegraphs are ubiquitous, investigating hypergraph…
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…
We propose a statistical model defined on the three-dimensional diamond network where the splitting of randomly selected nodes leads to a spatially disordered network, with decreasing degree of connectivity. The terminal state, that is…
We investigate the steady state of a two-dimensional random resistor network subjected to two competing biased percolations as a function of the bias strength. The properties of the linear and nonlinear regimes are studied by means of Monte…
The use of degree-degree correlations to model realistic networks which are characterized by their Pearson's coefficient, has become widespread. However the effect on how different correlation algorithms produce different results on…
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…
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…
Percolation theory characterizing the robustness of a network has applications ranging from biology, to epidemic spreading, and complex infrastructures. Percolation theory, however, only concern the typical response of a infinite network to…
Most real-world complex systems can be modelled by coupled networks with multiple layers. How and to what extent the pattern of couplings between network layers may influence the interlaced structure and function of coupled networks are not…
Recently the problem of classes of vulnerable vertices (represented by colors) in complex networks has been discussed, where all vertices with the same vulnerability are prone to fail together. Utilizing redundant paths each avoiding one…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…
Recent advances have shown that introducing dependency interactions between two superconducting networks can trigger abrupt, hysteretic normal-superconductor phase transitions. In this study, we demonstrate that such behavior can also arise…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
Extraction of interaction networks from multi-variate time-series is one of the topics of broad interest in complex systems. Although this method has a wide range of applications, most of the previous analyses have focused on the pairwise…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
A first-order percolation transition, called explosive percolation, was recently discovered in evolution networks with random edge selection under a certain restriction. However, the network percolation with more realistic evolution…