Oct 2026· Applied Sciences· Vol 16, pp. 9981· 0 citations· 23 references
TL;DR
Overall, information overload can interrupt cumulative strength amplification and thereby sustain coexistence under the stated assumptions and thereby sustain coexistence under the stated assumptions.
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.
This paper studies popularity dynamics in social networks, where users'engagement with competing channels is driven by intrinsic content quality, social influence, and popularity feedback. We introduce a stochastic model in which users interact through a directed influence network and channel exposure depends jointly o...
A network-based framework that estimates influence directly from retweet networks using the independent cascade model and a polynomial-time dynamic programming algorithm that computes the optimal placement of coordinated nodes, providing an upper bound on their achievable influence are introduced.
N. Di Marco, Matteo Cinelli, Shin-Ichi Nakano et al.· arXiv.org· 0 citations
Recommendation systems change both the amount and allocation of exposure opportunities, making their effects on diffusion difficult to separate. We develop a discrete-time unexposed–exposed–active–inactive (UEAI) model that links static stance consistency, target-specific recommendation visibility and active-prevalence...
In this work, we investigate three modified versions of the classic Hegselmann-Krause opinion dynamics model, incorporating features that are typical of many real-world systems, such as uncertainty in the selection of interacting agents and a weighted evaluation of the relevance of their opinions in the influence funct...
Chiara Giaquinta, Laura Hernández, David Chavalarias· 0 citations
This work derives an exact conditional layer-wise recursion that reveals the statistical coupling between diffusion realizations and opinion evolution, and introduces a mean-field decoupling approximation that yields a tractable linear recursion for the expected opinion trajectory.
Elisabetta Biondi, C. Boldrini, A. Passarella et al.· 0 citations
Misinformation spreading on social networks is jointly shaped by community structure, higher-order reinforcement, and intervention. We formulate a sentinel-triggered competitive susceptible-infected-susceptible-AB model on a simplicial complex with two equal-sized communities. Sentinels respond to local misinformation...