Degree Distribution of Evolving Network with Node Preference Deletion

被引:0
|
作者
Xiao, Yue [1 ]
Zhang, Xiaojun [1 ]
机构
[1] Univ Elect Sci & Technol China, Sch Math Sci, Chengdu 611731, Peoples R China
基金
中国国家自然科学基金;
关键词
evolving network; node preference deletion; degree distribution; stochastic process; GROWING NETWORKS; MODEL; EFFICIENCY;
D O I
10.3390/math12233808
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Discussing evolutionary network models and corresponding degree distributions under different mechanisms is applied basic research in network science. This study proposes a new evolutionary network model, which integrates node preference deletion and edge reconnection mechanisms and is also an extension of the existing evolutionary network model. In order to analyze the key statistical property of the model, the steady-state distribution, we propose a Markov chain method based on the enhanced stochastic process rule (ESPR). The ESPR method makes the evolving network's topological structure and statistical properties consistent with those observed in the natural evolution process, ensures the theoretical results of the degree distribution of the evolving network model, and overcomes the limitations of using empirical methods for approximate analysis. Finally, we verify the accuracy of the steady-state distribution and tail feature estimation of the model through Monte Carlo simulation. This work has laid a solid theoretical foundation for the future development of evolutionary network models and the study of more complex network statistical properties.
引用
收藏
页数:14
相关论文
共 50 条
  • [31] When is an ecological network complex? Connectance drives degree distribution and emerging network properties
    Poisot, Timothee
    Gravel, Dominique
    PEERJ, 2014, 2
  • [32] Evolving networks driven by node dynamics
    Fan, ZP
    Chen, GR
    INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2004, 18 (17-19): : 2540 - 2546
  • [33] An Evolving Preference-Based Recommendation System
    Chen, Yi-Cheng
    Lee, Wang-Chien
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2024, 8 (02): : 1118 - 1124
  • [34] The effect of social proximity on degree distribution of Scale-free network
    Xiang, Xiyao
    Zhao, Jiahan
    PROCEEDINGS OF THE INTERNATIONAL ACADEMIC CONFERENCE ON FRONTIERS IN SOCIAL SCIENCES AND MANAGEMENT INNOVATION (IAFSM 2018), 2018, 62 : 243 - 248
  • [35] MARKOV CHAIN-BASED ANALYSIS OF THE DEGREE DISTRIBUTION FOR A GROWING NETWORK
    候振挺
    童金英
    史定华
    ActaMathematicaScientia, 2011, 31 (01) : 221 - 228
  • [36] The Degree Distribution of Random Attachment Networks
    Zhao, Qinggui
    ADVANCES IN ELECTRONIC COMMERCE, WEB APPLICATION AND COMMUNICATION, VOL 2, 2012, 149 : 285 - 289
  • [37] THE STUDY ON DEGREE DISTRIBUTION PROPERTY OF COMPLEX NETWORK BASED ON COOPERATIVE COMMUNICATION
    Xie Weihao Chen Huimin Yang Xiumei Xiong Yong (Key Laboratory of Special Fiber Optics and Optical Access Networks
    JournalofElectronics(China), 2010, 27 (02) : 224 - 229
  • [38] MARKOV CHAIN-BASED ANALYSIS OF THE DEGREE DISTRIBUTION FOR A GROWING NETWORK
    Hou Zhenting
    Tong Jinying
    Shi Dinghua
    ACTA MATHEMATICA SCIENTIA, 2011, 31 (01) : 221 - 228
  • [39] Degree correlations in growing networks with deletion of nodes
    Garcia-Domingo, Josep L.
    Juher, David
    Saldana, Joan
    PHYSICA D-NONLINEAR PHENOMENA, 2008, 237 (05) : 640 - 651
  • [40] An Approach to the Synchronization of Dynamic Complex Network Combining Degree Distribution and Eigenvector Criteria
    Xie, Rong
    Wang, Yuchen
    Jiang, Mengting
    COLLABORATIVE COMPUTING: NETWORKING, APPLICATIONS AND WORKSHARING, COLLABORATECOM 2022, PT I, 2022, 460 : 290 - 308