2015
DOI: 10.1103/physreve.91.012804
|View full text |Cite
|
Sign up to set email alerts
|

Mutually connected component of networks of networks with replica nodes

Abstract: We describe the emergence of the giant mutually connected component in networks of networks in which each node has a single replica node in any layer and can be interdependent only on its replica nodes in the interdependent layers. We prove that if in these networks, all the nodes of one network (layer) are interdependent on the nodes of the same other interconnected layer, then, remarkably, the mutually connected component does not depend on the topology of the network of networks. This component coincides wi… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
51
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 39 publications
(55 citation statements)
references
References 27 publications
0
51
0
Order By: Relevance
“…These methods are versatile, as they can be applied not only to ensembles of random networks, but also to single network realizations. For these reasons these algorithms are becoming increasingly popular in network science with applications ranging from percolation on single and multilayer networks to controllability [13,15,[34][35][36]43,47]. These algorithms proceed by iteration of dynamical rules, which determine messages or beliefs that a node sent to a neighboring node.…”
Section: A General Observations On the Message Passing Algorithm Formentioning
confidence: 99%
See 2 more Smart Citations
“…These methods are versatile, as they can be applied not only to ensembles of random networks, but also to single network realizations. For these reasons these algorithms are becoming increasingly popular in network science with applications ranging from percolation on single and multilayer networks to controllability [13,15,[34][35][36]43,47]. These algorithms proceed by iteration of dynamical rules, which determine messages or beliefs that a node sent to a neighboring node.…”
Section: A General Observations On the Message Passing Algorithm Formentioning
confidence: 99%
“…Networks of networks are multilayer networks formed by different networks (layers), where the nodes of different networks might be related by interdependencies. The percolation transition in these networks is significantly affected by the way the links implying interdependencies are placed, and, moreover, instead of single, there may be multiple transitions [34,35].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Particularly noticeable has been the finding that when nodes of different networks are interdependent with each other, multilayer networks might be much more fragile than single networks and may have cascading failures that yield abrupt transitions [72,[75][76][77][78][79][80] . Therefore this result explains why global infrastructures are prone to dramatic avalanches of failures.…”
mentioning
confidence: 99%
“…It has been shown that considering the multilayer nature of networks can modify significantly the conclusions reached by considering single networks. A number of dynamical processes, including percolation [72,[75][76][77][78][79][80][81], diffusion [82], epidemic spreading [83] and game theory [84] present a phenomenology that is unexpected if one consider the layers in isolation. Moreover, it has been shown that multilayer networks are characterized by significant correlations [22,[85][86][87][88][89] in their structure that can change the dynamical properties of the multilayer network.…”
mentioning
confidence: 99%