The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Correlated Random Networks
Open accessAbstract
We develop a statistical theory of networks. A network is a set of vertices and links given by its adjacency matrix $\mathbf{c}$, and the relevant statistical ensembles are defined in terms of a partition function $Z=\ensuremath{\sum}_{\mathbf{c}}\mathrm{exp}[\ensuremath{-}\ensuremath{\beta}\mathcal{H}(\mathbf{c})]$. The simplest cases are uncorrelated random networks such as the well-known Erd\"os-R\'enyi graphs. Here we study more general interactions $\mathcal{H}(\mathbf{c})$ which lead to correlations, for example, between the connectivities of adjacent vertices. In particular, such correlations occur in optimized networks described by partition functions in the limit $\ensuremath{\beta}\ensuremath{\rightarrow}\ensuremath{\infty}$. They are argued to be a crucial signature of evolutionary design in biological networks.
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
A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae
Uetz, P., Giot, L., Cagney, G., Mansfield, T. A., Judson, R. S., Knight, J. R., Lockshon, D., Narayan, V., Srinivasan, M., Pochart, P., et al. (2000) · Nature · doi:10.1038/35001009 · Cited by 4,706
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Barthé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
Superfamilies of Evolved and Designed Networks
Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., & Alon, U. (2004) · Science · doi:10.1126/science.1089167 · Cited by 1,412
Statistical mechanics of networks
Park, J., & Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.066117 · Cited by 673
Metadata
- Authors
- Berg, J., & Lässig, M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2002-11-11
- Volume
- 89
- Issue
- 22
- Pages
- 228701-228701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2074816168
- Cited by
- 166
- References
- 1
- FWCI
- 10.24
- 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: Correlated Random Networks. https://app.cochat.ai/papers/10.1103/physrevlett.89.228701
- The paper
- Berg, J., & Lässig, M. (2002). Correlated Random Networks. Physical Review Letters. https://doi.org/10.1103/physrevlett.89.228701
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.