Skip to main navigation Skip to search Skip to main content

Majority dynamics on random graphs: the multiple states case

Research output: Contribution to journalArticlepeer-review

44 Downloads (Pure)

Abstract

We study the evolution of majority dynamics with more than two states on the binomial random graph G(n,p). In this process, each vertex has a state in {1,..., k}, with k ≥ 2, and at each round every vertex adopts state i if it has more neighbours in state i than in any other state. Ties are resolved randomly. We show that with high probability the process reaches unanimity in at most three rounds, if np>> n2/3.
Original languageEnglish
Article number104682
Number of pages40
JournalStochastic Processes and their Applications
Volume189
Early online date27 May 2025
DOIs
Publication statusPublished - Nov 2025

Keywords

  • Random graphs
  • majority dynamics
  • unanimity

Fingerprint

Dive into the research topics of 'Majority dynamics on random graphs: the multiple states case'. Together they form a unique fingerprint.

Cite this