Information dissemination in growing scale-free hypernetworks with tunable clustering

被引:0
|
作者
Li, Pengyue [1 ,3 ]
Li, Faxu [1 ,3 ]
Wei, Liang [2 ,3 ]
Hu, Feng [1 ,3 ]
机构
[1] Qinghai Normal Univ, Sch Comp, Xining 810008, Peoples R China
[2] Qinghai Normal Univ, Sch Math & Stat, Xining 810008, Peoples R China
[3] State Key Lab Tibetan Intelligent Informat Proc &, Xining 810008, Peoples R China
关键词
Hypernetwork; Information dissemination; Social networks; Tunable clustering; Variable growth of hyperedge; EPIDEMIC; NETWORKS; SPREAD; MODELS;
D O I
10.1016/j.physa.2024.130126
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Most real-world network evolution mechanisms not only have a preference attachment mechanism, but also exhibit high clustering characteristics. The existing information dissemination hypernetwork models are based on scale-free hypernetworks, and in this paper, we extend the scale-free hypernetwork evolution model by adding an adjustable high clustering and growth mechanism based on preference attachment, and propose a growing scale-free hypernetwork with tunable clustering. Thus hypernetwork models extend the traditional models and are more realistic. An information propagation model of SIS in hypernetworks based on reaction process strategy is constructed, and the dynamic process of information propagation under different network structure parameters is theoretically analyzed and numerically simulated. The results show that the propagation capacity of information increase with the growth rate, but suppressed with the increase of clustering coefficient. Additionally, we have discovered an important phenomenon: when the growth rate reaches 0.4 and increases further, the density of information nodes reaches saturation in the steady state. The proposed hypernetwork model is more suitable for real social networks and can provide some theoretical references for public opinion prediction and information control.
引用
收藏
页数:13
相关论文
共 50 条
  • [31] Modifying the scale-free clustering method
    Paivinen, N. S.
    Gronfors, T. K.
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE FOR MODELLING, CONTROL & AUTOMATION JOINTLY WITH INTERNATIONAL CONFERENCE ON INTELLIGENT AGENTS, WEB TECHNOLOGIES & INTERNET COMMERCE, VOL 2, PROCEEDINGS, 2006, : 477 - +
  • [32] Clustering spectrum of scale-free networks
    Stegehuis, Clara
    van der Hofstad, Remco
    Janssen, A. J. E. M.
    van Leeuwaarden, Johan S. H.
    PHYSICAL REVIEW E, 2017, 96 (04)
  • [33] Clustering of random scale-free networks
    Colomer-de-Simon, Pol
    Boguna, Marian
    PHYSICAL REVIEW E, 2012, 86 (02)
  • [35] Growing highly synchronizable scale-free networks
    Jalili, Mahdi
    EPL, 2013, 101 (06)
  • [36] Modeling and Simulation on Information Propagation on Instant Messaging Network Based on Two-layer Scale-free Networks with Tunable Clustering
    Wu, Yu
    Yang, Yanrong
    Wu, Huanzheng
    Wang, Gongxiao
    2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, : 5184 - +
  • [37] A Hypergraph Model for Clustering Scale-free Network
    Yu, Zheng
    Rong, Qian
    PROCEEDINGS OF THE 27TH CHINESE CONTROL CONFERENCE, VOL 2, 2008, : 561 - 565
  • [38] The clustering coefficient of a scale-free random graph
    Eggemann, N.
    Noble, S. D.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (10) : 953 - 965
  • [39] Improved On Demand Clustering on Scale-Free Topologies
    Benko, Borbala K.
    Legeny, Marton
    INFOCOMMUNICATIONS JOURNAL, 2011, 3 (02): : 9 - 19
  • [40] Global Clustering Coefficient in Scale-Free Networks
    Prokhorenkova, Liudmila Ostroumova
    Samosvat, Egor
    ALGORITHMS AND MODELS FOR THE WEB GRAPH (WAW 2014), 2014, 8882 : 47 - 58