 Characteristics of edge-based interdependent networksYanyan Zhao, Jie Zhou, Yong Zou, Shuguang Guan and Yanli Gao Chaos, Solitons & Fractals, 2022, vol. 156, issue C Abstract: Edge-based interdependent networks (EIN) where edges in one network layer are interdependent with edges in other layers, as contrast to the classical interdependent networks (NIN) where nodes in one layer are interdependent with nodes in other layers, have been an emerging topic in the field of interdependent networks. In this paper, by proposing an EIN on a quenched network perspective, we find that EIN is generally more robust than NIN and further reveal that this property roots in the fact that in a network the excessive degree of an edge is on an average larger than the degree of a node. A theory is developed based on a quenched network framework to verify this property, where the notion of compound excessive degree (CED) of an edge is introduced. The introduction of CED allows to define several novel properties of EIN, including the interlayer correlation and malicious attack relevant to CED. Systematic investigations on these properties are provided to extend the understanding of interdependent networks from the perspective of edge-interdependency. Keywords: Edge-based interdependent networks; Interdependent networks; Percolation (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:156:y:2022:i:c:s0960077922000303 DOI: 10.1016/j.chaos.2022.111819 Access Statistics for this article Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros More articles in Chaos, Solitons & Fractals from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.