Listen to Your Neighbors: How (Not) to Reach a Consensus
From MaRDI portal
Publication:4652613
DOI10.1137/S0895480102408213zbMath1101.68731MaRDI QIDQ4652613
Nabil H. Mustafa, Aleksandar Saša Pekeč
Publication date: 28 February 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Network protocols (68M12)
Related Items
Local event boundary detection with unreliable sensors: analysis of the majority vote scheme ⋮ Modeling the spread of fault in majority-based network systems: dynamic monopolies in triangular grids ⋮ Irreversible conversion processes with deadlines ⋮ A computational study of \(f\)-reversible processes on graphs ⋮ Reversible iterative graph processes ⋮ Irreversible conversion of graphs ⋮ Opinion forming in Erdős-Rényi random graph and expanders ⋮ Opinion Forming in Erdös-Rényi Random Graph and Expanders ⋮ An inclusion hierarchy of irreversible dynamos