The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Ising model on networks with an arbitrary distribution of connections
Open accessAbstract
We find the exact critical temperature T(c) of the nearest-neighbor ferromagnetic Ising model on an "equilibrium" random graph with an arbitrary degree distribution P(k). We observe an anomalous behavior of the magnetization, magnetic susceptibility and specific heat, when P(k) is fat tailed, or, loosely speaking, when the fourth moment of the distribution diverges in infinite networks. When the second moment becomes divergent, T(c) approaches infinity, the phase transition is of infinite order, and size effect is anomalously strong.
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
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
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
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
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
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
Epidemic dynamics and endemic states in complex networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review E · doi:10.1103/physreve.63.066117 · Cited by 1,682
Breakdown of the Internet under Intentional Attack
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3682 · Cited by 1,455
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
Bollobás, B. (1980) · European Journal of Combinatorics · doi:10.1016/s0195-6698(80)80030-8 · Cited by 1,151
The asymptotic number of labeled graphs with given degree sequences
Bender, E. A., & Canfield, E. R. (1978) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(78)90059-6 · Cited by 970
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
MOLLOY, M., & REED, B. (1998) · Combinatorics, Probability and Computing · doi:10.1017/s0963548398003526 · Cited by 831
Epidemic dynamics in finite size scale-free networks
Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.035108 · Cited by 697
Ising model on a dynamical planar random lattice: Exact solution
Kazakov, V. (1986) · Physics Letters A · doi:10.1016/0375-9601(86)90433-0 · Cited by 498
Are randomly grown graphs really random?
Callaway, D. S., Hopcroft, J. E., Kleinberg, J. M., Newman, M. E. J., & Strogatz, S. H. (2001) · Physical Review E · doi:10.1103/physreve.64.041902 · Cited by 448
Boulatov, D. V., & Kazakov, V. (1987) · Physics Letters B · doi:10.1016/0370-2693(87)90312-1 · Cited by 313
Anomalous percolation properties of growing networks
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.066110 · Cited by 153
Self-citationThe asymptotic connectivity of labelled regular graphs
Wormald, N. (1981) · Journal of Combinatorial Theory Series B · doi:10.1016/s0095-8956(81)80021-4 · Cited by 118
Comment on “Breakdown of the Internet under Intentional Attack”
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.219801 · Cited by 47
Self-citationCohen, Erez, ben-Avraham, and Havlin Reply:
Reuven Cohen, C., Erez, K., ben‐Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.219802 · Cited by 12
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
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
Self-citationInformation, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
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
Metadata
- Authors
- Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-07-08
- Volume
- 66
- Issue
- 1
- Pages
- 016104-016104
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1976870689
- Cited by
- 382
- References
- 23
- FWCI
- 10.66
- 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.