Metraipolis › archive › dc_ec8a8606ef6e
Revisiting the Objective of Echo Chamber Detection — arXiv:2609.18545
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18545
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T15:04:46.150Z
- SHA-256 of the archived text
4bbb9edabef29dc7f05057a2604fa51bd5ef6ec403072940d7ca57b69069718e- Stable URL of this page
https://metraipolis.com/documento/dc_ec8a8606ef6e
How to cite
Revisiting the Objective of Echo Chamber Detection — arXiv:2609.18545 — arXiv (en), https://arxiv.org/abs/2609.18545 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec8a8606ef6e (Metraipolis archive dc_ec8a8606ef6e, sha256 4bbb9edabef29dc7f05057a2604fa51bd5ef6ec403072940d7ca57b69069718e)
BibTeX
@misc{dcec8a8606ef6e,
title = {Revisiting the Objective of Echo Chamber Detection — arXiv:2609.18545},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18545},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec8a8606ef6e; sha256 4bbb9edabef29dc7f05057a2604fa51bd5ef6ec403072940d7ca57b69069718e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18545. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we study the detection of an echo chamber in a social network, i.e., the identification of a set of nodes that agree on a topic, while disagreeing with the rest of nodes. We argue that this problem is different from other social network analysis problems such as community detection, and from other graph problems such as maximum graph cut and maximum clique. To the best of our knowledge, we are the first to formalize the objective function of echo chamber detection, by using the theory of Fourier transforms of set functions (Stobbe and Krause, 2012). We propose scalable semidefinite relaxation, solved via an interior point method and sparse linear algebra. Experimentally, our algorithm recovers the ground truth echo chamber better than competing methods on small synthetic experiments. Our algorithm produces echo chambers with better network properties than competing methods on large real-world datasets. To independently validate our proposed objective function, we show that our algorithm finds echo chambers with more agreements with suspended users than competing methods on a small real-world dataset. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-17 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.18545 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T14:08:19.129Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).