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 条
  • [21] Complex scale-free networks with tunable power-law exponent and clustering
    Colman, E. R.
    Rodgers, G. J.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (21) : 5501 - 5510
  • [22] A Biased Random Walk Scale-Free Network Growth Model with Tunable Clustering
    Vashishtha, Rajesh
    Singh, Anurag
    Cherifi, Hocine
    COMPLEX NETWORKS AND THEIR APPLICATIONS XI, COMPLEX NETWORKS 2022, VOL 2, 2023, 1078 : 123 - 134
  • [23] An information dissemination model of product quality and safety based on scale-free networks
    Wang, Li
    Lei, Chao
    Xu, Yingcheng
    Yang, Yuexiang
    Shan, Siqing
    Xu, Xiaobo
    INFORMATION TECHNOLOGY & MANAGEMENT, 2014, 15 (03): : 211 - 221
  • [24] Robustness of scale-free networks under attack with tunable grey information
    Shang, Yilun
    EPL, 2011, 95 (02)
  • [25] An information dissemination model of product quality and safety based on scale-free networks
    Li Wang
    Chao Lei
    Yingcheng Xu
    Yuexiang Yang
    Siqing Shan
    Xiaobo Xu
    Information Technology and Management, 2014, 15 : 211 - 221
  • [26] PageRank of Scale-Free Growing Networks
    Avrachenkov, Konstantin
    Lebedev, Dmitri
    INTERNET MATHEMATICS, 2006, 3 (02) : 207 - 231
  • [27] Scale-free growing networks and gravity
    Nieto, J. A.
    REVISTA MEXICANA DE FISICA, 2013, 59 (03) : 201 - 204
  • [28] Scale-free multicomponent growing networks
    Ke, JH
    PHYSICAL REVIEW E, 2004, 69 (03): : 037101 - 1
  • [29] Efficient Dissemination Algorithm for Scale-Free Topologies
    Hu, Ruijing
    Sopena, Julien
    Arantes, Luciana
    Sens, Pierre
    Demeure, Isabelle
    2013 42ND ANNUAL INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP), 2013, : 310 - 319
  • [30] Dissemination strategy for immunizing scale-free networks
    Stauffer, Alexandre O.
    Barbosa, Valmir C.
    PHYSICAL REVIEW E, 2006, 74 (05)