Information dissemination in growing scale-free hypernetworks with tunable clustering

IF 2.8 3区 物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY Physica A: Statistical Mechanics and its Applications Pub Date : 2024-09-26 DOI:10.1016/j.physa.2024.130126
Pengyue Li , Faxu Li , Liang Wei , Feng Hu
{"title":"Information dissemination in growing scale-free hypernetworks with tunable clustering","authors":"Pengyue Li ,&nbsp;Faxu Li ,&nbsp;Liang Wei ,&nbsp;Feng Hu","doi":"10.1016/j.physa.2024.130126","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":20152,"journal":{"name":"Physica A: Statistical Mechanics and its Applications","volume":"654 ","pages":"Article 130126"},"PeriodicalIF":2.8000,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physica A: Statistical Mechanics and its Applications","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0378437124006356","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用可调聚类在不断增长的无标度超网络中传播信息
现实世界中的大多数网络演化机制不仅具有偏好依附机制,还表现出高聚类特性。现有的信息传播超网络模型都是基于无标度超网络的,本文在此基础上扩展了无标度超网络演化模型,增加了基于偏好依附的可调高聚类和增长机制,提出了具有可调聚类的增长型无标度超网络。因此,超网络模型扩展了传统模型,更加符合实际。构建了基于反应过程策略的超网络 SIS 信息传播模型,对不同网络结构参数下的信息传播动态过程进行了理论分析和数值模拟。结果表明,信息传播能力随增长率的增加而增加,但随聚类系数的增加而减弱。此外,我们还发现了一个重要现象:当增长率达到 0.4 并进一步提高时,信息节点密度在稳定状态下达到饱和。所提出的超网络模型更适用于真实的社会网络,可为舆情预测和信息控制提供一定的理论参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
7.20
自引率
9.10%
发文量
852
审稿时长
6.6 months
期刊介绍: Physica A: Statistical Mechanics and its Applications Recognized by the European Physical Society Physica A publishes research in the field of statistical mechanics and its applications. Statistical mechanics sets out to explain the behaviour of macroscopic systems by studying the statistical properties of their microscopic constituents. Applications of the techniques of statistical mechanics are widespread, and include: applications to physical systems such as solids, liquids and gases; applications to chemical and biological systems (colloids, interfaces, complex fluids, polymers and biopolymers, cell physics); and other interdisciplinary applications to for instance biological, economical and sociological systems.
期刊最新文献
Shape parameter of Weibull size statistics is a potential indicator of filler geometry in SiO2 reinforced polymer composites An investigation of firm size distributions involving the growth functions Correlations between two vortices in dry active matter Effects of risk information on pedestrian evacuation during fire emergencies: Virtual experiments and survey An evacuation model considering pedestrian group behavior under violent attacks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1