Related papers: Percolation in real interdependent networks
The critical infrastructures of the nation such as the power grid and the communication network are highly interdependent. Also, it has been observed that there exists complex interdependent relationships between individual entities of the…
The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semi-annealed approximation to study the stability properties of Random Boolean Networks…
Transition out of a topological phase is typically characterized by discontinuous changes in topological invariants along with bulk gap closings. However, as a clean system is geometrically punctured, it is natural to ask the fate of an…
Decompositions of networks are useful not only for structural exploration. They also have implications and use in analysis and computational solution of processes (such as the Ising model, percolation, SIR model) running on a given network.…
In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, communication channels can be established between them via quantum…
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…
Connectivity - or the lack thereof - is crucial for the function of many man-made systems, from financial and economic networks over epidemic spreading in social networks to technical infrastructure. Often, connections are deliberately…
The interactions among the elementary components of many complex systems can be qualitatively different. Such systems are therefore naturally described in terms of multiplex or multi-layer networks, i.e. networks where each layer stands for…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
Multilayer networks have been found to be prone to abrupt cascading failures under random and targeted attacks, but most of the targeting algorithms proposed so far have been mainly tested on uncorrelated systems. Here we show that the size…
This study introduces a pore morphology algorithm that emphasizes the central role of topology in multiphase flow through porous media. Analysis of drainage in lattice-based pore networks identifies two key quantities, the percolation…
The intrinsically secure communications graph (iS-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence of eavesdroppers. It is based on principles of…
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…
The distribution of entanglement between the nodes of a quantum network plays a fundamental role in quantum information applications. In this work, we investigate the dynamics of a network of qubits where each edge corresponds to an…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the…
Modular networks, such as critical infrastructures, are often built from distinct, densely connected modules (e.g., cities) that are sparsely interconnected. When such networks are gradually and randomly disrupted under a percolation…