Static and Dynamic Strategies for Influencing Opinions in Social Networks

• URL: http://arxiv.org/abs/2605.14918v1
• Date: Thu, 14 May 2026 14:52:30 GMT
• Title: Static and Dynamic Strategies for Influencing Opinions in Social Networks
• Abstract summary: We study how targeted stubborn agents can shift the average opinion of a network governed by bounded-confidence dynamics.<n>We compare static interventions, in which stubborn agents keep a fixed extreme opinion, with dynamic interventions, in which their opinion gradually evolves from moderate to extreme values.
• Score: 1.3552831447371743
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The ability of a small set of coordinated actors to manipulate opinions in online social networks poses a serious challenge to the fairness and integrity of public debate. We investigate this problem by studying how targeted stubborn agents can shift the average opinion of a network governed by the Hegselmann-Krause bounded-confidence dynamics. Experiments are conducted on weighted LFR benchmark networks with community structure, using multiple node-selection strategies based on degree, strength, PageRank, betweenness, k-coreness, s-coreness, and salience. We compare static interventions, in which stubborn agents keep a fixed extreme opinion, with dynamic interventions, in which their opinion gradually evolves from moderate to extreme values. Results show that dynamic strategies are substantially more effective than static ones, as they exploit bounded-confidence dynamics to progressively recruit intermediate agents and extend influence across the network. In contrast, static strategies tend to create early opinion separation and therefore have a more limited reach. We also find that while some centrality measures offer advantages in static settings, dynamic interventions can achieve strong performance even with simple or random node selection. Overall, the study clarifies how intervention design and target selection interact in shaping collective opinions, with implications for understanding and countering manipulation in social networks.

Related papers

• Learning to Watch: Active Video Anomaly Understanding via Interleaved Policy Optimization [56.150184676745205]
  Video anomaly understanding (VAU) relies on sparse, context-dependent cues.<n>We propose $Anomtext-$, a closed-loop framework that reconceptualizes video understanding as an active sequential decision-making process.<n>Inspired by human video-reviewing behavior, this framework unifies internal cognitive reasoning and strategic evidence acquisition into an interleaved policy.
  arXiv  Detail & Related papers  (2026-07-01T08:41:49Z)
• ALSO: Adversarial Online Strategy Optimization for Social Agents [63.84788516416339]
  We propose textbfALSO (textbfAdrial ontextbfLine textbfStrategy textbfOptimization) as the first framework for online strategy optimization in social simulation.<n> ALSO formulates multi-turn interaction as an adversarial bandit problem, where combinations of static personas and dynamic strategy instructions are treated as arms.<n>Also introduces a lightweight neural surrogate to predict rewards from interaction histories, enabling sample-efficient exploration and continuous online adaptation.
  arXiv  Detail & Related papers  (2026-05-15T09:25:15Z)
• Dynamic Treatment on Networks [0.7349727826230862]
  In networks, effective dynamic treatment allocation requires deciding both whom to treat and also when, so as to amplify policy impact through spillovers.<n>We propose Q-Ising, a three-stage pipeline that estimates network adoption dynamics via a Bayesian dynamic Ising model from a single observed panel.<n>We apply our method to data from Indian village microfinance networks and synthetic block models under simulated heterogeneous susceptible-infected-susceptible (SIS) dynamics.
  arXiv  Detail & Related papers  (2026-05-07T16:58:38Z)
• Pacing Opinion Polarization via Graph Reinforcement Learning [0.0]
  PACIFIER is a graph reinforcement learning framework for sequential polarization moderation via network interventions.<n>It reformulates canonical problems as sequential decision-making tasks, enabling adaptive intervention policies without repeated steady-state recomputation.<n>Experiments on real-world networks demonstrate strong performance and scalability across diverse moderation scenarios.
  arXiv  Detail & Related papers  (2026-02-23T11:57:04Z)
• Multi-Modal Manipulation via Multi-Modal Policy Consensus [62.49978559936122]
  We propose a new approach to integrate diverse sensory modalities for robotic manipulation.<n>Our method factorizes the policy into a set of diffusion models, each specialized for a single representation.<n>We evaluate our approach on simulated manipulation tasks in RLBench, as well as real-world tasks such as occluded object picking, in-hand spoon reorientation, and puzzle insertion.
  arXiv  Detail & Related papers  (2025-09-27T19:43:04Z)
• DynamiX: Large-Scale Dynamic Social Network Simulator [101.65679342680542]
  DynamiX is a novel large-scale social network simulator dedicated to dynamic social network modeling.<n>For opinion leaders, we propose an information-stream-based link prediction method recommending potential users with similar stances.<n>For ordinary users, we construct an inequality-oriented behavior decision-making module.
  arXiv  Detail & Related papers  (2025-07-26T12:13:30Z)
• Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks [86.99017195607077]
  We address the challenge of sampling and remote estimation for autoregressive Markovian processes in a wireless network with statistically-identical agents.<n>Our goal is to minimize time-average estimation error and/or age of information with decentralized scalable sampling and transmission policies.
  arXiv  Detail & Related papers  (2024-04-04T06:24:11Z)
• Towards Improving Robustness Against Common Corruptions in Object Detectors Using Adversarial Contrastive Learning [10.27974860479791]
  This paper proposes an innovative adversarial contrastive learning framework to enhance neural network robustness simultaneously against adversarial attacks and common corruptions. By focusing on improving performance under adversarial and real-world conditions, our approach aims to bolster the robustness of neural networks in safety-critical applications.
  arXiv  Detail & Related papers  (2023-11-14T06:13:52Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Temporal Dynamics of Coordinated Online Behavior: Stability, Archetypes, and Influence [43.555910858821576]
  Large-scale online campaigns, malicious or otherwise, require a significant degree of coordination among participants. Here, we carry out the first dynamic analysis of coordinated behavior. Thanks to our novel approach we find that: (i) coordinated communities feature variable degrees of temporal instability; (ii) dynamic analyses are needed to account for such instability; and results of static analyses can be unreliable and scarcely representative of unstable communities.
  arXiv  Detail & Related papers  (2023-01-17T09:52:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.