Characteristics of edge-based interdependent networks

被引:9
|
作者
Zhao, Yanyan [1 ]
Zhou, Jie [1 ]
Zou, Yong [1 ]
Guan, Shuguang [1 ]
Gao, Yanli [2 ]
机构
[1] East China Normal Univ, Sch Phys & Elect Sci, Shanghai 200062, Peoples R China
[2] East China Jiaotong Univ, Sch Elect & Automation Engn, Nanchang, Peoples R China
基金
中国国家自然科学基金;
关键词
Edge-based interdependent networks; Interdependent networks; Percolation; PERCOLATION;
D O I
10.1016/j.chaos.2022.111819
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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. (c) 2022 Elsevier Ltd. All rights reserved.
引用
收藏
页数:7
相关论文
共 50 条
  • [1] Edge-based Traceback in Sensor Networks
    Xu, Jun
    Zhou, Xuehai
    Yang, Feng
    2010 6TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS NETWORKING AND MOBILE COMPUTING (WICOM), 2010,
  • [2] Multistrain edge-based compartmental model on networks
    Lv, JianPing
    Jin, Zhen
    MATHEMATICAL METHODS IN THE APPLIED SCIENCES, 2019, 42 (05) : 1529 - 1552
  • [3] Edge-based traffic engineering for OSPF networks
    Wang, J
    Yang, YL
    Xiao, L
    Nahrstedt, K
    COMPUTER NETWORKS, 2005, 48 (04) : 605 - 625
  • [4] Edge-based analysis of networks: curvatures of graphs and hypergraphs
    Eidi, Marzieh
    Farzam, Amirhossein
    Leal, Wilmer
    Samal, Areejit
    Jost, Juergen
    THEORY IN BIOSCIENCES, 2020, 139 (04) : 337 - 348
  • [5] Double edge-based traceback for wireless sensor networks
    Zhang, Zhiming
    Li, Ping
    Wu, Fuying
    Deng, Jiangang
    INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND DISTRIBUTED SYSTEMS, 2015, 15 (01) : 107 - 126
  • [6] Edge-Based Shortest Path Caching in Road Networks
    Zhang, Detian
    Liu, An
    Jin, Gaoming
    Li, Qing
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2019, 11448 : 411 - 414
  • [7] Edge-based analysis of networks: curvatures of graphs and hypergraphs
    Marzieh Eidi
    Amirhossein Farzam
    Wilmer Leal
    Areejit Samal
    Jürgen Jost
    Theory in Biosciences, 2020, 139 : 337 - 348
  • [8] Edge-based sequential graph generation with recurrent neural networks
    Bacciu, Davide
    Micheli, Alessio
    Podda, Marco
    NEUROCOMPUTING, 2020, 416 : 177 - 189
  • [9] BeamStar: An edge-based approach to routing in wireless sensor networks
    Mao, Shiwen
    Hou, Y. Thomas
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (11) : 1284 - 1296
  • [10] Presto: Edge-based Load Balancing for Fast Datacenter Networks
    He, Keqiang
    Rozner, Eric
    Agarwal, Kanak
    Felter, Wes
    Carter, John
    Akella, Aditya
    Computer Communication Review, 2015, 45 (04): : 465 - 478