Distributed probabilistic polling and applications to proportionate agreement

DOI10.1006/inco.2001.3088zbMath1005.68018MaRDI QIDQ1854483

David Peleg, Yehuda Hassin

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.3088

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68M14: Distributed systems

68W15: Distributed algorithms

Related Items

Probabilistic consensus via polling and majority rules, Global majority consensus by local majority polling on graphs of a given degree sequence, Irreversible conversion of graphs, Reversible iterative graph processes, On the expected time for Herman's probabilistic self-stabilizing algorithm, Near-optimal solutions for the generalized max-controlled set problem, Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion, Local majorities, coalitions and monopolies in graphs: A review, Distributed probabilistic polling and applications to proportionate agreement, Computer science and decision theory

Cites Work

• Local stabilizer
• A guided tour of Chernoff bounds
• Decreasing energy functions as a tool for studying threshold networks
• Periodic behaviour of generalized threshold functions
• Ergodic theorems for weakly interacting infinite systems and the voter model
• Distributed probabilistic polling and applications to proportionate agreement
• On periodical behaviour in societies with symmetric influences
• Finite particle systems and infection models
• A survey of gossiping and broadcasting in communication networks
• The Byzantine Generals Problem
• Reaching a Consensus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item