Abstract

We study the voter model on heterogeneous graphs. We exploit the nonconservation of the magnetization to characterize how consensus is reached. For a network of N nodes with an arbitrary but uncorrelated degree distribution, the mean time to reach consensus TN scales as Nμ12/μ2, where μk is the kth moment of the degree distribution. For a power-law degree distribution nk∼k-ν, TN thus scales as N for ν>3, as N/ln⁡N for ν=3, as N(2ν-4)/(ν-1) for 2<ν<3, as (ln⁡N)2 for ν=2, and as O(1) for ν<2. These results agree with simulation data for networks with both uncorrelated and correlated node degrees.

Links and resources

Tags

community