{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T13:06:08Z","timestamp":1768827968036,"version":"3.49.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T00:00:00Z","timestamp":1678147200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We describe a model for polarization in multi-agent systems based on Esteban\nand Ray's standard family of polarization measures from economics. Agents\nevolve by updating their beliefs (opinions) based on an underlying influence\ngraph, as in the standard DeGroot model for social learning, but under a\nconfirmation bias; i.e., a discounting of opinions of agents with dissimilar\nviews. We show that even under this bias polarization eventually vanishes\n(converges to zero) if the influence graph is strongly-connected. If the\ninfluence graph is a regular symmetric circulation, we determine the unique\nbelief value to which all agents converge. Our more insightful result\nestablishes that, under some natural assumptions, if polarization does not\neventually vanish then either there is a disconnected subgroup of agents, or\nsome agent influences others more than she is influenced. We also prove that\npolarization does not necessarily vanish in weakly-connected graphs under\nconfirmation bias. Furthermore, we show how our model relates to the classic\nDeGroot model for social learning. We illustrate our model with several\nsimulations of a running example about polarization over vaccines and of other\ncase studies. The theoretical results and simulations will provide insight into\nthe phenomenon of polarization.<\/jats:p>","DOI":"10.46298\/lmcs-19(1:18)2023","type":"journal-article","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T08:40:18Z","timestamp":1678178418000},"source":"Crossref","is-referenced-by-count":6,"title":["A Formal Model for Polarization under Confirmation Bias in Social Networks"],"prefix":"10.46298","volume":"Volume 19, Issue 1","author":[{"given":"M\u00e1rio S.","family":"Alvim","sequence":"first","affiliation":[]},{"given":"Bernardo","family":"Amorim","sequence":"additional","affiliation":[]},{"given":"Sophia","family":"Knight","sequence":"additional","affiliation":[]},{"given":"Santiago","family":"Quintero","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Valencia","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2023,3,7]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/11039\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/11039\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:39Z","timestamp":1687292439000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/8874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(1:18)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2112.09542v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2112.09542v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2112.09542v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2112.09542","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2112.09542","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,7]]},"article-number":"8874"}}