Voter model on heterogeneous graphs.

By Vishal Sood, Sidney Redner. Physical Review Letters, 2004

606 citations recorded by the source corpus.

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 T(N) scales as Nmu(2)1/mu(2), where mu(k) is the kth moment of the degree distribution. For a power-law degree distribution n(k) approximately k(-nu), T(N) thus scales as N for nu > 3, as N/ln(N for nu = 3, as N((2nu-4)/(nu-1)) for 2 < nu < 3, as (lnN)2 for nu = 2, and as omicron(1) for nu < 2. These results agree with simulation data for networks with both uncorrelated and correlated node degrees.

Subfields: Political Science and International Relations, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/803b8d89be73886b59e5aa44395e8081002bb1ea

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Political Science and International Relations

  1. Alessandro Vespignani
  2. Daron Acemoglu
  3. Elias Papaioannou
  4. James A. Robinson
  5. T. Dunning
  6. E. Stam
  7. K. Morrison
  8. Gregorios Siourounis

In Statistical and Nonlinear Physics

  1. Mark Newman
  2. Tao Zhou
  3. Linyuan Lu
  4. José Fernando Ferreira Mendes
  5. Sergey N. Dorogovtsev
  6. Alexander V. Goltsev
  7. Alessandro Vespignani
  8. Yi-Cheng Zhang

Citations in the corpus