{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:55:56Z","timestamp":1742997356040,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031099922"},{"type":"electronic","value":"9783031099939"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09993-9_6","type":"book-chapter","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:12:42Z","timestamp":1656101562000},"page":"98-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Phase Transition of\u00a0the\u00a03-Majority Dynamics with\u00a0Uniform Communication Noise"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7498-0660","authenticated-orcid":false,"given":"Francesco","family":"d\u2019Amore","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1550-3677","authenticated-orcid":false,"given":"Isabella","family":"Ziccardi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,25]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.07.026","volume":"180","author":"MA Abdullah","year":"2015","unstructured":"Abdullah, M.A., Draief, M.: Global majority consensus by local majority polling on graphs of a given degree sequence. Discret. Appl. Math. 180, 1\u201310 (2015). https:\/\/doi.org\/10.1016\/j.dam.2014.07.026","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.1120.0570","volume":"38","author":"D Acemoglu","year":"2013","unstructured":"Acemoglu, D., Como, G., Fagnani, F., Ozdaglar, A.E.: Opinion fluctuations and disagreement in social networks. Math. Oper. Res. 38(1), 1\u201327 (2013). https:\/\/doi.org\/10.1287\/moor.1120.0570","journal-title":"Math. Oper. Res."},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Bankhamer, G., et al.: Fast consensus via the unconstrained undecided state dynamics. In: Naor, J.S., Buchbinder, N. (eds.) Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.135","DOI":"10.1137\/1.9781611977073.135"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Bassler, B.L.: Small talk: cell-to-cell communication in bacteria. Cell 109(4) (2002). https:\/\/doi.org\/10.1016\/S0092-8674(02)00749-3","DOI":"10.1016\/S0092-8674(02)00749-3"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.neucom.2015.05.116","volume":"172","author":"L Bayindir","year":"2016","unstructured":"Bayindir, L.: A review of swarm robotics tasks. Neurocomputing 172, 292\u2013321 (2016). https:\/\/doi.org\/10.1016\/j.neucom.2015.05.116","journal-title":"Neurocomputing"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Becchetti, L., Clementi, A.E.F., Natale, E.: Consensus dynamics: an overview. SIGACT News 51(1) (2020). https:\/\/doi.org\/10.1145\/3388392.3388403","DOI":"10.1145\/3388392.3388403"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00446-016-0289-4","volume":"30","author":"L Becchetti","year":"2016","unstructured":"Becchetti, L., Clementi, A., Natale, E., Pasquale, F., Silvestri, R., Trevisan, L.: Simple dynamics for plurality consensus. Distrib. Comput. 30(4), 293\u2013306 (2016). https:\/\/doi.org\/10.1007\/s00446-016-0289-4","journal-title":"Distrib. Comput."},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Becchetti, L., Clementi, A.E.F., Natale, E., Pasquale, F., Trevisan, L.: Stabilizing consensus with many opinions. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 620\u2013635. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch46","DOI":"10.1137\/1.9781611974331.ch46"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.adhoc.2012.05.001","volume":"12","author":"O Ben-Shahar","year":"2014","unstructured":"Ben-Shahar, O., Dolev, S., Dolgin, A., Segal, M.: Direction election in flocking swarms. Ad Hoc Netw. 12, 250\u2013258 (2014). https:\/\/doi.org\/10.1016\/j.adhoc.2012.05.001","journal-title":"Ad Hoc Netw."},{"key":"6_CR10","doi-asserted-by":"publisher","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: Schiller, E.M., Schwarzmann, A.A. (eds.) Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC. ACM (2017). https:\/\/doi.org\/10.1145\/3087801.3087817","DOI":"10.1145\/3087801.3087817"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s00446-018-0330-x","volume":"32","author":"L Boczkowski","year":"2018","unstructured":"Boczkowski, L., Korman, A., Natale, E.: Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits. Distrib. Comput. 32(3), 173\u2013191 (2018). https:\/\/doi.org\/10.1007\/s00446-018-0330-x","journal-title":"Distrib. Comput."},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Carroll, M.C.: The complement system in regulation of adaptive immunity. Nat. Immunol. 5, 981\u2013986 (2004). https:\/\/doi.org\/10.1038\/ni1113","DOI":"10.1038\/ni1113"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Chaouiya, C., Ourrad, O., Lima, R.: Majority rules with random tie-breaking in Boolean gene regulatory networks. PLOS ONE 8(7), 1\u201314 (2013). https:\/\/doi.org\/10.1371\/journal.pone.0069626","DOI":"10.1371\/journal.pone.0069626"},{"key":"6_CR14","doi-asserted-by":"publisher","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: Potapov, I., Spirakis, P.G., Worrell, J. (eds.) 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, UK. LIPIcs, vol. 117, pp. 28:1\u201328:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.28","DOI":"10.4230\/LIPIcs.MFCS.2018.28"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s11047-019-09756-4","volume":"19","author":"A Condon","year":"2019","unstructured":"Condon, A., Hajiaghayi, M., Kirkpatrick, D., Ma\u0148uch, J.: Approximate majority analyses using tri-molecular chemical reaction networks. Nat. Comput. 19(1), 249\u2013270 (2019). https:\/\/doi.org\/10.1007\/s11047-019-09756-4","journal-title":"Nat. Comput."},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Cruciani, E., Mimun, H.A., Quattropani, M., Rizzo, S.: Phase transitions of the k-majority dynamics in a biased communication model. In: ICDCN 2021: International Conference on Distributed Computing and Networking. ACM (2021). https:\/\/doi.org\/10.1145\/3427796.3427811","DOI":"10.1145\/3427796.3427811"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-54921-3_15","volume-title":"Structural Information and Communication Complexity","author":"F d\u2019Amore","year":"2020","unstructured":"d\u2019Amore, F., Clementi, A., Natale, E.: Phase transition of a non-linear opinion dynamics with noisy interactions. In: Richa, A.W., Scheideler, C. (eds.) SIROCCO 2020. LNCS, vol. 12156, pp. 255\u2013272. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54921-3_15"},{"key":"6_CR18","unstructured":"D\u2019Amore, F., Ziccardi, I.: Phase transition of the 3-majority dynamics with uniform communication noise. CoRR (2021). https:\/\/arxiv.org\/abs\/2112.03543"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-14165-2_19","volume-title":"Automata, Languages and Programming","author":"M Dietzfelbinger","year":"2010","unstructured":"Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R., Rink, M.: Tight thresholds for cuckoo hashing via XORSAT. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 213\u2013225. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_19"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Doerr, B., Goldberg, L.A., Minder, L., Sauerwald, T., Scheideler, C.: Stabilizing consensus with the power of two choices. In: Rajaraman, R., auf der Heide, F.M. (eds.) SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM (2011). https:\/\/doi.org\/10.1145\/1989493.1989516","DOI":"10.1145\/1989493.1989516"},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.mbs.2010.08.002","volume":"228","author":"J Dong","year":"2010","unstructured":"Dong, J., Fern\u00e1ndez-Baca, D., McMorris, F., Powers, R.C.: Majority-rule (+) consensus trees. Math. Biosci. 228(1), 10\u201315 (2010). https:\/\/doi.org\/10.1016\/j.mbs.2010.08.002","journal-title":"Math. Biosci."},{"key":"6_CR22","unstructured":"Emanuele Natale: On the Computational Power of Simple Dynamics. Ph.D. Thesis, Sapienza University of Rome (2017)"},{"issue":"5","key":"6_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s00446-015-0249-4","volume":"30","author":"O Feinerman","year":"2015","unstructured":"Feinerman, O., Haeupler, B., Korman, A.: Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. Distrib. Comput. 30(5), 339\u2013355 (2015). https:\/\/doi.org\/10.1007\/s00446-015-0249-4","journal-title":"Distrib. Comput."},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00446-018-0335-5","volume":"32","author":"P Fraigniaud","year":"2018","unstructured":"Fraigniaud, P., Natale, E.: Noisy rumor spreading and plurality consensus. Distrib. Comput. 32(4), 257\u2013276 (2018). https:\/\/doi.org\/10.1007\/s00446-018-0335-5","journal-title":"Distrib. Comput."},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Franks, N., Pratt, S., Mallon, E., Britton, N., Sumpter, D.: Information flow, opinion polling and collective intelligence in house-hunting social insects. Philos. Trans. Roy. Soc. Lond. Ser. B Biol. Sci. 357, 1567\u201383 (2002). https:\/\/doi.org\/10.1098\/rstb.2002.1066","DOI":"10.1098\/rstb.2002.1066"},{"key":"6_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687","author":"AE Gamal","year":"2011","unstructured":"Gamal, A.E., Kim, Y.: Cambridge University Press. Network Information Theory (2011). https:\/\/doi.org\/10.1017\/CBO9781139030687","journal-title":"Network Information Theory"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Lengler, J.: Nearly-tight analysis for 2-choice and 3-majority consensus dynamics. In: Newport, C., Keidar, I. (eds.) Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018. ACM (2018). https:\/\/dl.acm.org\/citation.cfm?id=3212738","DOI":"10.1145\/3212734.3212738"},{"issue":"2","key":"6_CR28","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":"6_CR29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449","author":"R Koetter","year":"2008","unstructured":"Koetter, R., Kschischang, F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory (2008). https:\/\/doi.org\/10.1109\/TIT.2008.926449","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-319-13075-0_54","volume-title":"Algorithms and Computation","author":"PK Lehre","year":"2014","unstructured":"Lehre, P.K., Witt, C.: Concentrated hitting times of randomized search heuristics with variable drift. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 686\u2013697. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_54"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Lin, W., Zhixin, L., Lei, G.: Robust consensus of multi-agent systems with noise. In: 2007 Chinese Control Conference (2007). https:\/\/doi.org\/10.1109\/CHICC.2006.4347503","DOI":"10.1109\/CHICC.2006.4347503"},{"issue":"08","key":"6_CR32","doi-asserted-by":"publisher","first-page":"P08029","DOI":"10.1088\/1742-5468\/2007\/08\/P08029","volume":"2007","author":"M Mobilia","year":"2007","unstructured":"Mobilia, M., Petersen, A., Redner, S.: On the role of zealotry in the voter model. J. Stat. Mech. Theory Exp. 2007(08), P08029 (2007)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Mobilia, M.: Does a single zealot affect an infinite group of voters? Phys. Rev. Lett. 91(2), 028701 (2003)","DOI":"10.1103\/PhysRevLett.91.028701"},{"key":"6_CR34","doi-asserted-by":"publisher","DOI":"10.1002\/0471739219","volume-title":"Error Correction Coding: Mathematical Methods and Algorithms","author":"TK Moon","year":"2005","unstructured":"Moon, T.K.: Error Correction Coding: Mathematical Methods and Algorithms. Wiley, New York (2005)"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Mossel, E., Neeman, J., Tamuz, O.: Majority dynamics and aggregation of information in social networks. Auton. Agents Multi-agent Syst. 28(3), 408\u2013429 (2013). https:\/\/doi.org\/10.1007\/s10458-013-9230-4","DOI":"10.1007\/s10458-013-9230-4"},{"key":"6_CR36","doi-asserted-by":"publisher","unstructured":"Reina, A., Marshall, J.A.R., Trianni, V., Bose, T.: Model of the best-of-$$n$$ nest-site selection process in honeybees. Phys. Rev. E 95 (2017). https:\/\/doi.org\/10.1103\/PhysRevE.95.052411","DOI":"10.1103\/PhysRevE.95.052411"},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Ruan, Y., Mostofi, Y.: Binary consensus with soft information processing in cooperative networks. In: Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008. IEEE (2008). https:\/\/doi.org\/10.1109\/CDC.2008.4738899","DOI":"10.1109\/CDC.2008.4738899"},{"issue":"22","key":"6_CR38","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1016\/j.cub.2008.09.064","volume":"18","author":"DJ Sumpter","year":"2008","unstructured":"Sumpter, D.J., Krause, J., James, R., Couzin, I.D., Ward, A.J.: Consensus decision making by fish. Curr. Biol. 18(22), 1773\u20131777 (2008). https:\/\/doi.org\/10.1016\/j.cub.2008.09.064","journal-title":"Curr. Biol."},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3389\/frobt.2017.00009","volume":"4","author":"G Valentini","year":"2017","unstructured":"Valentini, G., Ferrante, E., Dorigo, M.: The best-of-n problem in robot swarms: formalization, state of the art, and novel perspectives. Front. Robot. AI 4, 9 (2017). https:\/\/doi.org\/10.3389\/frobt.2017.00009","journal-title":"Front. Robot. AI"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1103\/PhysRevLett.75.1226","volume":"75","author":"T Vicsek","year":"1995","unstructured":"Vicsek, T., Czir\u00f3k, A., Ben-Jacob, E., Cohen, I., Shochet, O.: Novel type of phase transition in a system of self-driven particles. Phys. Rev. Lett. 75, 1226\u20131229 (1995). https:\/\/doi.org\/10.1103\/PhysRevLett.75.1226","journal-title":"Phys. Rev. Lett."},{"key":"6_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-009-0082-0","author":"L Wang","year":"2009","unstructured":"Wang, L., Liu, Z.: Robust consensus of multi-agent systems with noise. Sci. China Ser. F Inf. Sci. (2009). https:\/\/doi.org\/10.1007\/s11432-009-0082-0","journal-title":"Sci. China Ser. F Inf. Sci."},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Yildiz, E., Ozdaglar, A., Acemoglu, D., Saberi, A., Scaglione, A.: Binary Opinion Dynamics with Stubborn Agents. ACM Trans. Econ. Comput. 1(4) (2013)","DOI":"10.1145\/2538508"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09993-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T20:13:42Z","timestamp":1656101622000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09993-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031099922","9783031099939"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09993-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2022.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}