Fitness-based growth of directed networks with hierarchy

被引:1
作者
Rodgers, Niall [1 ,2 ]
Tino, Peter [3 ]
Johnson, Samuel [1 ]
机构
[1] Univ Birmingham, Sch Math, Birmingham, England
[2] Univ Birmingham, Ctr Doctoral Training Topol Design, Birmingham, England
[3] Univ Birmingham, Sch Comp Sci, Birmingham, England
来源
JOURNAL OF PHYSICS-COMPLEXITY | 2024年 / 5卷 / 03期
基金
英国工程与自然科学研究理事会;
关键词
directed networks; hierarchy in directed networks; generative models of directed networks; trophic analysis; EMERGENCE;
D O I
10.1088/2632-072X/ad744e
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Growing attention has been brought to the fact that many real directed networks exhibit hierarchy and directionality as measured through techniques like trophic analysis and non-normality. We propose a simple growing network model where the probability of connecting to a node is defined by a preferential attachment mechanism based on degree and the difference in fitness between nodes. In particular, we show how mechanisms such as degree-based preferential attachment and node fitness interactions can lead to the emergence of the spectrum of hierarchy and directionality observed in real networks. In this work, we study various features of this model relating to network hierarchy, as measured by trophic analysis. This includes (I) how preferential attachment can lead to network hierarchy, (II) how scale-free degree distributions and network hierarchy can coexist, (III) the correlation between node fitness and trophic level, (IV) how the fitness parameters can predict trophic incoherence and how the trophic level difference distribution compares to the fitness difference distribution, (V) the relationship between trophic level and degree imbalance and the unique role of nodes at the ends of the fitness hierarchy and (VI) how fitness interactions and degree-based preferential attachment can interplay to generate networks of varying coherence and degree distribution. We also provide an example of the intuition this work enables in the analysis of a real historical network. This work provides insight into simple mechanisms which can give rise to hierarchy in directed networks and quantifies the usefulness and limitations of using trophic analysis as an analysis tool for real networks.
引用
收藏
页数:32
相关论文
共 50 条
[21]   Higher-order structure based node importance evaluation in directed networks [J].
Li, Meng ;
Wang, Zhigang ;
Zeng, An ;
Di, Zengru .
INFORMATION PROCESSING & MANAGEMENT, 2025, 62 (01)
[22]   CLBA: A Coulomb's law based algorithm for community detection in directed networks [J].
Li, Wencong ;
Cai, Jiansheng ;
Wang, Jihui .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2024, 651
[23]   THE FRIENDSHIP PARADOX FOR WEIGHTED AND DIRECTED NETWORKS [J].
Berenhaut, Kenneth S. ;
Jiang, Hongyi .
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2019, 33 (01) :136-145
[24]   Controlling Directed Networks With Evolving Topologies [J].
Li, Guoqi ;
Ding, Jie ;
Wen, Changyun ;
Wang, Lei ;
Guo, Fanghong .
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2019, 6 (01) :176-190
[25]   Edge addition in directed consensus networks [J].
Hassan-Moghaddam, Sepideh ;
Wu, Xiaofan ;
Jovanovic, Mihailo R. .
2017 AMERICAN CONTROL CONFERENCE (ACC), 2017, :5592-5597
[26]   Strong connectivity in real directed networks [J].
Rodgers, Niall ;
Tino, Peter ;
Johnson, Samuel .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2023, 120 (12)
[27]   Link deletion in directed complex networks [J].
Kashyap, G. ;
Ambika, G. .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 514 :631-643
[28]   Identifying influential nodes on directed networks [J].
Lee, Yan-Li ;
Wen, Yi-Fei ;
Xie, Wen -Bo ;
Pan, Liming ;
Du, Yajun ;
Zhou, Tao .
INFORMATION SCIENCES, 2024, 677
[29]   Cycle and flow trusses in directed networks [J].
Takaguchi, Taro ;
Yoshida, Yuichi .
ROYAL SOCIETY OPEN SCIENCE, 2016, 3 (11)
[30]   Asymptotics in a probit model for directed networks [J].
Wang, Qian ;
Wang, Qiuping ;
Luo, Jing .
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2022, 51 (11) :3463-3479