Key Node Identification in Dynamic Heterogeneous Hypergraphs for Sudden-Onset Disaster Public Opinion

In sudden disaster events, the dissemination of social media information has distinct stages. Identifying the key dissemination nodes at each stage is of great significance for tracing the source of the information and implementing emergency interventions. This paper divides the event evolution process into 72-hour time windows and constructs three types of nodes (users, content, and topics) and two types of hyperedges (content resonance circles and topic participation circles) in a dynamic heterogeneous hypergraph. It proposes a three-component influence score IS composed of content participation degree, topic participation intensity, and structural hole bridging degree. The weights of each component are adaptively determined based on the correlation between each component and the communication ability. Taking the Weibo data of 2023 Zhuozhou Rainstorm as an example, the propagation simulation verification is carried out using the independent cascading model. The results show that IS is superior to degree centrality, k-core, HITS and other structural baselines in all 7 snapshots, leading by 12.8 points relative to the strongest baseline and statistically significant; its identification gain is concentrated in medium and low-level users, indicating that this method can discover efficient disseminators that are easily overlooked by the structural baselines.

Authors

Institutions

Publication Details

Journal
Computers and artificial intelligence.
Published
2026-11-05
DOI
https://doi.org/10.70267/cai.v3n5.171177
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

Key Node Identification in Dynamic Heterogeneous Hypergraphs for Sudden-Onset Disaster Public Opinion

Shiying Liu
Computers and artificial intelligence.
Complex Network Analysis Techniques
article

Key Node Identification in Dynamic Heterogeneous Hypergraphs for Sudden-Onset Disaster Public Opinion

Shiying Liu
article en

Abstract

In sudden disaster events, the dissemination of social media information has distinct stages. Identifying the key dissemination nodes at each stage is of great significance for tracing the source of the information and implementing emergency interventions. This paper divides the event evolution process into 72-hour time windows and constructs three types of nodes (users, content, and topics) and two types of hyperedges (content resonance circles and topic participation circles) in a dynamic heterogeneous hypergraph. It proposes a three-component influence score IS composed of content participation degree, topic participation intensity, and structural hole bridging degree. The weights of each component are adaptively determined based on the correlation between each component and the communication ability. Taking the Weibo data of 2023 Zhuozhou Rainstorm as an example, the propagation simulation verification is carried out using the independent cascading model. The results show that IS is superior to degree centrality, k-core, HITS and other structural baselines in all 7 snapshots, leading by 12.8 points relative to the strongest baseline and statistically significant; its identification gain is concentrated in medium and low-level users, indicating that this method can discover efficient disseminators that are easily overlooked by the structural baselines.

Computers and artificial intelligence.Vol. 3(5)
Nanjing University of Science and Technology (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