Mean Consensus Time of the Voter Model on Networks Partitioned into Two Cliques of Arbitrary Sizes

Abstract

The voter model is a paradigmatic agent-based model that represents opinion dynamics in social networks. While early studies of the voter model focused on complete graphs or regular lattices, interest has recently shifted towards networks with more complex topologies (e.g. networks with a community structure). Here we analyze the voter model on the simplest possible multi-community network: two cliques (i.e. fully connected subgraphs) connected by a small number of intercommunity edges.