Rumor propagation on hypergraphs

超图上的谣言传播

阅读:2

Abstract

The rapid spread of information and rumors through social media platforms, especially in group settings, motivates the need for more sophisticated models of rumor propagation. Traditional pairwise models do not account for group interactions, a limitation that we address by proposing a higher-order rumor model based on hypergraphs. Our model incorporates a group-based annihilation mechanism, where a spreader becomes a stifler when the fraction of hyperedges aware of the rumor exceeds a threshold. The dynamics has two distinct subcritical behaviors: exponential and power-law decay, which can coexist depending on the heterogeneity of the hypergraph. Interestingly, in the set of parameters we analysed, we found continuous phase transitions in both homogeneous and heterogeneous hypergraphs. This finding aligns with the literature suggesting that real-world rumor propagation occurs near criticality. Finally, we validated our model using empirical data from Telegram and email cascades, which provides additional evidence and possible explanations for this criticality claim. These results open the door to a more detailed understanding of rumor dynamics in higher-order systems.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。