Will the Winner Take All? Competing Influences in Social Networks Under Information Overload

Competitive influence diffusion occurs in settings ranging from product competition to online information propagation. Classical models often predict winner-takes-all outcomes, whereas persistent coexistence is observed in practice. We revisit this discrepancy by jointly considering incomplete network observation and information overload. An isotropic-Gaussian surrogate for a network embedding enables tractable mean-field estimation of overload timing. We then derive the competing dynamics before and after overload. Without overload, a strictly stronger influence asymptotically approaches dominance. Under overload, users become progressively less sensitive to influence strength, limiting further amplification and driving relative shares toward stable values determined by the initial state, strengths, and overload timing. We derive a first-order approximation to the exponential post-overload dynamics and evaluate its accuracy numerically. Experiments use six real network topologies but simulated competitive diffusion; they test internal predictions and structural sensitivity, not whether real users undergo the posited behavioral transition. Results are robust to alternative overload functions but sensitive to label-dependent priority cues. Recovering missing links can improve overload-time and final-share estimates, although link-prediction accuracy does not necessarily imply better diffusion prediction. Overall, information overload can interrupt cumulative strength amplification and thereby sustain coexistence under the stated assumptions.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-10-09
DOI
https://doi.org/10.3390/app16209981
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

Will the Winner Take All? Competing Influences in Social Networks Under Information Overload

Zhouyang Jin, Ningdi Jin, Ninglun Gu, Chen Feng et al.
Applied Sciences
Complex Network Analysis Techniques
article

Will the Winner Take All? Competing Influences in Social Networks Under Information Overload

Zhouyang Jin, Ningdi Jin, Ninglun Gu, Chen Feng, Kai Guan, Yuan Yao, Zhiyi Luo, Peng Zheng, Luoyi Fu
article en

Abstract

Competitive influence diffusion occurs in settings ranging from product competition to online information propagation. Classical models often predict winner-takes-all outcomes, whereas persistent coexistence is observed in practice. We revisit this discrepancy by jointly considering incomplete network observation and information overload. An isotropic-Gaussian surrogate for a network embedding enables tractable mean-field estimation of overload timing. We then derive the competing dynamics before and after overload. Without overload, a strictly stronger influence asymptotically approaches dominance. Under overload, users become progressively less sensitive to influence strength, limiting further amplification and driving relative shares toward stable values determined by the initial state, strengths, and overload timing. We derive a first-order approximation to the exponential post-overload dynamics and evaluate its accuracy numerically. Experiments use six real network topologies but simulated competitive diffusion; they test internal predictions and structural sensitivity, not whether real users undergo the posited behavioral transition. Results are robust to alternative overload functions but sensitive to label-dependent priority cues. Recovering missing links can improve overload-time and final-share estimates, although link-prediction accuracy does not necessarily imply better diffusion prediction. Overall, information overload can interrupt cumulative strength amplification and thereby sustain coexistence under the stated assumptions.

Applied SciencesVol. 16(20)
Hong Kong Polytechnic University (HK), China Mobile (China) (CN), Shanghai Jiao Tong University (CN), ZTE (China) (CN)
Openalex Percentile: Top 13%
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.

Will the Winner Take All? Competing Influences in Social Networks Under Information Overload — Zhouyang Jin, Ningdi Jin, et al. · Applied Sciences (2026) | TGRS Research Map | TGRS