Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2511.20546

Modelling the Spread of Toxicity and Exploring its Mitigation on Online Social Networks

Aatman Vaidya·Harsh Bhagat·Seema Nagar·Amit A. Nanavati
View original source ↗Read source document ↗Export metadata ↓

Abstract

Hate speech on online platforms has been credibly linked to multiple instances of real world violence. This calls for an urgent need to understand how toxic content spreads and how it might be mitigated on online social networks, and expectedly has been the topic of extensive research in recent times. Prior work has largely modelled hate through epidemic or spread activation based diffusion models, in which the users are often divided into two categories, hateful or not. In this work, users are treated as transformers of toxicity, based on how they respond to incoming toxicity. Compared with the incoming toxicity, users amplify, attenuate, or replicate (effectively, transform) the toxicity and send it forward. We do a temporal analysis of toxicity on Twitter, Koo and Gab and find that (a) toxicity is not conserved in the network; (b) only a subset of users change behaviour over time; and (c) there is no evidence of homophily among behaviour-changing users. In our model, each user transforms incoming toxicity by applying a "shift" to it prior to sending it forward. Based on this, we develop a network model of toxicity spread that incorporates time-varying behaviour of users. We find that the "shift" applied by a user is dependent on the input toxicity and the category. Based on this finding, we propose an intervention strategy for toxicity reduction. This is simulated by deploying peace-bots. Through experiments on both real-world and synthetic networks, we demonstrate that peace-bot interventions can reduce toxicity, though their effectiveness depends on network structure and placement strategy.

Explore related subjects

cs.SI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aatman Vaidya, Harsh Bhagat, Seema Nagar, Amit A. Nanavati. 2025-11-25. Modelling the Spread of Toxicity and Exploring its Mitigation on Online Social Networks. https://arxiv.org/abs/2511.20546

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why Does Misinformation Propagate Faster? An Algorithmic Perspective on X

Misinformation is widely reported to propagate faster on engagement-based platforms, yet prior work largely focused on empirical analysis, without identifying a specific algorithmic mechanism that results in this phenomenon. Thanks to the open-sourcing of X's recommendation algorithms, we conduct what is, to our knowledge, the first component-level study of the recommendation algorithm deployed by a social media platform, which examines how each of its components affects misinformation propagation. Specifically, we identify the engagement fungibility mechanism in the algorithm, where the final recommendation score is constructed as a weighted sum of all predicted user activities. As a result, a tweet can be repeatedly recommended simply because it is predicted to draw many instant reactions (e.g., likes and retweets), even when it is not expected to draw thoughtful responses (e.g., replies and quotes). Since misinformation typically draws a larger share of its engagement from instant reactions, this mechanism enables it to receive more recommendation exposure and to propagate faster. To empirically validate this mechanism, we re-implement X's recommendation algorithm on the USC X 2024 election corpus, and build a calibrated simulation study to analyze the impact of different scoring rules. We find that re-tuning the metric weights has little or even a negative impact on reducing the credibility exposure gap, while those scoring rules that set a precondition of thoughtful engagement for amplification would be able to alleviate the gap significantly, across 46 robustness checks. Our diagnosis, therefore, yields a simple and deployable fix, a reflective-threshold gate that withholds amplification until a tweet is predicted to draw thoughtful engagement, which we find to reallocate exposure away from low-credibility content at no cost to mainstream exposure and with no loss of engagement.

cs.SI↗
arXiv2026

The Conversation Turns First: Crowd Discussion and Price Reversals in Prediction Markets

Prediction markets combine trading with public discussion of the same events. We examine whether comment-derived signals predict subsequent activity, buying direction, and changes in the leading outcome. A correlation sweep across 79 non-political Polymarket markets guides six classification experiments comparing comment features, trading features, and their combinations. On live blocks containing comments, attention nearly matches trading history in predicting heavy trading within 18 hours (PR-AUC 0.786 versus 0.790, against prevalence 0.606), with its relative advantage concentrated in short markets. Comment content carries directional information: toxicity ranks future buying direction above chance in 43 of 53 scored markets, while adding attention, sentiment, and stance to flow history increases ROC-AUC from 0.780 to 0.788. Leadership changes are predicted primarily by market state. Stance shifts against the leader before reversals in 23 of 27 evaluable markets, but adds no clear improvement in individual-block forecasting. These results distinguish attention from directional support and price uncertainty. They establish predictive associations consistent with discussion and trading responding to shared information, without identifying a causal effect of comments on markets.

cs.SI↗
arXiv2026

Deep-learning-aided dismantling of interdependent networks

Identifying the minimal set of nodes whose removal breaks a complex network apart, also referred as the network dismantling problem, is a highly non-trivial task with applications in multiple domains. Whereas network dismantling has been extensively studied over the past decade, research has primarily focused on the formulations of the optimization problem for single-layer networks, neglecting that many, if not all, real networks display multiple layers of interdependent interactions. In such networks, the optimization problem is fundamentally different as the effect of removing nodes propagates within and across layers in a way that can not be predicted using a single-layer perspective. Here, we propose a dismantling algorithm named MultiDismantler, which leverages multiplex network representation and deep reinforcement learning to optimally dismantle multi-layer interdependent networks. MultiDismantler is trained on small synthetic multiplex graphs; when applied to large, real and synthetic networks, it displays exceptional dismantling performance, clearly outperforming all existing methods that rely on a single-layer approach to network dismantling. We show that MultiDismantler is effective in guiding strategies for the containment of diseases in social networks characterized by multiple layers of social interactions. Also, we show that MultiDismantler is useful in the design of protocols aimed at delaying the onset of cascading failures in interdependent critical infrastructures.

cs.SI↗