Papers › Discerning media bias within a network of political allies: an analytic condition for...
Discerning media bias within a network of political allies: an analytic condition for disruption by partisans
Jarra Horstman, Andrew Melatos, Farhad Farokhi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
An individual's opinion concerning political bias in the media is shaped by exogenous factors (independent analysis of media outputs) and endogenous factors (social activity, e.g. peer pressure by political allies and opponents in a network). Previous numerical studies show, that persuadable agents in allies-only networks are disrupted from asymptotically learning the intrinsic bias of a media organization, when the network is populated by one or more obdurate agents (partisans), who are not persuadable themselves but exert peer pressure on other agents. Some persuadable agents asymptotically learn a false bias, while others vacillate indefinitely between a false bias and the true bias, a phenomenon called turbulent nonconvergence which also emerges in opponents-only and mixed networks without partisans. Here we derive an analytic instability condition, which demarcates turbulent nonconvergence from asymptotic learning as a function of key network properties, for an idealized model of media bias featuring a biased coin. The condition is verified with Monte Carlo simulations as a function of network size, sparsity, and partisan fraction. It is derived in a probabilistic framework, where an agent's opinion is uncertain and is described by a probability density function, which is multimodal in general, generalizing previous studies which assume that an agent's opinion is certain (i.e. described by one number). The results and their social implications are interpreted briefly in terms of the social science theory of structural balance.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections