{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T06:16:22Z","timestamp":1779257782223,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft,Germany","award":["DFG 411362735"],"award-info":[{"award-number":["DFG 411362735"]}]},{"name":"Deutsche Forschungsgemeinschaft,Germany","award":["DFG 411362735"],"award-info":[{"award-number":["DFG 411362735"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Opinion spreading in a society decides the fate of elections, the success of products, and the impact of political or social movements. A prominent model to study opinion formation processes is due to Hegselmann and Krause. It has the distinguishing feature that stable states do not necessarily show consensus, i.e., the population of agents might not agree on the same opinion. We focus on the social variant of the Hegselmann\u2013Krause model. There are<jats:italic>n<\/jats:italic>agents, which are connected by a social network. Their opinions evolve in an iterative, asynchronous process, in which agents are activated one after another at random. When activated, an agent adopts the average of the opinions of its neighbors having a similar opinion (where similarity of opinions is defined using a parameter<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\varepsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03b5<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>). Thus, the set of influencing neighbors of an agent may change over time. We show that such opinion dynamics are guaranteed to converge for any social network. We provide an upper bound of<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\text {O}}(n|E|^2 (\\varepsilon \/\\delta )^2)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mtext>O<\/mml:mtext><mml:mo>(<\/mml:mo><mml:mi>n<\/mml:mi><mml:mo>|<\/mml:mo><mml:mi>E<\/mml:mi><mml:msup><mml:mo>|<\/mml:mo><mml:mn>2<\/mml:mn><\/mml:msup><mml:msup><mml:mrow><mml:mo>(<\/mml:mo><mml:mi>\u03b5<\/mml:mi><mml:mo>\/<\/mml:mo><mml:mi>\u03b4<\/mml:mi><mml:mo>)<\/mml:mo><\/mml:mrow><mml:mn>2<\/mml:mn><\/mml:msup><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>on the expected number of opinion updates until convergence to a stable state, where<jats:inline-formula><jats:alternatives><jats:tex-math>$$|E|$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mo>|<\/mml:mo><mml:mi>E<\/mml:mi><mml:mo>|<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>is the number of edges of the social network, and<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\delta $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03b4<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>is a parameter of the stability concept. For the complete social network we show a bound of<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\text {O}}(n^3(n^2 + (\\varepsilon \/\\delta )^2))$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mtext>O<\/mml:mtext><mml:mo>(<\/mml:mo><mml:msup><mml:mi>n<\/mml:mi><mml:mn>3<\/mml:mn><\/mml:msup><mml:mrow><mml:mo>(<\/mml:mo><mml:msup><mml:mi>n<\/mml:mi><mml:mn>2<\/mml:mn><\/mml:msup><mml:mo>+<\/mml:mo><mml:msup><mml:mrow><mml:mo>(<\/mml:mo><mml:mi>\u03b5<\/mml:mi><mml:mo>\/<\/mml:mo><mml:mi>\u03b4<\/mml:mi><mml:mo>)<\/mml:mo><\/mml:mrow><mml:mn>2<\/mml:mn><\/mml:msup><mml:mo>)<\/mml:mo><\/mml:mrow><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>that represents a major improvement over the previously best upper bound of<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\text {O}}(n^9 (\\varepsilon \/\\delta )^2)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mtext>O<\/mml:mtext><mml:mo>(<\/mml:mo><mml:msup><mml:mi>n<\/mml:mi><mml:mn>9<\/mml:mn><\/mml:msup><mml:msup><mml:mrow><mml:mo>(<\/mml:mo><mml:mi>\u03b5<\/mml:mi><mml:mo>\/<\/mml:mo><mml:mi>\u03b4<\/mml:mi><mml:mo>)<\/mml:mo><\/mml:mrow><mml:mn>2<\/mml:mn><\/mml:msup><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00446-024-00467-3","type":"journal-article","created":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T06:01:52Z","timestamp":1714111312000},"page":"207-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Asynchronous opinion dynamics in social networks"],"prefix":"10.1007","volume":"37","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Kaaser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Lenzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malin","family":"Rau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Schmand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,26]]},"reference":[{"issue":"1","key":"467_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1086\/267152","volume":"27","author":"R Abelson","year":"1963","unstructured":"Abelson, R., Bernstein, A.: A computer simulation model of community referendum controversies. Public Opin. Q. 27(1), 93\u2013122 (1963)","journal-title":"Public Opin. Q."},{"key":"467_CR2","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Becchetti, L., Cruciani, E., Pasquale, F., Rizzo, S.: Biased opinion dynamics: when the devil is in the details. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 53\u201359","DOI":"10.24963\/ijcai.2020\/8"},{"issue":"2","key":"467_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. 21(2), 87\u2013102 (2008)","journal-title":"Distrib. Comput."},{"key":"467_CR4","doi-asserted-by":"crossref","unstructured":"Auletta, V., Fanelli, A., Ferraioli, D.: Consensus in opinion formation processes in fully evolving environments. In: Proceedings of the 33rd Conference on Artificial Intelligence (AAAI), pp. 6022\u20136029 (2019)","DOI":"10.1609\/aaai.v33i01.33016022"},{"key":"467_CR5","doi-asserted-by":"crossref","unstructured":"Bankhamer, G., Berenbrink, P., Biermeier, F., Els\u00e4sser, R., Hosseinpour, H., Kaaser, D., Kling, P.: Fast consensus via the unconstrained undecided state dynamics. In: Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 3417\u20133429 (2022)","DOI":"10.1137\/1.9781611977073.135"},{"issue":"1","key":"467_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/3388392.3388403","volume":"51","author":"L Becchetti","year":"2020","unstructured":"Becchetti, L., Clementi, A.E.F., Natale, E.: Consensus dynamics: an overview. SIGACT News 51(1), 58\u2013104 (2020)","journal-title":"SIGACT News"},{"key":"467_CR7","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Clementi, A.E.F., Natale, E., Pasquale, F., Silvestri, R.: Plurality consensus in the gossip model. In: Proceedings of the 26th Symposium on Discrete Algorithms (SODA), pp. 371\u2013390 (2015)","DOI":"10.1137\/1.9781611973730.27"},{"issue":"4","key":"467_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00446-016-0289-4","volume":"30","author":"L Becchetti","year":"2017","unstructured":"Becchetti, L., Clementi, A.E.F., Natale, E., Pasquale, F., Silvestri, R., Trevisan, L.: Simple dynamics for plurality consensus. Distrib. Comput. 30(4), 293\u2013306 (2017)","journal-title":"Distrib. Comput."},{"key":"467_CR9","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Clementi, A.E.F., Els\u00e4sser, R., Kling, P., Mallmann-Trenn, F., Natale, E.: Ignore or comply?: on breaking symmetry in consensus. In: Proceedings of the Symposium on Principles of Distributed Computing (PODC), pp. 335\u2013344 (2017)","DOI":"10.1145\/3087801.3087817"},{"key":"467_CR10","unstructured":"Berenbrink, P., Friedetzky, T., Giakkoupis, G., Kling, P.: Efficient plurality consensus, or: the benefits of cleaning up from time to time. In: Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP), pp. 136:1\u2013136:14 (2016a)"},{"key":"467_CR11","unstructured":"Berenbrink, P., Giakkoupis, G., Kermarrec, A.-M., Mallmann-Trenn, F.: Bounds on the voter model in dynamic networks. In: Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP), pp. 146:1\u2013146:15 (2016b)"},{"key":"467_CR12","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, A., Braverman, M., Chazelle, B., Nguyen, H.L.: On the convergence of the Hegselmann\u2013Krause system. In: Kleinberg, R.D. (ed.), Proceedings of the Symposium on Innovations in Theoretical Computer Science (ITCS), pp. 61\u201366 (2013)","DOI":"10.1145\/2422436.2422446"},{"key":"467_CR13","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, A., Shiragur, K.: How friends and non-determinism affect opinion dynamics. In: Proceedings of the 54th IEEE Conference on Decision and Control (CDC). IEEE, pp. 6466\u20136471 (2015)","DOI":"10.1109\/CDC.2015.7403238"},{"key":"467_CR14","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Gollapudi, S., Munagala, K.: Coevolutionary opinion formation games. In: Proceedings of the Symposium on Theory of Computing (STOC), pp. 41\u201350 (2013)","DOI":"10.1145\/2488608.2488615"},{"key":"467_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2018.06.025","volume":"746","author":"V Bil\u00f2","year":"2018","unstructured":"Bil\u00f2, V., Fanelli, A., Moscardelli, L.: Opinion formation games with dynamic social influences. Theor. Comput. Sci. 746, 73\u201387 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"467_CR16","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.geb.2014.06.004","volume":"92","author":"D Bindel","year":"2015","unstructured":"Bindel, D., Kleinberg, J.M., Oren, S.: How bad is forming your own opinion? Games Econ. Behav. 92, 248\u2013265 (2015)","journal-title":"Games Econ. Behav."},{"key":"467_CR17","unstructured":"Botan, S., Grandi, U., Perrussel, L.: Multi-issue opinion diffusion under constraints. In: Proceedings of the 18th Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 828\u2013836 (2019)"},{"key":"467_CR18","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Elkind, E.: Manipulating opinion diffusion in social networks. In: Sierra, C. (ed.), Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp. 894\u2013900 (2017)","DOI":"10.24963\/ijcai.2017\/124"},{"key":"467_CR19","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Jacobs, L., Kellerhals, L.: Maximizing the spread of an opinion in few steps: opinion diffusion in non-binary networks. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1622\u20131628 (2020)","DOI":"10.24963\/ijcai.2020\/225"},{"issue":"4","key":"467_CR20","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1137\/100791671","volume":"49","author":"B Chazelle","year":"2011","unstructured":"Chazelle, B.: The total s-energy of a multiagent system. SIAM J. Control. Optim. 49(4), 1680\u20131706 (2011)","journal-title":"SIAM J. Control. Optim."},{"issue":"9","key":"467_CR21","doi-asserted-by":"publisher","first-page":"e2023301118","DOI":"10.1073\/pnas.2023301118","volume":"118","author":"M Cinelli","year":"2021","unstructured":"Cinelli, M., De Francisci Morales, G., Galeazzi, A., Quattrociocchi, W., Starnini, M.: The echo chamber effect on social media. Proc. Natl. Acad. Sci. 118(9), e2023301118 (2021)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"467_CR22","unstructured":"Clementi, A.E.F., Ghaffari, M., Gual\u00e0, L., Natale, E., Pasquale, F., Scornavacca, G.: A tight analysis of the parallel undecided-state dynamics with two colors. In: Proceedings of the 43rd ymposium on Mathematical Foundations of Computer Science (MFCS), pp. 28:1\u201328:15 (2018)"},{"key":"467_CR23","unstructured":"Coates, A., Han, L., Kleerekoper, A.: A unified framework for opinion dynamics. In: Proceedings of the 17th Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 1079\u20131086 (2018a)"},{"key":"467_CR24","unstructured":"Coates, A., Han, L., Kleerekoper, A.: A Unified opinion framework simulator. In: Proceedings of the 17th Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp. 1803\u20131805 (2018b)"},{"key":"467_CR25","doi-asserted-by":"crossref","unstructured":"Cooper, C., Els\u00e4sser, R., Ono, H., Radzik, T.: Coalescing random walks and voting on graphs. In: Proceedings of the Symposium on Principles of Distributed Computing (PODC), pp. 47\u201356 (2012)","DOI":"10.1145\/2332432.2332440"},{"key":"467_CR26","doi-asserted-by":"crossref","unstructured":"Cooper, C., Els\u00e4sser, R., Radzik, T.: The power of two choices in distributed voting. In: Proceedings of the 41st International Colloquium on Automata, languages and programming (ICALP), pp. 435\u2013446 (2014)","DOI":"10.1007\/978-3-662-43951-7_37"},{"key":"467_CR27","doi-asserted-by":"crossref","unstructured":"Cooper, C., Els\u00e4sser, R., Radzik, T., Rivera, N., Shiraga, T.: Fast consensus for voting on general expander graphs. In: Proceedings of the 29th Symposium on Distributed Computing (DISC), pp. 248\u2013262 (2015)","DOI":"10.1007\/978-3-662-48653-5_17"},{"key":"467_CR28","unstructured":"Cooper, C., Radzik, T., Rivera, N., Shiraga, T.: Fast plurality consensus in regular expanders. In: Proceedings of the 31st Symposium on Distributed Computing (DISC), pp. 13:1\u201313:16 (2017)"},{"key":"467_CR29","unstructured":"De, A., Bhattacharya, S., Ganguly, N.: Shaping opinion dynamics in social networks. In: Proceedings of the 17th Conference on Autonomous Agents and Multi-agent Systems (AAMAS), pp 1336\u20131344 (2018)"},{"issue":"345","key":"467_CR30","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1080\/01621459.1974.10480137","volume":"69","author":"MH DeGroot","year":"1974","unstructured":"DeGroot, M.H.: Reaching a consensus. J. Am. Stat. Assoc. 69(345), 118\u2013121 (1974)","journal-title":"J. Am. Stat. Assoc."},{"key":"467_CR31","volume-title":"An Economic Theory of Democracy","author":"A Downs","year":"1957","unstructured":"Downs, A.: An Economic Theory of Democracy. Harper & Row, New York (1957)"},{"issue":"7","key":"467_CR32","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s00224-018-9891-0","volume":"63","author":"M Epitropou","year":"2019","unstructured":"Epitropou, M., Fotakis, D., Hoefer, M., Skoulakis, S.: Opinion formation games with aggregation and negative influence. Theory Comput. Syst. 63(7), 1531\u20131553 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"7","key":"467_CR33","doi-asserted-by":"publisher","first-page":"1886","DOI":"10.1109\/TAC.2015.2394954","volume":"60","author":"SR Etesami","year":"2015","unstructured":"Etesami, S.R., Ba\u015far, T.: Game-theoretic analysis of the Hegselmann\u2013Krause model for opinion dynamics in finite dimensions. IEEE Trans. Autom. Control. 60(7), 1886\u20131897 (2015)","journal-title":"IEEE Trans. Autom. Control."},{"issue":"10","key":"467_CR34","doi-asserted-by":"publisher","first-page":"181122","DOI":"10.1098\/rsos.181122","volume":"5","author":"T Evans","year":"2018","unstructured":"Evans, T., Fu, F.: Opinion formation on dynamic networks: identifying conditions for the emergence of partisan echo chambers. R. Soc. Open Sci. 5(10), 181122 (2018)","journal-title":"R. Soc. Open Sci."},{"key":"467_CR35","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Gonen, R., Kouteck\u00fd, M., Talmon, N.: Opinion diffusion and campaigning on society graphs. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pp. 219\u2013225 (2018)","DOI":"10.24963\/ijcai.2018\/30"},{"issue":"02","key":"467_CR36","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1142\/S0129183105007078","volume":"16","author":"S Fortunato","year":"2005","unstructured":"Fortunato, S.: On the consensus threshold for the opinion dynamics of Krause\u2013Hegselmann. Int. J. Modern Phys. C 16(02), 259\u2013270 (2005)","journal-title":"Int. J. Modern Phys. C"},{"key":"467_CR37","unstructured":"Fotakis, D., Palyvos-Giannas, D., Skoulakis, S.: Opinion dynamics with local interactions. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pp. 279\u2013285 (2016)"},{"issue":"3\u20134","key":"467_CR38","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/0022250X.1990.9990069","volume":"15","author":"NE Friedkin","year":"1990","unstructured":"Friedkin, N.E., Johnsen, E.C.: Social influence and opinions. J. Math. Soc. 15(3\u20134), 193\u2013206 (1990)","journal-title":"J. Math. Soc."},{"issue":"1","key":"467_CR39","doi-asserted-by":"publisher","first-page":"016104","DOI":"10.1103\/PhysRevE.78.016104","volume":"78","author":"F Fu","year":"2008","unstructured":"Fu, F., Wang, L.: Coevolutionary dynamics of opinions and networks: from diversity to uniformity. Phys. Rev. E 78(1), 016104 (2008)","journal-title":"Phys. Rev. E"},{"key":"467_CR40","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Lengler, J.: Nearly-tight analysis for 2-choice and 3-majority consensus dynamics. In: Proceedings of the Symposium on Principles of Distributed Computing (PODC), pp. 305\u2013313 (2018)","DOI":"10.1145\/3212734.3212738"},{"key":"467_CR41","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Parter, M.: A polylogarithmic gossip algorithm for plurality consensus. In: Proceedings of the Symposium on Principles of Distributed Computing (PODC), pp. 117\u2013126 (2016)","DOI":"10.1145\/2933057.2933097"},{"issue":"2","key":"467_CR42","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/inco.2001.3088","volume":"171","author":"Y Hassin","year":"2001","unstructured":"Hassin, Y., Peleg, D.: Distributed probabilistic polling and applications to proportionate agreement. Inf. Comput. 171(2), 248\u2013268 (2001)","journal-title":"Inf. Comput."},{"key":"467_CR43","unstructured":"Hegselmann, R., Krause, U.: Opinion dynamics and bounded confidence models, analysis, and simulation. J. Artif. Soc. Soc. Simul. 5(3) (2002)"},{"key":"467_CR44","doi-asserted-by":"crossref","unstructured":"Lengler, J.: . Drift analysis. In: Doerr, B., Neumann, F. (eds.), Theory of Evolutionary Computation: Recent Developments in Discrete Optimization . Chapter\u00a02, pp. 89\u2013131 (2020)","DOI":"10.1007\/978-3-030-29414-4_2"},{"issue":"4","key":"467_CR45","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1080\/10236198.2015.1115486","volume":"22","author":"A Martinsson","year":"2016","unstructured":"Martinsson, A.: An improved energy argument for the Hegselmann\u2013Krause model. J. Differ. Eq. Appl. 22(4), 513\u2013518 (2016)","journal-title":"J. Differ. Eq. Appl."},{"issue":"1","key":"467_CR46","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Ann. Rev. Sociol. 27(1), 415\u2013444 (2001)","journal-title":"Ann. Rev. Sociol."},{"issue":"4","key":"467_CR47","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1002\/1097-0037(200007)35:4<266::AID-NET5>3.0.CO;2-4","volume":"35","author":"T Nakata","year":"2000","unstructured":"Nakata, T., Imahayashi, H., Yamashita, M.: A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. Networks 35(4), 266\u2013273 (2000)","journal-title":"Networks"},{"key":"467_CR48","unstructured":"Parasnis, R., Franceschetti, M., Touri, B.: On the convergence properties of social Hegselmann\u2013Krause dynamics. arXiv:1909.03485 [math.OC] (2019)"},{"key":"467_CR49","volume-title":"The Filter Bubble: What the Internet is Hiding From You","author":"E Pariser","year":"2011","unstructured":"Pariser, E.: The Filter Bubble: What the Internet is Hiding From You. Penguin, London (2011)"},{"key":"467_CR50","doi-asserted-by":"crossref","unstructured":"Touri, , Nedic, A: Discrete-time opinion dynamics. In: M.B. Matthews (Ed.), Conference Record of the 45th Asilomar Conference on Signals, Systems and Computers (ACSCC), pp. 1172\u20131176 (2011)","DOI":"10.1109\/ACSSC.2011.6190199"},{"issue":"2","key":"467_CR51","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s00454-014-9657-7","volume":"53","author":"E Wedin","year":"2015","unstructured":"Wedin, E., Hegarty, P.: A quadratic lower bound for the convergence rate in the one-dimensional Hegselmann\u2013Krause bounded confidence dynamics. Discret. Comput. Geom. 53(2), 478\u2013486 (2015)","journal-title":"Discret. Comput. Geom."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-024-00467-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-024-00467-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-024-00467-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T02:41:49Z","timestamp":1731811309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-024-00467-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,26]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["467"],"URL":"https:\/\/doi.org\/10.1007\/s00446-024-00467-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,26]]},"assertion":[{"value":"21 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors worked jointly on writing, reviewing, and polishing the manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Author contributions"}},{"value":"The source code for our simulator software and all necessary tools to reproduce the simulation results reported in Sect.\u00a0is available from our public GitHub repository ().","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data availability"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}