Networks maximizing the consensus time of voter models

Yuni Iwamasa; Naoki Masuda

doi:10.1103/PhysRevE.90.012816

Networks maximizing the consensus time of voter models

Yuni Iwamasa, Naoki Masuda

Research output: Contribution to journal › Article › peer-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 language	English
Article number	012816
Journal	Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume	90
Issue number	1
DOIs	https://doi.org/10.1103/PhysRevE.90.012816
Publication status	Published - 2014 Jul 30
Externally published	Yes

ASJC Scopus subject areas

Statistical and Nonlinear Physics
Statistics and Probability
Condensed Matter Physics

Access to Document

10.1103/PhysRevE.90.012816

Cite this

@article{4ade2edf94a944c895462a25abd06f8f,

title = "Networks maximizing the consensus time of voter models",

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.",

author = "Yuni Iwamasa and Naoki Masuda",

year = "2014",

month = jul,

day = "30",

doi = "10.1103/PhysRevE.90.012816",

language = "English",

volume = "90",

journal = "Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics",

issn = "1063-651X",

publisher = "American Physical Society",

number = "1",

}

TY - JOUR

T1 - Networks maximizing the consensus time of voter models

AU - Iwamasa, Yuni

AU - Masuda, Naoki

PY - 2014/7/30

Y1 - 2014/7/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84905457405&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84905457405&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.90.012816

DO - 10.1103/PhysRevE.90.012816

M3 - Article

C2 - 25122351

AN - SCOPUS:84905457405

VL - 90

JO - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

JF - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

SN - 1063-651X

IS - 1

M1 - 012816

ER -

Networks maximizing the consensus time of voter models

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this