Skip to content

Modeling link recommendations as a network growth mechanism and their impact on social contagion

Sep 2026 · Online Soc. Networks Media · Vol 54, pp. 100354 · 1 citation · 66 references
Computer Science

TL;DR

It is shown that while simple contagions exhibit relatively modest shifts under most recommenders, complex contagions are highly sensitive to clustering-and homophily-based recommendations, thriving at moderate recommendation strengths but sharply diminishing under excessive recommendation strength.

Abstract

Link recommendation algorithms significantly shape online social networks, influencing both their structural evolution and critical processes such as information and behavior spread. This paper investigates how these algorithms affect simple and complex contagion processes by modeling recommendations as additional network growth mechanisms. We introduce a synthetic network model that integrates preferential attachment, triadic closure, and choice homophily, then extend it with various link recommenders, including heuristics and graph neural networks (GNNs). Our findings show that while simple contagions exhibit relatively modest shifts under most recommenders, complex contagions are highly sensitive to clustering-and homophily-based recommendations, thriving at moderate recommendation strengths but sharply diminishing under excessive recommendation strength. These results underscore the nuanced interplay between network structure, recommendation strength, and contagion dynamics, highlighting the importance of incorporating social contagions into the design of link recommendation algorithms.

Read PDF

Similar papers

Preprint Oct 2026

Polarization Dynamics under Algorithmic Recommendations in LLM-based Online Social Networks

How do recommendation algorithms contribute to the formation of polarized opinions in online social networks? This question has been studied through empirical analyses of real platforms and mathematical models of opinion dynamics. Empirical studies capture user behavior but are often limited by noisy, incomplete, or in...

Ali Safarpoor Dehkordi, Mohammad Shirzadi, Mehwish Nasim et al. · 0 citations
Open access 2026

Beyond Structure: A Causal Perspective on Network Influence

Identifying influential nodes in complex networks is a critical challenge across domains ranging from social media analytics to epidemiology and marketing. Traditional influence maximization algorithms often fall short because they rely primarily on the network structure, overlooking the intrinsic qualities of individu...

Priyanka Gautam, Sai Munikoti, M. Halappanavar et al. · 0 citations
Open access Sep 2026

A Hybrid Approach For Enhanced Influence Maximization Integrating Independent Cascade and Linear Threshold Dynamics For More Reliable Seed Selection in Social Networks

A hybrid model is built that combines the two models' influence-spread estimates through a tunable weighting parameter, and a greedy seed-selection procedure optimizes over the combined signal rather than either model alone, suggesting that treating diffusion as a blend of probabilistic and threshold-based behavior is...

Aditya Raj, D. Malleswari · 0 citations
Preprint Oct 2026

Modelling the complex dynamics of online disinformation cascades

Disinformation on online social media has been on the rise in the past years. While there is extensive literature modelling social cascades, online disinformation cascades show distinctive characteristics: they provoke debunking reactions, they spread over networks with heterogeneous connectivity, and they compete for...

Guillermo Romero Moreno, V. Robu, H. La Poutré · 0 citations
Aug 2026

Graph-based social recommendation with redundant information suppression

A social relationship adjustment loss function, which dynamically adjusts the weights of social connections, and the Hilbert-Schmidt independence criterion loss function, which reduces the dependence between pre- and post-adjusted user/item embeddings, thereby amplifying the effect of adjusted social relationships on t...

Shu-Run Zuo, Heng-Ru Zhang, Yuan-Yuan Xu · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.