Positive algorithmic bias cannot stop fragmentation in homophilic networks

From MaRDI portal
Publication:5070525

DOI10.1080/0022250X.2020.1818078zbMATH Open1484.91337arXiv2001.02878OpenAlexW2999628059WikidataQ81630197 ScholiaQ81630197MaRDI QIDQ5070525FDOQ5070525

Taha Yasseri, Chris Blex

Publication date: 13 April 2022

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

Abstract: Fragmentation, echo chambers, and their amelioration in social networks have been a growing concern in the academic and non-academic world. This paper shows how, under the assumption of homophily, echo chambers and fragmentation are system-immanent phenomena of highly flexible social networks, even under ideal conditions for heterogeneity. We achieve this by finding an analytical, network-based solution to the Schelling model and by proving that weak ties do not hinder the process. Furthermore, we derive that no level of positive algorithmic bias in the form of rewiring is capable of preventing fragmentation and its effect on reducing the fragmentation speed is negligible.


Full work available at URL: https://arxiv.org/abs/2001.02878





Cites Work







This page was built for publication: Positive algorithmic bias cannot stop fragmentation in homophilic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5070525)