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 条
  • [41] Assortativeness and information in scale-free networks
    M. Piraveenan
    M. Prokopenko
    A. Y. Zomaya
    The European Physical Journal B, 2009, 67 : 291 - 300
  • [42] Assortativeness and information in scale-free networks
    Piraveenan, M.
    Prokopenko, M.
    Zomaya, A. Y.
    EUROPEAN PHYSICAL JOURNAL B, 2009, 67 (03): : 291 - 300
  • [43] Models Having Tunable Parameters in Scale-free Networks
    Ma, Fei
    Su, Jing
    Yao, Bing
    Yao, Ming
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND INFORMATION SYSTEMS, 2016, 52 : 449 - 452
  • [44] Oscillatory epidemic prevalence in growing scale-free networks
    Hayashi, Y
    Minoura, M
    Matsukubo, J
    PHYSICAL REVIEW E, 2004, 69 (01): : 8
  • [45] Growing optimal scale-free networks via likelihood
    Small, Michael
    Li, Yingying
    Stemler, Thomas
    Judd, Kevin
    PHYSICAL REVIEW E, 2015, 91 (04)
  • [46] Hierarchy in the growing scale-free network with local rules
    Nather, Peter
    Markosova, Maria
    Rudolf, Boris
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2009, 388 (24) : 5036 - 5044
  • [47] A novel evolving scale-free model with tunable attractiveness
    Liu Xuan
    Liu Tian-Qi
    Wang Hao
    Li Xing-Yuan
    CHINESE PHYSICS B, 2010, 19 (07)
  • [48] Behavior of growing scale-free networks in complex systems
    Kawachi, Yuumi
    Yoshii, Shinichiro
    NEW FRONTIERS IN ARTIFICIAL INTELLIGENCE, 2006, 4012 : 271 - 279
  • [49] A novel evolving scale-free model with tunable attractiveness
    刘绚
    刘天琪
    王昊
    李兴源
    Chinese Physics B, 2010, 19 (07) : 39 - 43
  • [50] Gaining scale-free and high clustering complex networks
    Bu, Shouliang
    Wang, Bing-Hong
    Zhou, Tao
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2007, 374 (02) : 864 - 868