Modeling the co-diffusion of competing memes in online social networks

Online social networks have greatly facilitated the spread of information of all sorts. Meanwhile, the abundance of information in today's world also means different pieces of information will increasingly compete for people's finite attention. When different pieces of information spread together in an online social network, why would some become trendy while others fail to emerge? Existing research either models the diffusion of each piece of information independently, or fails to consider users' inactivity in online social networks. Modeling each piece of information as a meme, this paper addresses this gap by proposing a unified model for the co-diffusion of competing memes simultaneously spreading across an online social network. We are the first to identify a ubiquitous threshold for competing meme. The threshold also functions as an effective predictor that contributes to better performance in determining the outcome of meme competitions. Outcomes from this study have important implications for online campaigns and mobilizations as well as the fight against misinformation. • Unified model for competing memes' spread in online networks. • First to identify a universal meme competition threshold. • Threshold predicts meme competition outcomes effectively.

Authors

Institutions

Publication Details

Journal
Decision Support Systems
Published
2024-09-04
DOI
https://doi.org/10.1016/j.dss.2024.114324
Citations
2
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.56

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modeling the co-diffusion of competing memes in online social networks

Peijie Zhang, Kang Zhao, Daniel Dajun Zeng, J. L. Luo et al.
2 citations
Decision Support Systems
Complex Network Analysis Techniques
0.56
article

Modeling the co-diffusion of competing memes in online social networks

Peijie Zhang, Kang Zhao, Daniel Dajun Zeng, J. L. Luo, Saike He, Weiguang Zhang
article en
2 citations

Abstract

Online social networks have greatly facilitated the spread of information of all sorts. Meanwhile, the abundance of information in today's world also means different pieces of information will increasingly compete for people's finite attention. When different pieces of information spread together in an online social network, why would some become trendy while others fail to emerge? Existing research either models the diffusion of each piece of information independently, or fails to consider users' inactivity in online social networks. Modeling each piece of information as a meme, this paper addresses this gap by proposing a unified model for the co-diffusion of competing memes simultaneously spreading across an online social network. We are the first to identify a ubiquitous threshold for competing meme. The threshold also functions as an effective predictor that contributes to better performance in determining the outcome of meme competitions. Outcomes from this study have important implications for online campaigns and mobilizations as well as the fight against misinformation. • Unified model for competing memes' spread in online networks. • First to identify a universal meme competition threshold. • Threshold predicts meme competition outcomes effectively.

Decision Support SystemsVol. 187
University of Iowa (US), Chinese Academy of Sciences (CN), Institute of Automation (CN), University of Chinese Academy of Sciences (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 35%
Complex Network Analysis Techniques
0.56
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.