Networks maximizing the consensus time of voter models

Yuni Iwamasa, Naoki Masuda

研究成果: Article査読

4 被引用数 (Scopus)

抄録

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.

本文言語English
論文番号012816
ジャーナルPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
90
1
DOI
出版ステータスPublished - 2014 7 30
外部発表はい

ASJC Scopus subject areas

  • 統計物理学および非線形物理学
  • 統計学および確率
  • 凝縮系物理学

フィンガープリント

「Networks maximizing the consensus time of voter models」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル