Skip to content

Optimal and heuristic strategies for evaluating the influence of coordinated behavior in information cascades and retweet networks

Sep 2026 · arXiv.org · Vol abs/2609.24398 · 0 citations · 51 references
Computer Science

TL;DR

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.

Abstract

Coordinated Inauthentic Behavior (CIB) has become a major concern in online social platforms, yet its actual impact on information diffusion remains poorly understood. Existing research has primarily focused on detecting coordinated activity, while comparatively little attention has been devoted to quantifying its influence once detected. In this work, we introduce two complementary frameworks for the post-hoc evaluation of coordinated accounts. First, we formulate the problem on information cascades as a constrained influence maximization problem over directed trees and develop a polynomial-time dynamic programming algorithm that computes the optimal placement of coordinated nodes, providing an upper bound on their achievable influence. Second, motivated by the limited availability of diffusion cascades in real-world platforms, we propose a network-based framework that estimates influence directly from retweet networks using the independent cascade model and compares the observed placement of coordinated accounts against established heuristic baselines. We evaluate both approaches on Twitter/X data from the 2019 UK General Election and on a collection of verified state-backed information operation campaigns spanning multiple countries. While coordinated accounts exhibit limited influence in the UK cascades, the network-based analysis reveals substantial differences across campaigns, with several operations achieving influence comparable to or exceeding that of structurally central seed sets. Finally, by reconstructing cascades from the retweet networks, we show that the two frameworks produce consistent results, suggesting that the observed effects reflect intrinsic structural properties of coordinated activity rather than artifacts of the underlying methodology.

View source

Similar papers

Sep 2026

Influence Ranking Improvement via Link Addition in Social Networks

Social media platforms increasingly rely on influential users for information dissemination in domains such as marketing and political campaigns. As the value of being recognized as influential grows, users may have incentives to strategically enhance their influence. In this study, we investigate whether and to what e...

Taiki Ikemoto, Sho Tsugawa · 0 citations
Oct 2026

IEO-IM: influence maximization in social networks using improved equilibrium optimizer

This method extends the Equilibrium Optimizer through a sequence of progressively refined strategies that progressively improves search guidance, population diversity, and adaptive refinement, and shows competitive computational performance on the evaluated networks, including the large-scale YouTube network.

N. Alawad · 0 citations
Sep 2026

A Novel Approach for the SDIR Epidemic Model on Online Social Networks

Information diffusion can be controlled by restricting or removing links (edges) in online social networks, as well as in real-world networks. To identify the most influential links to remove while minimizing diffusion, previous studies have proposed upper bounds for spreading processes in SIR and SIS models, using sup...

Phúc Hồng Nguyễn, K. Duong, Dung Phi Hoang · 0 citations
Open access 2026

Efficient Algorithm for Opinion Optimization via Leader Selection in Directed Social Networks

We study an opinion optimization problem based on an extended DeGroot model for a social network, where stubborn leaders hold fixed opinions of 0 or 1. Given a set of leaders with opinion 0, our goal is to select a small number of leaders with opinion 1 from the remaining nodes to maximize the average opinion of the ne...

Xin-Na Zhou, Zhong-Zhi Zhang · 0 citations
Preprint Oct 2026

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

A controlled comparison of two different recommendation mechanisms in an LLM-based online social network simulation that introduces new connections in the network, while Content-Exposure Recommendation exposes additional users to individual posts without modifying the underlying graph.

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

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