Berenbrink, PetraPetraBerenbrinkBiermeier, FelixFelixBiermeierHahn, ChristopherChristopherHahnKaaser, DominikDominikKaaser2023-04-052023-04-052022-041st Symposium on Algorithmic Foundations of Dynamic Networks : SAND 2022, March 28-30, 2022, virtual conference. - (Leibniz International Proceedings in Informatics, LIPIcs ; vol. 221). - Art. no. 7 - (2022)http://hdl.handle.net/11420/15130We present a loosely-stabilizing phase clock for population protocols. In the population model we are given a system of n identical agents which interact in a sequence of randomly chosen pairs. Our phase clock is leaderless and it requires O(log n) states. It runs forever and is, at any point of time, in a synchronous state w.h.p. When started in an arbitrary configuration, it recovers rapidly and enters a synchronous configuration within O(n log n) interactions w.h.p. Once the clock is synchronized, it stays in a synchronous configuration for at least poly(n) parallel time w.h.p. We use our clock to design a loosely-stabilizing protocol that solves the adaptive variant of the majority problem. We assume that the agents have either opinion A or B or they are undecided and agents can change their opinion at a rate of 1/n. The goal is to keep track which of the two opinions is (momentarily) the majority. We show that if the majority has a support of at least Ω(log n) agents and a sufficiently large bias is present, then the protocol converges to a correct output within O(n log n) interactions and stays in a correct configuration for poly(n) interactions, w.h.p.enAdaptiveClock SynchronizationLoose Self-stabilizationMajorityPhase ClocksPopulation ProtocolsInformatikConference Paper10.4230/LIPIcs.SAND.2022.710.48550/arXiv.2106.13002978-3-95977-224-2Other