Voter model on the two-clique graph

Naoki Masuda*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Citations (Scopus)


I examine the mean consensus time (i.e., exit time) of the voter model in the so-called two-clique graph. The two-clique graph is composed of two cliques interconnected by some links and considered as a toy model of networks with community structure or multilayer networks. I analytically show that, as the number of interclique links per node is varied, the mean consensus time experiences a crossover between a fast consensus regime [i.e., O(N)] and a slow consensus regime [i.e., O(N2)], where N is the number of nodes. The fast regime is consistent with the result for homogeneous well-mixed graphs such as the complete graph. The slow regime appears only when the entire network has O(1) interclique links. The present results suggest that the effect of community structure on the consensus time of the voter model is fairly limited.

Original languageEnglish
Article number012802
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Issue number1
Publication statusPublished - 2014 Jul 2
Externally publishedYes

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics


Dive into the research topics of 'Voter model on the two-clique graph'. Together they form a unique fingerprint.

Cite this