相关论文: Robustness of a Network of Networks
We propose an interdependent random geometric graph (RGG) model for interdependent networks. Based on this model, we study the robustness of two interdependent spatially embedded networks where interdependence exists between geographically…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. Assuming that the nodes of the wireless network are distributed as a…
We study the distribution $P(\sigma)$ of the equivalent conductance $\sigma$ for Erd\H{o}s-R\'enyi (ER) and scale-free (SF) weighted resistor networks with $N$ nodes. Each link has conductance $g\equiv e^{-ax}$, where $x$ is a random number…
Realistic network-like systems are usually composed of multiple networks with interacting relations such as school-enterprise research and development collaboration networks. Here we study the percolation properties of a special kind of…
We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as $D$. We impose that the length of interdependent links connecting nodes in the two lattices be less than or equal to a…
Real networks are vulnerable to random failures and malicious attacks. However, when a node is harmed or damaged, it may remain partially functional, which helps to maintain the overall network structure and functionality. In this paper, we…
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 describe the critical behavior of weak multiplex percolation, a generalization of percolation to multiplex or interdependent networks. A node can determine its active or inactive status simply by referencing neighboring nodes. This is…
We analyze the properties of Degree-Ordered Percolation (DOP), a model in which the nodes of a network are occupied in degree-descending order. This rule is the opposite of the much studied degree-ascending protocol, used to investigate…
A central concern of network operators is to estimate the probability of an incident that affects a significant part and thus may yield to a breakdown. We answer this question by modeling how a failure of either a node or an edge will…
The traditional node percolation map of directed networks is reanalyzed in terms of edges. In the percolated phase, edges can mainly organize into five distinct giant connected components, interfaces bridging the communication of nodes in…
The study of network robustness focuses on the way the overall functionality of a network is affected as some of its constituent parts fail. Failures can occur at random or be part of an intentional attack and, in general, networks behave…
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…
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…
We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters)…
Quantum networks have experienced rapid advancements in both theoretical and experimental domains over the last decade, making it increasingly important to understand their large-scale features from the viewpoint of statistical physics.…
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…
Distributions of the resilience of transport networks are studied numerically, in particular the large-deviation tails. Thus, not only typical quantities like average or variance but the distributions over the (almost) full support can be…
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…
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…