Networks maximizing the consensus time of voter models

Yuni Iwamasa, Naoki Masuda

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

We explore the networks that yield the largest mean consensus time of voter models under different update rules. By analytical and numerical means, we show that the so-called lollipop graph, barbell graph, and double-star graph maximize the mean consensus time under the update rules called the link dynamics, voter model, and invasion process, respectively. For each update rule, the largest mean consensus time scales as O(N3), where N is the number of nodes in the network.

Original languageEnglish
Article number012816
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume90
Issue number1
DOIs
Publication statusPublished - 2014 Jul 30
Externally publishedYes

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics

Fingerprint

Dive into the research topics of 'Networks maximizing the consensus time of voter models'. Together they form a unique fingerprint.

Cite this