Voter Model Meets Rumour Spreading: A Study of Consensus Protocols on Graphs with Agnostic Nodes [Extended Version]

Problems of consensus in multi-agent systems are often viewed as a series of independent, simultaneous local decisions made between a limited set of options, all aimed at reaching a global agreement.Key challenges in these protocols include estimating the likelihood of various outcomes and finding bounds for how long it may take to achieve consensus, if it occurs at all.To date, little attention has been given to the case where some agents have no initial opinion.In this paper, we introduce a variant of the consensus problem which includes what we call 'agnostic' nodes and frame it as a combination of two known and well-studied processes: voter model and rumour spreading.We show (1) a martingale that describes the probability of consensus for a given colour, (2) bounds on the number of steps for the process to end using results from rumour spreading and voter models, (3) closed formulas for the probability of consensus in a few special cases, and (4) that the computational complexity of estimating the probability with a Markov chain Monte Carlo process is ( 2 log ) for general graphs and ( log ) for Erds-Rnyi graphs, which makes it an efficient method for estimating probabilities of consensus.Furthermore, we present experimental results suggesting that the number of runs needed for a given standard error decreases when the number of nodes increases.