Related papers: Percolation in real interdependent networks
In the modeling, monitoring, and control of complex networks, a fundamental problem concerns the comprehensive determination of the state of the system from limited measurements. Using power grids as example networks, we show that this…
Communication networks, power grids, and transportation networks are all examples of networks whose performance depends on reliable connectivity of their underlying network components even in the presence of usual network dynamics due to…
Extended-range percolation is a robust percolation process that has relevance for quantum communication problems. In extended-range percolation nodes can be trusted or untrusted. Untrusted facilitator nodes are untrusted nodes that can…
We study a system composed from two interdependent networks A and B, where a fraction of the nodes in network A depends on the nodes of network B and a fraction of the nodes in network B depends on the nodes of network A. Due to the…
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid…
Infrastructure systems, such as power, transportation, telecommunication, and water systems, are composed of multiple components which are interconnected and interdependent to produce and distribute essential goods and services. So, the…
Recent studies introduced biased (degree-dependent) edge percolation as a model for failures in real-life systems. In this work, such process is applied to networks consisting of two types of nodes with edges running only between nodes of…
Percolation theory is extensively studied in statistical physics and mathematics with applications in diverse fields. However, the research is focused on systems with only one type of links, connectivity links. We review a recently…
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…
We propose a method for characterizing large complex networks by introducing a new matrix structure, unique for a given network, which encodes structural information; provides useful visualization, even for very large networks; and allows…
We consider different methods, that do not rely on numerical simulations of the percolation process, to approximate percolation thresholds in networks. We perform a systematic analysis on synthetic graphs and a collection of 109 real…
Detecting and characterizing community structure plays a crucial role in the study of networked systems. However, there is still a lack of understanding of how community structure affects the systems' resilience and stability. Here, we…
Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…
Every realistic instance of a percolation problem is faced with some degree of polydispersity, e.g., the pore-size distribution of an inhomogeneous medium, the size distribution of filler particles in composite materials, or the vertex…
Analytical approaches to model the structure of complex networks can be distinguished into two groups according to whether they consider an intensive (e.g., fixed degree sequence and random otherwise) or an extensive (e.g., adjacency…
Complex systems are characterized by many interacting units that give rise to emergent behavior. A particularly advantageous way to study these systems is through the analysis of the networks that encode the interactions among the system's…
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…
In multiplex networks with a large number of layers, the nodes can have different activities, indicating the total number of layers in which the nodes are present. Here we model multiplex networks with heterogeneous activity of the nodes…
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…