The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Statistical mechanics of networks
Open accessAbstract
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the same role in the study of networks as is played by the Boltzmann distribution in classical statistical mechanics; they offer the best prediction of network properties subject to the constraints imposed by a given set of observations. We give exact solutions of models within this class that incorporate arbitrary degree distributions and arbitrary but independent edge probabilities. We also discuss some more complex examples with correlated edges that can be solved approximately or exactly by adapting various familiar methods, including mean-field theory, perturbation theory, and saddle-point expansions.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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 · cited 2×
“Some of the most interesting networks, including the Internet and the world wide web, appear to have degree distributions that follow a power law [6, 26, 27].”
BackgroundStatistical 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
Self-citationFinding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Self-citationStrogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Nonparametric estimates of standard error: The jackknife, the bootstrap and other methods
EFRON, B. (1981) · Biometrika · doi:10.1093/biomet/68.3.589 · Cited by 1,399
A Modern Course in Statistical Physics
Reichl, L. E., & Coppersmith, S. N. (1999) · Physics Today · doi:10.1063/1.882556 · Cited by 1,380
Structure of Growing Networks with Preferential Linking
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4633 · Cited by 1,307
Universal Behavior of Load Distribution in Scale-Free Networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.278701 · Cited by 1,246
Connectivity of Growing Random Networks
Krapivsky, P. L., Redner, S., & Leyvraz, F. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4629 · Cited by 1,197
An Exponential Family of Probability Distributions for Directed Graphs
Holland, P. W., & Leinhardt, S. (1981) · Journal of the American Statistical Association · doi:10.1080/01621459.1981.10477598 · Cited by 1,190
Logit Models and Logistic Regressions for Social Networks: I. An Introduction to Markov Graphs and p
Wasserman, S., & Pattison, P. (1996) · Psychometrika · doi:10.1007/bf02294547 · Cited by 950
Connected Components in Random Graphs with Given Expected Degree Sequences
Chung, F., & Lu, L. (2002) · Annals of Combinatorics · doi:10.1007/pl00012580 · Cited by 938
Frank, O., & Strauss, D. (1986) · Journal of the American Statistical Association · doi:10.1080/01621459.1986.10478342 · Cited by 893
(1990) · Acta Applicandae Mathematicae · doi:10.1007/bf00046910 · Cited by 882
Markov chain Monte Carlo estimation of exponential random graph models
Snijders, T. A. B. (2002) · Journal of Social Structure · Cited by 869
Email networks and the spread of computer viruses
Newman, M. E. J., Forrest, S., & Balthrop, J. (2002) · Physical Review E · doi:10.1103/physreve.66.035101 · Cited by 798
Self-citationScale-Free Networks from Varying Vertex Intrinsic Fitness
Caldarelli, G., Capocci, A., De Los Rios, P., & Muñoz, M. A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.258702 · Cited by 794
Constant Connectance in Community Food Webs
Martinez, N. D. (1992) · The American Naturalist · doi:10.1086/285382 · Cited by 470
Solomonoff, R., & Rapoport, A. (1951) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478357 · Cited by 459
Class of correlated random networks with hidden variables
Boguñá, M., & Pastor-Satorras, R. (2003) · Physical Review E · doi:10.1103/physreve.68.036112 · Cited by 452
Pseudolikelihood Estimation for Social Networks
Strauss, D., & Ikeda, M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10475327 · Cited by 440
Curvature of co-links uncovers hidden thematic layers in the World Wide Web
Eckmann, J.-P., & Moses, E. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.032093399 · Cited by 346
A p* primer: logit models for social networks
Anderson, C. J., Wasserman, S., & Crouch, B. (1999) · Social Networks · doi:10.1016/s0378-8733(98)00012-4 · Cited by 332
Kessler, D., & Krehbiel, K. (1996) · American Political Science Review · doi:10.2307/2082608 · Cited by 261
On a General Class of Models for Interaction
Strauss, D. (1986) · SIAM Review · doi:10.1137/1028156 · Cited by 247
Multiple Comparisons in Induction Algorithms
Jensen, D. D., & Cohen, P. R. (2000) · Machine Learning · doi:10.1023/a:1007631014630 · Cited by 241
Origin of degree correlations in the Internet and other networks
Park, J., & Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026112 · Cited by 222
Self-citationStatistical ensemble of scale-free random graphs
Burda, Z., Correia, J. D., & Krzywicki, A. (2001) · Physical Review E · doi:10.1103/physreve.64.046118 · Cited by 175
8. Comparing Networks across Space and Time, Size and Species
Faust, K., & Skvoretz, J. (2002) · Sociological Methodology · doi:10.1111/1467-9531.00118 · Cited by 169
Berg, J., & Lässig, M. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.228701 · Cited by 166
Solution of the two-star model of a network
Park, J., & Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.066146 · Cited by 164
Self-citationPrinciples of statistical mechanics of uncorrelated random networks
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2003) · Nuclear Physics B · doi:10.1016/s0550-3213(03)00504-2 · Cited by 144
Solution for the properties of a clustered network
Park, J. M., & Newman, M. E. J. (2005) · Physical Review E · doi:10.1103/physreve.72.026136 · Cited by 113
Self-citationNetwork transitivity and matrix models
Burda, Z., Jurkiewicz, J., & Krzywicki, A. (2004) · Physical Review E · doi:10.1103/physreve.69.026106 · Cited by 109
Clustering in Complex Networks
Szabó, G., Alava, M. J., & Kertész, J. (2004) · Lecture notes in physics · doi:10.1007/978-3-540-44485-5_7 · Cited by 95
Foundations of Statistical Mechanics: Equilibrium Theory
Grandy, W. T. (1987) · Springer eBooks · doi:10.1007/978-94-009-3867-0 · Cited by 86
Statistical mechanics of topological phase transitions in networks
Palla, G., Derényi, I., Farkas, I. J., & Vicsek, T. (2004) · Physical Review E · doi:10.1103/physreve.69.046117 · Cited by 66
Perturbing general uncorrelated networks
Burda, Z., Jurkiewicz, J., & Krzywicki, A. (2004) · Physical Review E · doi:10.1103/physreve.70.026106 · Cited by 27
Biely, C., & Thurner, S. (2006) · Physical Review E · doi:10.1103/physreve.74.066116 · Cited by 16
Cited by
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
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
Hyperbolic geometry of complex networks
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., & Boguñá, M. (2010) · Physical Review E · doi:10.1103/physreve.82.036106 · Cited by 1,059
Metadata
- Authors
- Park, J., & Newman, M. E. J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2004-12-07
- Volume
- 70
- Issue
- 6
- Pages
- 066117-066117
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W1761171396
- Cited by
- 673
- References
- 46
- FWCI
- 11.14
- 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.