cs.SIOct 15, 2026

Whose Polarization Is It? Auditing Fairness in Network Polarization Measures

Authors: Stanisław Stępień, Michalina Janik, Akrati Saxena, Radosław Michalski

Organizations: Wroclaw University of Science and Technology, Wrocław, Poland · Leiden University, Leiden, The Netherlands

Abstract

A polarization score is supposed to describe a community, not its surroundings. Yet when a minority community is embedded in a larger network, its measured polarization can rise or fall with the size and structure of the majority around it. We ask whether polarization measures are therefore fair to minorities and develop an audit built around two criteria: measurement invariance (MI), which asks whether otherwise equivalent majorities and minorities receive equivalent scores, and structural exogeneity (SE), which asks whether a minority's score changes when its surrounding majority changes. Resolution sensitivity (RS) is treated as a prerequisite for meaningful fairness assessment. We audit seven polarization measure families spanning the three network-operationalizable dimensions of polarization, introducing Network-Weighted Distance (NWD) to fill an unserved extremeness-separation combination. Across controlled synthetic networks, mechanism-isolating diagnostic topologies, and real political and communication networks, no measure passes all applicable checks. Minorities are systematically scored as more polarized than equivalent majorities. We trace this dependence to two separate channels: majority structure can alter the opinions that opinion-reading measures consume, and, on a different path, opinion-orthogonal structural change can affect the arithmetic of structural measures. Reading opinions is thus double-edged, letting contamination in when structure moves opinions but shielding the score when structure changes and opinions do not. We close with practical guidance for reporting polarization scores without inheriting these biases.

Figures & tables

Appendix figures & tables4 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

May 12, 2026

Linking Scalar-Intensity Language to Structural Polarization with Validated Signed-Network Measures

Polarization in online communities is often studied through either language or interaction structure, but the two views are rarely connected within a unified framework. Prior work has linked them by constructing interaction graphs from human judgements of agreement and disagreement, leaving a gap between language as observed text and structure as an engineered representation of that text. We address this gap with a language-grounded signed-network pipeline that derives signed relations directly from conversational exchanges and links window-level language patterns to structural polarization over time. Before examining this relationship, we compare spectral and frustration-based polarization measures on synthetic benchmarks and real interaction networks. We find that frustration-based measures normalized by the graph's cycle-space capacity provide a more suitable basis for comparing polarization across networks of different sizes and densities. We therefore carry forward two complementary frustration-based measures: a weighted form that incorporates stance-model confidence and a count form based on edge signs. The weighted measure provides the better-behaved structural estimate and aligns more closely with polarization measured from human-labelled interactions, while the count measure reveals a stronger relationship with language. Across monthly Reddit Brexit discussions, greater prevalence of scalar-intensity language is associated with greater structural polarization, with a similar rank-level pattern in the human-labelled network. We find little evidence that language in one month predicts polarization in the next, whereas contemporaneous scalar-intensity prevalence provides useful information about polarization within the same month.
Apr 8, 2026

SemEval-2026 Task 9: Detecting Multilingual, Multicultural and Multievent Online Polarization

We present SemEval-2026 Task 9, a shared task on online polarization detection, covering 22 languages and comprising over 110K annotated instances. Each data instance is multi-labeled with the presence of polarization, polarization type, and polarization manifestation. Participants were asked to predict labels in three sub-tasks: (1) detecting the presence of polarization, (2) identifying the type of polarization, and (3) recognizing the polarization manifestation. The three tasks attracted over 1,000 participants worldwide and more than 10k submission on Codabench. We received final submissions from 67 teams and 73 system description papers. We report the baseline results and analyze the performance of the best-performing systems, highlighting the most common approaches and the most effective methods across different subtasks and languages. The dataset of this task is publicly available.
Feb 23, 2026

PACIFIER: Pacing Opinion Depolarization via a Unified Graph Learning Framework

Online social networks often form opposing echo chambers that reinforce opinion polarization. Under the Friedkin-Johnsen (FJ) model, ModerateInternal (MI) and ModerateExpressed (ME) reduce polarization by neutralizing selected users' internal or expressed opinions, but existing solutions are largely model-specific and learning-based depolarization remains underexplored. We study FJ-based moderation as feedback-free autoregressive sequential planning and propose PACIFIER, a unified graph-learning framework that constructs ordered intervention sequences from the initial graph-opinion instance without using recomputed post-intervention expressed opinions as intermediate feedback. PACIFIER combines history-aware node representations with Greedy and RL variants for immediate and long-horizon action scoring, and supports MI, ME, continuous opinions, cost-aware moderation, and node removal. We evaluate intervention trajectories by Accumulated Normalized Polarization (ANP). Trained only on synthetic graphs with fewer than 50 nodes, PACIFIER transfers to 15 real-world Twitter networks with up to 155,599 nodes. It improves over the strongest non-PACIFIER baseline by up to 35.3%, while PACIFIER-RL improves over PACIFIER-Greedy by up to 37.69%. Compared with oracle-style Greedy, PACIFIER retains 98.94% and 97.39% near-oracle quality on MI and ME, respectively, and is about 600x faster at the 450-node range. The source code is available at https://github.com/RickyYY-SZU/PACIFIER