Journal
PHYSICAL REVIEW E
Volume 90, Issue 1, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevE.90.012816
Keywords
-
Categories
Funding
- JST, CREST
- JST, ERATO, Kawarabayashi Large Graph Project
Ask authors/readers for more resources
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(N-3), where N is the number of nodes in the network.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available