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 -