Bankhamer, GregorGregorBankhamerElsässer, RobertRobertElsässerKaaser, DominikDominikKaaserKrnc, MatjažMatjažKrnc2023-04-052023-04-052018PODC ’20 : Proceedings of the 39th Symposium on Principles of Distributed Computing : August 3-7, 2020, Virtual Event, Online. - 385-394 (2018)http://hdl.handle.net/11420/15138We study distributed plurality consensus among n nodes, each of which initially holds one of k opinions. The goal is to eventually agree on the initially dominant opinion. We consider an asynchronous communication model in which each node is equipped with a random clock. Whenever the clock of a node ticks, it may open communication channels to a constant number of other nodes, chosen uniformly at random or from a list of constantly many addresses acquired in previous steps. The tick rates and the delays for establishing communication channels (channel delays) follow some probability distribution. Once a channel is established, communication between nodes can be performed instantaneously.enasynchronicityplurality consensuspositive agingpólya-eggenberger distributionstail boundsComputer Science - Distributed; Parallel; and Cluster ComputingComputer Science - Distributed; Parallel; and Cluster ComputingInformatikConference Paper10.1145/3382734.34065061806.02596v2Other