Interconnecting bilayer networks
@article{Xu2011InterconnectingBN, title={Interconnecting bilayer networks}, author={Xiu-Lian Xu and Yan-Qin Qu and Shan Guan and Yu-Mei Jiang and Da-Ren He}, journal={ArXiv}, year={2011}, volume={abs/1101.0407} }
A typical complex system should be described by a supernetwork or a network of networks, in which the networks are coupled to some other networks. As the first step to understanding the complex systems on such more systematic level, scientists studied interdependent multilayer networks. In this letter, we introduce a kind of interdependent multilayer networks, i.e., interconnecting networks, for which the component networks are coupled each other by sharing some common nodes. Based on the…
18 Citations
Reorganizations of complex networks: Compounding and reducing
- Computer Science
- 2014
A generalized framework of multi-subnet composited complex network that allowed us to investigate interrelations among several subnets is developed and reorganizations of networks: compounding (compound subnets into a "bigger" one) and reducing and reducing are proposed.
Multilayer networks
- Computer ScienceJ. Complex Networks
- 2014
This chapter shows how interconnected multilayer topology describes such networks more accurately than edge coloring does and introduces the tensor formalism used to construct them.
Robustness of a network formed of spatially embedded networks.
- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2014
The theory proposed here requires only numerical knowledge about the percolation behavior of a single network and therefore can be used to find the robustness of any network of networks where the profile of percolations of a singe network is known numerically.
Correlated multiplexity and connectivity of multiplex random networks
- Computer Science
- 2012
It is demonstrated that the correlated multiplexity can drastically affect the properties of a giant component in the network when the degrees of a node for different interactions in a duplex Erdős–Renyi network are maximally correlated.
A Collaboration Network Model with Multiple Evolving Factors
- Computer Science
- 2016
This work proposes a collaboration network model in which the network growth is simultaneously controlled by three factors, including partial preferential attachment, partial random attachment and network growth speed, and obtains an analytical formula for the act degree distribution.
Algorithm to determine the percolation largest component in interconnected networks.
- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2013
This work proposes an efficient algorithm that scales as O(NlogN), where N is the number of nodes in the network, a significant improvement compared to O( N(2) for a greedy algorithm, which permits studying much larger networks.
Cascading Failures in Interdependent Lattice Networks: The Critical Role of the Length of Dependency Links
- Computer SciencePhysical review letters
- 2012
The study of cascading failures in a system composed of two interdependent square lattice networks A and B suggests that interdependent infrastructures embedded in Euclidean space become most vulnerable when the distance between interdependent nodes is in the intermediate range, which is much smaller than the size of the system.
Synchronizability of two-layer correlation networks.
- Computer ScienceChaos
- 2021
The findings based on the representative two-layer correlation networks provide the basis for maximizing the synchronizability of general multiplex correlation networks.
Modelling the air transport with complex networks: A short review
- Computer Science
- 2013
This paper discusses possible networks that can be defined for the air transport and focuses on networks of airports connected by flights, reviewing several papers investigating the topology of these networks and their dynamics for time scales ranging from years to intraday intervals.
Interdependent Multi-Layer Networks: Modeling and Survivability Analysis with Applications to Space-Based Networks
- Computer SciencePloS one
- 2013
A novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes are developed and illustrated with space applications, and the incremental survivability gains of the SBN over the traditional monolith spacecraft are quantified.
References
SHOWING 1-10 OF 14 REFERENCES
Empirical study on some interconnecting bilayer networks
- Computer ScienceArXiv
- 2010
A model showing an important general property of the bilayer networks is proposed and the analytic discussion of the model is compared with empirical conclusions, and all the empirical observations are presented.
Robustness of a Network of Networks
- MathematicsPhysical review letters
- 2011
A general analytical framework for studying percolation of n interdependent networks is developed and it is shown that for any tree of n fully dependent Erdős-Rényi networks, each of average degree k, the giant component is P∞ = p[1-exp(-kP∞)](n) where 1-p is the initial fraction of removed nodes.
Some collaboration-competition bipartite networks
- Computer Science
- 2009
The definition of the networks and their node weights, the node weight distributions, as well as the evolution durations of 15 real world collaboration-competition systems which are belonging to diverse fields are presented.
Supernetworks: Decision-Making for the Information Age
- Computer Science
- 2002
The authors provide a unifying framework for the study of decision-making by a variety of economic agents including consumers and producers as well as distinct intermediaries in the context of today's networked economy.
Nature
- MedicineOtolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery
- 2009
Phys. Rev. Lett
- Phys. Rev. Lett
- 2010
Physica A
- Physica A
- 2005
Phys. Rev. E
- Phys. Rev. E
- 2007
D.-R., arXiv:0910.2516v2 [physics.soc-ph
- Phys. Lett.,
- 2010
Physica A
- Physica A
- 2007