Consensus dynamics: An overview

L Becchetti, A Clementi, E Natale - ACM SIGACT News, 2020 - dl.acm.org
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 …

[PDF][PDF] The coordicide

S Popov, H Moog, D Camargo, A Capossele… - Accessed Jan, 2020 - files.iota.org
IOTA's vision aims to establish a real-time economy for Internet-of-Things and the future
Internet through a secure zero fee payment and data transmission system. Realizing this …

Fpc-bi: Fast probabilistic consensus within byzantine infrastructures

S Popov, WJ Buchanan - Journal of Parallel and Distributed Computing, 2021 - Elsevier
This paper presents a novel leaderless protocol (FPC-BI: Fast Probabilistic Consensus
within Byzantine Infrastructures) with a low communicational complexity and which allows a …

On coalescence time in graphs: When is coalescing as fast as meeting?

V Kanade, F Mallmann-Trenn… - ACM Transactions on …, 2023 - dl.acm.org
Coalescing random walks is a fundamental distributed process, where a set of particles
perform independent discrete-time random walks on an undirected graph. Whenever two or …

Phase transitions of the k-majority dynamics in a biased communication model

E Cruciani, HA Mimun, M Quattropani… - Proceedings of the 22nd …, 2021 - dl.acm.org
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 …

Asynchronous opinion dynamics in social networks

P Berenbrink, M Hoefer, D Kaaser, P Lenzner… - Distributed …, 2024 - Springer
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 …

Bounds on the voter model in dynamic networks

P Berenbrink, G Giakkoupis, AM Kermarrec… - arXiv preprint arXiv …, 2016 - arxiv.org
In the voter model, each node of a graph has an opinion, and in every round each node
chooses independently a random neighbour and adopts its opinion. We are interested in the …

Fast plurality consensus in regular expanders

C Cooper, T Radzik, N Rivera, T Shiraga - arXiv preprint arXiv:1605.08403, 2016 - arxiv.org
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 …

Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits

L Boczkowski, A Korman, E Natale - Proceedings of the Twenty-Eighth Annual …, 2017 - SIAM
This paper considers the basic PULL model of communication, in which in each round, each
agent extracts information from few randomly chosen agents. We seek to identify the …

Fast convergence of k-opinion undecided state dynamics in the population protocol model

T Amir, J Aspnes, P Berenbrink, F Biermeier… - Proceedings of the …, 2023 - dl.acm.org
We analyze the convergence of the k-opinion Undecided State Dynamics (USD) in the
population protocol model. For k= 2 opinions it is well known that the USD reaches …