Recommendation-Mediated Diffusion of Stance-Bearing Information in Online Social Networks: A Dynamic Message-Passing Analysis of the UEAI Model

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 feedback. For this model, we derive sparse dynamic message-passing (DMP) equations. Exact per-time-step matching of degree-weighted potential edge-opportunity budgets isolates allocation changes. We prove that equal budgets can produce different expected new adoptions. Paired Monte Carlo (MC) simulations on Barabási–Albert and stochastic block model networks show a positive median network-level advantage in final cumulative adoption under dynamic recommendation over uniform budget-matched allocation. Constructive counterexamples establish that a shared local non-backtracking stability boundary need not determine finite-network stochastic early-growth boundaries or macroscopic cascade transitions. Across four synthetic network families, numerical boundary estimates vary with topology, seed and observation criteria. DMP approximates final adoption and active-fraction trajectories. In some parameter tests, however, its predicted change in the dynamic-minus-matched adoption advantage has the opposite sign to the MC result. The framework supports comparisons of recommendation allocation at equal potential budgets and requires propagation boundaries to be interpreted according to their distinct physical criteria.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-10-30
DOI
https://doi.org/10.3390/math14213961
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

Recommendation-Mediated Diffusion of Stance-Bearing Information in Online Social Networks: A Dynamic Message-Passing Analysis of the UEAI Model

Xiaohui Yang, Hao Shen
Mathematics
Complex Network Analysis Techniques
article

Recommendation-Mediated Diffusion of Stance-Bearing Information in Online Social Networks: A Dynamic Message-Passing Analysis of the UEAI Model

Xiaohui Yang, Hao Shen
article en

Abstract

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 feedback. For this model, we derive sparse dynamic message-passing (DMP) equations. Exact per-time-step matching of degree-weighted potential edge-opportunity budgets isolates allocation changes. We prove that equal budgets can produce different expected new adoptions. Paired Monte Carlo (MC) simulations on Barabási–Albert and stochastic block model networks show a positive median network-level advantage in final cumulative adoption under dynamic recommendation over uniform budget-matched allocation. Constructive counterexamples establish that a shared local non-backtracking stability boundary need not determine finite-network stochastic early-growth boundaries or macroscopic cascade transitions. Across four synthetic network families, numerical boundary estimates vary with topology, seed and observation criteria. DMP approximates final adoption and active-fraction trajectories. In some parameter tests, however, its predicted change in the dynamic-minus-matched adoption advantage has the opposite sign to the MC result. The framework supports comparisons of recommendation allocation at equal potential budgets and requires propagation boundaries to be interpreted according to their distinct physical criteria.

MathematicsVol. 14(21)
State Key Laboratory of Media Convergence and Communication (CN), Communication University of China (CN)
Openalex Percentile: Top 14%
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