The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Reaction–diffusion processes and metapopulation models in heterogeneous networks
Open accessAbstract
Dynamical reaction–diffusion processes and metapopulation models are standard modelling approaches for a wide array of phenomena in which local quantities—such as density, potentials and particles—diffuse and interact according to the physical laws. Here, we study the behaviour of the basic reaction–diffusion process (given by the reaction steps B→A and B+A→2B) defined on networks with heterogeneous topology and no limit on the nodes’ occupation number. We investigate the effect of network topology on the basic properties of the system’s phase diagram and find that the network heterogeneity sustains the reaction activity even in the limit of a vanishing density of particles, eventually suppressing the critical point in density-driven phase transitions, whereas phase transition and critical points independent of the particle density are not altered by topological fluctuations. This work lays out a theoretical and computational microscopic framework for the study of a wide range of realistic metapopulation and agent-based models that include the complex features of real-world networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Infectious Diseases of Humans: Dynamics and Control
(1992) · Annals of Internal Medicine · doi:10.7326/0003-4819-117-2-174_4 · Cited by 7,746
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
Self-citationAssortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Self-citationNetwork Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
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
Guimerà, R., Mossa, S., Turtschi, A., & Amaral, L. A. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407994102 · Cited by 1,762
Cited by
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Self-citationBarthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
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
The Hidden Geometry of Complex, Network-Driven Contagion Phenomena
Brockmann, D., & Helbing, D. (2013) · Science · doi:10.1126/science.1245200 · Cited by 1,253
Clustering in weighted networks
Opsahl, T., & Panzarasa, P. (2009) · Social Networks · doi:10.1016/j.socnet.2009.02.002 · Cited by 1,037
Metadata
- Authors
- Colizza, V., Pastor-Satorras, R., & Vespignani, A.
- Venue
- Nature Physics
- Published
- 2007-03-04
- Volume
- 3
- Issue
- 4
- Pages
- 276-282
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2146530408
- Cited by
- 869
- References
- 36
- FWCI
- 17.79
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reaction–diffusion processes and metapopulation models in heterogeneous networks. https://app.cochat.ai/papers/10.1038/nphys560
- The paper
- Colizza, V., Pastor-Satorras, R., & Vespignani, A. (2007). Reaction–diffusion processes and metapopulation models in heterogeneous networks. Nature Physics. https://doi.org/10.1038/nphys560
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.
