Information dissemination in scale-free hypernetwork with variable local-world

Abstract With the continuous progress of Internet technology and the popularization of social platforms, the speed and scope of information dissemination have become more rapid and extensive. We proposed a variable local-world scale-free hypernetwork model, so that the establishment of new connections can be more in line with the evolution mechanism of the real social network. Theory and simulation prove that hyperdegree distribution is not affected by the neighbor order, and the theory agrees with the simulation. Combining the SIS model based on the reaction process (RP) strategy and the mean-field theory, we derive a theoretical expression for the density of informed nodes in steady state. The effects of hypernetwork structure parameters and dissemination parameters on information dissemination under two strategies are comparatively analyzed through simulation experiments. Most noteworthy, as neighbor order $n$ increases, it decreases the information dissemination rate under RP strategy and increases the information dissemination rate under contact process strategy, but both steady-state values remain the same. The results of the study provide a new perspective for a deeper understanding of the establishment of new relationships and information dissemination in social networks, as well as a theoretical basis for other practical applications that require local-world preference of connections.

Authors

Institutions

Publication Details

Journal
The Computer Journal
Published
2025-10-22
DOI
https://doi.org/10.1093/comjnl/bxaf131
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Information dissemination in scale-free hypernetwork with variable local-world

Faxu Li, Zhenfu Chen, Liang Wei, Jia-He Lv
The Computer Journal
Complex Network Analysis Techniques
article

Information dissemination in scale-free hypernetwork with variable local-world

Faxu Li, Zhenfu Chen, Liang Wei, Jia-He Lv
article en

Abstract

Abstract With the continuous progress of Internet technology and the popularization of social platforms, the speed and scope of information dissemination have become more rapid and extensive. We proposed a variable local-world scale-free hypernetwork model, so that the establishment of new connections can be more in line with the evolution mechanism of the real social network. Theory and simulation prove that hyperdegree distribution is not affected by the neighbor order, and the theory agrees with the simulation. Combining the SIS model based on the reaction process (RP) strategy and the mean-field theory, we derive a theoretical expression for the density of informed nodes in steady state. The effects of hypernetwork structure parameters and dissemination parameters on information dissemination under two strategies are comparatively analyzed through simulation experiments. Most noteworthy, as neighbor order $n$ increases, it decreases the information dissemination rate under RP strategy and increases the information dissemination rate under contact process strategy, but both steady-state values remain the same. The results of the study provide a new perspective for a deeper understanding of the establishment of new relationships and information dissemination in social networks, as well as a theoretical basis for other practical applications that require local-world preference of connections.

The Computer JournalVol. 69(3)
Qinghai Normal University (CN)
Openalex Percentile: Top 74%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.