Degree difference: a simple measure to characterize structural heterogeneity in complex networks

被引:0
|
作者
Amirhossein Farzam
Areejit Samal
Jürgen Jost
机构
[1] Max Planck Institute for Mathematics in the Sciences,The Institute of Mathematical Sciences (IMSc)
[2] Homi Bhabha National Institute (HBNI),undefined
[3] The Santa Fe Institute,undefined
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Despite the growing interest in characterizing the local geometry leading to the global topology of networks, our understanding of the local structure of complex networks, especially real-world networks, is still incomplete. Here, we analyze a simple, elegant yet underexplored measure, ‘degree difference’ (DD) between vertices of an edge, to understand the local network geometry. We describe the connection between DD and global assortativity of the network from both formal and conceptual perspective, and show that DD can reveal structural properties that are not obtained from other such measures in network science. Typically, edges with different DD play different structural roles and the DD distribution is an important network signature. Notably, DD is the basic unit of assortativity. We provide an explanation as to why DD can characterize structural heterogeneity in mixing patterns unlike global assortativity and local node assortativity. By analyzing synthetic and real networks, we show that DD distribution can be used to distinguish between different types of networks including those networks that cannot be easily distinguished using degree sequence and global assortativity. Moreover, we show DD to be an indicator for topological robustness of scale-free networks. Overall, DD is a local measure that is simple to define, easy to evaluate, and that reveals structural properties of networks not readily seen from other measures.
引用
收藏
相关论文
共 50 条
  • [31] Structural and indicator representations: a difference in degree, not kind
    Gregory Nirshberg
    Lawrence Shapiro
    Synthese, 2021, 198 : 7647 - 7664
  • [32] A New Measure to Characterize the Degree of Self-Similarity of a Shape and Its Applicability
    Lee, Sang-Hee
    Park, Cheol-Min
    Choi, UJin
    ENTROPY, 2020, 22 (09)
  • [33] A difference degree test for comparing brain networks
    Higgins, Ixavier A.
    Kundu, Suprateek
    Choi, Ki Sueng
    Mayberg, Helen S.
    Guo, Ying
    HUMAN BRAIN MAPPING, 2019, 40 (15) : 4518 - 4536
  • [34] The difference between simple and complex leaves
    Kellogg, Elizabeth A.
    NATURE GENETICS, 2006, 38 (08) : 865 - 866
  • [35] The difference between simple and complex leaves
    Elizabeth A Kellogg
    Nature Genetics, 2006, 38 : 865 - 866
  • [36] Degree heterogeneity in spatial networks with total cost constraint
    Liu, Weiping
    Zeng, An
    Zhou, Yanbo
    EPL, 2012, 98 (02)
  • [37] Degree heterogeneity of graphs and networks. I. Interpretation and the "heterogeneity paradox"
    Estrada, Ernesto
    JOURNAL OF INTERDISCIPLINARY MATHEMATICS, 2019, 22 (04) : 503 - 530
  • [38] Impact of Degree Heterogeneity on Attack Vulnerability of Interdependent Networks
    Sun, Shiwen
    Wu, Yafang
    Ma, Yilin
    Wang, Li
    Gao, Zhongke
    Xia, Chengyi
    SCIENTIFIC REPORTS, 2016, 6
  • [39] Impact of degree heterogeneity on the behavior of trapping in Koch networks
    Zhang, Zhongzhi
    Gao, Shuyang
    Xie, Wenlei
    CHAOS, 2010, 20 (04)
  • [40] Impact of Degree Heterogeneity on Attack Vulnerability of Interdependent Networks
    Shiwen Sun
    Yafang Wu
    Yilin Ma
    Li Wang
    Zhongke Gao
    Chengyi Xia
    Scientific Reports, 6