Dynamical analysis and optimal control of a Hyper-SICR rumor spreading model on hypergraphs

Rumor spreading on online social platforms often exhibits group-interaction characteristics involving multiple users. To investigate rumor spreading under higher-order interaction structures, this paper constructs a Hyper-SICR rumor-spreading model based on hypergraph theory and introduces the single-contact transmission probability and saturated incidence rate. First, the basic reproduction number \(R_0\) of the model is derived, and the existence and stability of the rumor-free equilibrium and rumor-prevailing equilibrium are analyzed. Numerical results provide support for the theoretical analysis. Comparison with the degenerated SICR model shows that, under the same parameter conditions, the higher-order structure leads to a lower \(R_0\) . After further matching the same \(R_0\) , effective growth rate, and decay rate, dynamical differences between the two models still remain, further reflecting the influence of the higher-order structure on the system dynamics. Finally, an optimal control model is constructed. Numerical results show that the optimal control can adjust the control intensity according to different hyperdegrees, and larger hyperdegrees require stronger early-stage control. Under the same total cumulative cost, the optimal control achieves a better suppression effect than uniform control.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-11-05
DOI
https://doi.org/10.1038/s41598-026-77119-y
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
NOV
article

Dynamical analysis and optimal control of a Hyper-SICR rumor spreading model on hypergraphs

Jiayin Wei, Hongyong Deng, Wang Zhong, Juan Luo et al.
Scientific Reports
Complex Network Analysis Techniques
article

Dynamical analysis and optimal control of a Hyper-SICR rumor spreading model on hypergraphs

Jiayin Wei, Hongyong Deng, Wang Zhong, Juan Luo, Jianghao Yu, Meiling Ren, Lingjing Tang, Youjun Lu
article en

Abstract

Rumor spreading on online social platforms often exhibits group-interaction characteristics involving multiple users. To investigate rumor spreading under higher-order interaction structures, this paper constructs a Hyper-SICR rumor-spreading model based on hypergraph theory and introduces the single-contact transmission probability and saturated incidence rate. First, the basic reproduction number \(R_0\) of the model is derived, and the existence and stability of the rumor-free equilibrium and rumor-prevailing equilibrium are analyzed. Numerical results provide support for the theoretical analysis. Comparison with the degenerated SICR model shows that, under the same parameter conditions, the higher-order structure leads to a lower \(R_0\) . After further matching the same \(R_0\) , effective growth rate, and decay rate, dynamical differences between the two models still remain, further reflecting the influence of the higher-order structure on the system dynamics. Finally, an optimal control model is constructed. Numerical results show that the optimal control can adjust the control intensity according to different hyperdegrees, and larger hyperdegrees require stronger early-stage control. Under the same total cumulative cost, the optimal control achieves a better suppression effect than uniform control.

Scientific Reports
Guizhou Minzu University (CN)
Openalex Percentile: Top 17%
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.

Laika access coming soon