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

arXiv comment9 figures, 2 tables

References in corpus (13)

• Statistical physics of social dynamics
• Voter Model on Heterogeneous Graphs
• Voter Models on Heterogeneous Networks
• Voter model dynamics in complex networks: Role of dimensionality, disorder and degree distribution
• Incomplete ordering of the voter model on small-world networks
• Evolutionary dynamics on degree-heterogeneous graphs
• Conservation laws for the voter model in complex networks
• Analytical Solution of the Voter Model on Disordered Networks
• Comparison of voter and Glauber ordering dynamics on networks
• Solution of voter model dynamics on annealed small-world networks
• Evolutionary dynamics and fixation probabilities in directed networks
• Voter model on the two-clique graph
• Effect of network topology on the ordering dynamics of voter models

Cited by in corpus (6)

• Random walks and diffusion on networks
• First-passage distributions for the one-dimensional Fokker-Planck equation
• Biased-voter model: how persuasive a small group can be?
• Finite-size effects on the convergence time in continuous-opinion dynamics
• Maintaining diversity in structured populations
• Agent-based neutral competition in two-community networks