The term distributed system typically refers to a set of entities, called nodes, connected by
point-topoint communication links. The set of nodes together with the set of links form a …

We consider the following distributed consensus problem: Each node in a complete
communication network of size n initially holds an opinion, which is chosen arbitrarily from a …

A family of leaderless, decentralized consensus protocols, called Snow consensus was
introduced in a recent whitepaper by Yin et al. These protocols address limitations of …

Abstract We study Plurality Consensus in the Model over a network of n anonymous agents.
Each agent supports an initial opinion or color. We assume that at the onset, the number of …

Consider n anonymous nodes each initially supporting an opinion in {1, 2,…, k} and
suppose that they should all learn the opinion with the largest support. Per round, each node …

We present improved analyses for two of the well-studied randomized dynamics of
stabilizing consensus, namely 2-choice and 3-majority. The resulting bounds are tight up to …

Consider a graph where each of the n nodes is in one of two possible states, say or. Herein,
we analyze the synchronous k-majoritydynamics, where nodes sample k neighbors …

We consider the allocation of m balls (jobs) into n bins (servers). In the standard Two-Choice
process, at each step t= 1, 2,..., m we first sample two randomly chosen bins, compare their …

Pull voting is a classic method to reach consensus among $ n $ vertices with differing
opinions in a distributed network: each vertex at each step takes on the opinion of a random …

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 …