33 citations · 57 across the 12 of their papers we have counts for
Showing 2016 · cs.DMShow all
2 papers · 2 filters
cs.DM2016★ 7 cited
Fast plurality consensus in regular expanders
Colin Cooper, Tomasz Radzik, Nicolás Rivera +1
Pull voting is a classic method to reach consensus among vertices with differing opinions in a distributed network: each vertex at each step takes on the opinion of a random ne…
cs.DM2016★ 1 cited
Discordant voting processes on finite graphs
Colin Cooper, Martin Dyer, Alan Frieze +1
We consider an asynchronous voting process on graphs which we call discordant voting, and which can be described as follows. Initially each vertex holds one of two opinions, red or…