{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article17570","name":"Resilience of 3-Majority Dynamics to Non-Uniform Schedulers","abstract":"In recent years there has been great interest in networks of passive, computationally-weak nodes, whose interactions are controlled by the outside environment; examples include population protocols, chemical reactions networks (CRNs), DNA computing, and more. Such networks are usually studied under one of two extreme regimes: the schedule of interactions is either assumed to be adversarial, or it is assumed to be chosen uniformly at random. In this paper we study an intermediate regime, where the interaction at each step is chosen from some not-necessarily-uniform distribution: we introduce the definition of a (p,\u03b5)-scheduler, where the distribution that the scheduler chooses at every round can be arbitrary, but it must have \ud835\udcc1_p-distance at most \u03b5 from the uniform distribution. We ask how far from uniform we can get before the dynamics of the model break down.\r\nFor simplicity, we focus on the 3-majority dynamics, a type of chemical reaction network where the nodes of the network interact in triplets. Each node initially has an opinion of either \ud835\uddb7 or \ud835\uddb8, and when a triplet of nodes interact, all three nodes change their opinion to the majority of their three opinions. It is known that under a uniformly random scheduler, if we have an initial gap of \u03a9(\u221a{n log n}) in favor of one value, then w.h.p. all nodes converge to the majority value within O(n log n) steps.\r\nFor the 3-majority dynamics, we prove that among all non-uniform schedulers with a given \ud835\udcc1_1- or \ud835\udcc1_\u221e-distance to the uniform scheduler, the worst case is a scheduler that creates a partition in the network, disconnecting some nodes from the rest: under any (p,\u03b5)-close scheduler, if the scheduler\u2019s distance from uniform only suffices to disconnect a set of size at most S nodes and we start from a configuration with a gap of \u03a9(S+\u221a{n log n}) in favor of one value, then we are guaranteed that all but O(S) nodes will convert to the majority value. We also show that creating a partition is not necessary to cause the system to converge to the wrong value, or to fail to converge at all. We believe that our work can serve as a first step towards understanding the resilience of chemical reaction networks and population protocols under non-uniform schedulers.","keywords":["chemical reaction networks","population protocols","randomized scheduler"],"author":[{"@type":"Person","name":"Meir, Uri","givenName":"Uri","familyName":"Meir","email":"mailto:uri.meir.1990@gmail.com","affiliation":"Blavatnik School of Computer Science, Tel Aviv University, Israel"},{"@type":"Person","name":"Oshman, Rotem","givenName":"Rotem","familyName":"Oshman","email":"mailto:roshman@tau.ac.il","affiliation":"Blavatnik School of Computer Science, Tel Aviv University, Israel","funding":"Research funded by the Israel Science Foundation, Grant No. 2801\/20, and also supported by Len Blavatnik and the Blavatnik Family foundation."},{"@type":"Person","name":"Shayevitz, Ofer","givenName":"Ofer","familyName":"Shayevitz","email":"mailto:ofersha@tauex.tau.ac.il","affiliation":"School of Electrical Engineering, Tel Aviv University, Israel","funding":"Research funded by the Israel Science Foundation, Grant No. 1766\/22 and 1495\/18."},{"@type":"Person","name":"Volkov, Yuval","givenName":"Yuval","familyName":"Volkov","email":"mailto:yuvalvo100@gmail.com","affiliation":"School of Electrical Engineering, Tel Aviv University, Israel"}],"position":86,"pageStart":"86:1","pageEnd":"86:19","dateCreated":"2023-02-01","datePublished":"2023-02-01","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Meir, Uri","givenName":"Uri","familyName":"Meir","email":"mailto:uri.meir.1990@gmail.com","affiliation":"Blavatnik School of Computer Science, Tel Aviv University, Israel"},{"@type":"Person","name":"Oshman, Rotem","givenName":"Rotem","familyName":"Oshman","email":"mailto:roshman@tau.ac.il","affiliation":"Blavatnik School of Computer Science, Tel Aviv University, Israel","funding":"Research funded by the Israel Science Foundation, Grant No. 2801\/20, and also supported by Len Blavatnik and the Blavatnik Family foundation."},{"@type":"Person","name":"Shayevitz, Ofer","givenName":"Ofer","familyName":"Shayevitz","email":"mailto:ofersha@tauex.tau.ac.il","affiliation":"School of Electrical Engineering, Tel Aviv University, Israel","funding":"Research funded by the Israel Science Foundation, Grant No. 1766\/22 and 1495\/18."},{"@type":"Person","name":"Volkov, Yuval","givenName":"Yuval","familyName":"Volkov","email":"mailto:yuvalvo100@gmail.com","affiliation":"School of Electrical Engineering, Tel Aviv University, Israel"}],"copyrightYear":"2023","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2023.86","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6454","volumeNumber":251,"name":"14th Innovations in Theoretical Computer Science Conference (ITCS 2023)","dateCreated":"2023-02-01","datePublished":"2023-02-01","editor":{"@type":"Person","name":"Tauman Kalai, Yael","givenName":"Yael","familyName":"Tauman Kalai","email":"mailto:yaelism@gmail.com","affiliation":"Microsoft Research New England, Cambridge, USA"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article17570","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6454"}}}