Probabilistic consensus via polling and majority rules

DOI10.1007/s11134-014-9397-7zbMath1321.60197arXiv1311.4805OpenAlexW1981563978MaRDI QIDQ475128

J. Herrera, Sumit K. Garg

Publication date: 25 November 2014

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.4805

zbMATH Keywords

Markov chainsdistributed systemsvoter modeldecentralised algorithmsmajority rulesprobabilistic consensus

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Distributed systems (68M14) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (7)

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols ⋮ On convergence and threshold properties of discrete Lotka-Volterra population protocols ⋮ Voter and majority dynamics with biased and stubborn agents ⋮ Diffusion of binary opinions in a growing population with heterogeneous behaviour and external influence ⋮ Approximate majority analyses using tri-molecular chemical reaction networks ⋮ Global majority consensus by local majority polling on graphs of a given degree sequence ⋮ Majority dynamics and the median process: connections, convergence and some new conjectures

Cites Work

• Unnamed Item
• Global majority consensus by local majority polling on graphs of a given degree sequence
• Majority dynamics on trees and the dynamic cavity method
• Distributed probabilistic polling and applications to proportionate agreement
• Quantized consensus
• Convergence Speed of Binary Interval Consensus
• An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs
• Finite particle systems and infection models
• Fast Distributed Algorithms for Computing Separable Functions
• Convergence Speed in Distributed Consensus and Averaging
• Distributed Anonymous Discrete Function Computation
• Coalescing Random Walks and Voting on Connected Graphs

This page was built for publication: Probabilistic consensus via polling and majority rules