2 research outputs found

    Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models

    Get PDF
    This paper is concerned with voting processes on graphs where each vertex holds one of two different opinions. In particular, we study the \emph{Best-of-two} and the \emph{Best-of-three}. Here at each synchronous and discrete time step, each vertex updates its opinion to match the majority among the opinions of two random neighbors and itself (the Best-of-two) or the opinions of three random neighbors (the Best-of-three). Previous studies have explored these processes on complete graphs and expander graphs, but we understand significantly less about their properties on graphs with more complicated structures. In this paper, we study the Best-of-two and the Best-of-three on the stochastic block model G(2n,p,q)G(2n,p,q), which is a random graph consisting of two distinct Erd\H{o}s-R\'enyi graphs G(n,p)G(n,p) joined by random edges with density q≀pq\leq p. We obtain two main results. First, if p=ω(log⁥n/n)p=\omega(\log n/n) and r=q/pr=q/p is a constant, we show that there is a phase transition in rr with threshold r∗r^* (specifically, r∗=5−2r^*=\sqrt{5}-2 for the Best-of-two, and r∗=1/7r^*=1/7 for the Best-of-three). If r>r∗r>r^*, the process reaches consensus within O(log⁥log⁥n+log⁥n/log⁥(np))O(\log \log n+\log n/\log (np)) steps for any initial opinion configuration with a bias of Ω(n)\Omega(n). By contrast, if r<r∗r<r^*, then there exists an initial opinion configuration with a bias of Ω(n)\Omega(n) from which the process requires at least 2Ω(n)2^{\Omega(n)} steps to reach consensus. Second, if pp is a constant and r>r∗r>r^*, we show that, for any initial opinion configuration, the process reaches consensus within O(log⁥n)O(\log n) steps. To the best of our knowledge, this is the first result concerning multiple-choice voting for arbitrary initial opinion configurations on non-complete graphs

    Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions

    Get PDF
    International audienceIn several real \emph{Multi-Agent Systems} (MAS), it has been observed that only weaker forms of\emph{metastable consensus} are achieved, in which a large majority of agents agree on some opinion while other opinions continue to be supported by a (small) minority of agents. In this work, we take a step towards the investigation of metastable consensus for complex (non-linear) \emph{opinion dynamics} by considering the famous \undecided dynamics in the binary setting, which is known to reach consensus exponentially faster than the \voter dynamics. We propose a simple form of uniform noise in which each message can change to another one with probability pp and we prove that the persistence of a \emph{metastable consensus} undergoes a \emph{phase transition} for p=16p=\frac 16. In detail, below this threshold, we prove the system reaches with high probability a metastable regime where a large majority of agents keeps supporting the same opinion for polynomial time. Moreover, this opinion turns out to be the initial majority opinion, whenever the initial bias is slightly larger than its standard deviation.On the contrary, above the threshold, we show that the information about the initial majority opinion is ``lost'' within logarithmic time even when the initial bias is maximum.Interestingly, using a simple coupling argument, we show the equivalence between our noisy model above and the model where a subset of agents behave in a \emph{stubborn} way
    corecore