The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Voter Model on Heterogeneous Graphs
Open accessAbstract
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 $N{\ensuremath{\mu}}_{1}^{2}/{\ensuremath{\mu}}_{2}$, where ${\ensuremath{\mu}}_{k}$ is the $k$th moment of the degree distribution. For a power-law degree distribution ${n}_{k}\ensuremath{\sim}{k}^{\ensuremath{-}\ensuremath{\nu}}$, ${T}_{N}$ thus scales as $N$ for $\ensuremath{\nu}>3$, as $N/\mathrm{ln}N$ for $\ensuremath{\nu}=3$, as ${N}^{(2\ensuremath{\nu}\ensuremath{-}4)/(\ensuremath{\nu}\ensuremath{-}1)}$ for $2<\ensuremath{\nu}<3$, as $(\mathrm{ln}N{)}^{2}$ for $\ensuremath{\nu}=2$, and as $\mathcal{O}(1)$ for $\ensuremath{\nu}<2$. These results agree with simulation data for networks with both uncorrelated and correlated node degrees.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Stochastic Processes in Physics and Chemistry
(2007) · Elsevier eBooks · doi:10.1016/b978-0-444-52965-7.x5000-4 · Cited by 8,692
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
A Guide to First-Passage Processes
Redner, S. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511606014 · Cited by 2,346
Self-citationStochastic Interacting Systems: Contact, Voter and Exclusion Processes
Liggett, T. M. (1999) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-03990-8 · Cited by 1,554
A Guide to First-Passage Processes
Redner, S., & Dorfman, J. R. (2002) · American Journal of Physics · doi:10.1119/1.1509421 · Cited by 1,530
Self-citationRandom Walks on Complex Networks
Noh, J. D., & Rieger, H. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.118701 · Cited by 1,148
Stochastic Processes in Physics and Chemistry
Van Kampen, N. G., & Reinhardt, W. P. (1983) · Physics Today · doi:10.1063/1.2915501 · Cited by 1,111
Organization of growing random networks
Krapivsky, P. L., & Redner, S. (2001) · Physical Review E · doi:10.1103/physreve.63.066123 · Cited by 871
Self-citationIsing model on networks with an arbitrary distribution of connections
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2002) · Physical Review E · doi:10.1103/physreve.66.016104 · Cited by 382
Incomplete ordering of the voter model on small-world networks
Castellano, C., Vilone, D., & Vespignani, A. (2003) · Europhysics Letters (EPL) · doi:10.1209/epl/i2003-00490-0 · Cited by 249
Kinetics of monomer-monomer surface catalytic reactions
Krapivsky, P. L. (1992) · Physical Review A · doi:10.1103/physreva.45.1067 · Cited by 221
Exact solution of site and bond percolation on small-world networks
Moore, C., & Newman, M. E. J. (2000) · Physical Review E · doi:10.1103/physreve.62.7059 · Cited by 183
Ising model in small-world networks
Herrero, C. P. (2002) · Physical Review E · doi:10.1103/physreve.65.066110 · Cited by 164
Finiteness and fluctuations in growing networks
Krapivsky, P. L., & Redner, S. (2002) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/35/45/302 · Cited by 136
Self-citationSolution of voter model dynamics on annealed small-world networks
Vilone, D., & Castellano, C. (2004) · Physical Review E · doi:10.1103/physreve.69.016109 · Cited by 106
First-passage properties of the Erdos–Renyi random graph
Sood, V., Redner, S., & ben‐Avraham, D. (2004) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/38/1/007 · Cited by 103
Self-citationScaling properties of random walks on small-world networks
Almaas, E., Kulkarni, R., & Stroud, D. (2003) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.68.056105 · Cited by 71
Mean-Field and Anomalous Behavior on a Small-World Network
Hastings, M. B. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.098701 · Cited by 52
Exact solution of Ising model on a small-world network
Lopes, J. V., Pogorelov, Y. G., dos Santos, J. M. B. L., et al. (2004) · Physical Review E · doi:10.1103/physreve.70.026112 · Cited by 48
Cited by
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
Homophily and contagion are generically confounded in observational social network studies
Shalizi, C. R., & Thomas, A. C. (2011) · Sociological Methods & Research · doi:10.1177/0049124111404820 · Cited by 994
“Probabilistically, the vector Y (t) is a Markov chain, specifically a variant of the “voter model” of statistical mechanics on a graph (Liggett, 1985; Sood and Redner, 2005); the minor addition of low-frequency noise (doing the opposite of the selected neighbor) keeps the homogeneous configurations…”
BackgroundInfluential
Metadata
- Authors
- Sood, V., & Redner, S.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2005-05-04
- Volume
- 94
- Issue
- 17
- Pages
- 178701-178701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2150041461
- Cited by
- 701
- References
- 20
- FWCI
- 14.42
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.