Best-of-Three Voting on Dense Graphs

MaRDI QIDQ6316052zbMATH OpenFDO

Authors Nan Kang, Nicolás Rivera

Publication date 22 March 2019

Abstract: Given a graph $G$ of $n$ vertices, where each vertex is initially attached an opinion of either red or blue. We investigate a random process known as the Best-of-three voting. In this process, at each time step, every vertex chooses three neighbours at random and adopts the majority colour. We study this process for a class of graphs with minimum degree $d=n^{alpha}$,, where $alpha=Omegaleft((loglogn{)}^{-1}ight)$. We prove that if initially each vertex is red with probability greater than $1/2+delta$, and blue otherwise, where $deltageq(logd{)}^{-C}$ for some $C>0$, then with high probability this dynamic reaches a final state where all vertices are red within $Oleft(loglognight)+Oleft(logleft(delt{a}^{-1}ight)ight)$ steps.

This page was built for publication: Best-of-Three Voting on Dense Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6316052)