Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 29 min ago
Peer-reviewedCC BY 4.0Mathematics

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

  1. 1State Key Laboratory of Media Convergence and Communication, Communication University of China, Beijing 100024, China

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.

Related

  1. Structured Positive-Definite Optimal Control Synthesis of Closed-Loop Recommendation Systems over Social Networks
    Simone Mariano, Paolo Frasca
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Near Optimal Finite Model POMDP Approximation of Controlled Diffusion with Partial Information
    Yunus Emre Demirci, Somnath Pradhan, Serdar Yüksel
    arXivPreprintarXiv licenceFull textOptimisation & controlProbabilityarXiv
  3. Cortical diffusion restriction predicts individual cognitive ability and carries cellular information
    Demian Wassermann, Gabriela Gomez Jimenez, Reuben Dorent
    HALPreprintCC BY-NC-SA 4.0Full textNeuroscienceStatisticsHAL
  4. Feature Information Dynamics in Diffusion
    Jia-Shu Pan, Tao Zhang, Yufei Huang +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Information Limits for Stable Reduction of Coupled Diffusion Systems
    Hiroki Ishizaka
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@article{yang2026recommendationmediated,
  title = {{Recommendation-Mediated Diffusion of Stance-Bearing Information in Online Social Networks: A Dynamic Message-Passing Analysis of the UEAI Model}},
  author = {Xiaohui Yang and Hao Shen},
  journal = {Mathematics},
  year = {2026},
  month = oct,
  doi = {10.3390/math14213961},
  url = {https://www.mdpi.com/2227-7390/14/21/3961},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Recommendation-Mediated Diffusion of Stance-Bearing Information in Online Social Networks: A Dynamic Message-Passing Analysis of the UEAI Model
AU  - Xiaohui Yang
AU  - Hao Shen
PY  - 2026
DA  - 2026/10/30
JO  - Mathematics
DO  - 10.3390/math14213961
UR  - https://www.mdpi.com/2227-7390/14/21/3961
AB  - 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.
SN  - 2227-7390
ER  -