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 条
  • [21] GASTRIN HETEROGENEITY - SIMPLE OR COMPLEX
    TRACK, NS
    REHFELD, JF
    BRITISH MEDICAL JOURNAL, 1975, 2 (5963): : 142 - 142
  • [22] Degree heterogeneity and stability of ecological networks
    Yan, Gang
    Martinez, Neo D.
    Liu, Yang-Yu
    JOURNAL OF THE ROYAL SOCIETY INTERFACE, 2017, 14 (131)
  • [23] Nodal Dynamics, Not Degree Distributions, Determine the Structural Controllability of Complex Networks
    Cowan, Noah J.
    Chastain, Erick J.
    Vilhena, Daril A.
    Freudenberg, James S.
    Bergstrom, Carl T.
    PLOS ONE, 2012, 7 (06):
  • [24] Prosocial norms and degree heterogeneity in social networks
    Kovarik, Jaromir
    Branas-Garza, Pablo
    Cobo-Reyes, Ramon
    Paz Espinosa, Maria
    Jimenez, Natalia
    Ponti, Giovanni
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (03) : 849 - 853
  • [25] Complex Networks with External Degree
    Li Chunfang
    Liu Lianzhong
    CHINESE JOURNAL OF ELECTRONICS, 2014, 23 (03) : 442 - 447
  • [26] Complex Networks with External Degree
    LI Chunfang
    LIU Lianzhong
    Chinese Journal of Electronics, 2014, 23 (03) : 442 - 447
  • [27] A simple and effective approach to quantitatively characterize structural complexity
    Gongqiao Zhang
    Gangying Hui
    Aiming Yang
    Zhonghua Zhao
    Scientific Reports, 11
  • [28] A simple and effective approach to quantitatively characterize structural complexity
    Zhang, Gongqiao
    Hui, Gangying
    Yang, Aiming
    Zhao, Zhonghua
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [29] Hierarchy Measure for Complex Networks
    Mones, Enys
    Vicsek, Lilla
    Vicsek, Tamas
    PLOS ONE, 2012, 7 (03):
  • [30] Structural and indicator representations: a difference in degree, not kind
    Nirshberg, Gregory
    Shapiro, Lawrence
    SYNTHESE, 2021, 198 (08) : 7647 - 7664