The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Assortative Mixing in Networks
Open accessAbstract
A network is said to show assortative mixing if the nodes in the network that have many connections tend to be connected to other nodes with many connections. Here we measure mixing patterns in a variety of networks and find that social networks are mostly assortatively mixed, but that technological and biological networks tend to be disassortative. We propose a model of an assortatively mixed network, which we study both analytically and numerically. Within this model we find that networks percolate more easily if they are assortative and that they are also more robust to vertex removal.
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
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
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
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639 · cited 3×
“model networks in the limit of large network size: (u) the random graph of Erdős and Rényi [14]; (v) the grown graph model of Callaway et al.”
Influential
Research works printed but not linked: 17
- 10.1038/35065725 · DOI · Paper page
- 10.1103/RevModPhys.74.47 · DOI · Paper page
- 10.1038/30918 · DOI · Paper page
- 10.1103/PhysRevE.64.026118 · DOI · Paper page
- 10.1103/PhysRevE.64.041902 · DOI · Paper page
- 10.1073/pnas.021544898 · DOI · Paper page
- J. W. Grossman, 1995, Congressus Numerantium, 108, 129
- Q. Chen, 2002, Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies
- 10.1038/35075138 · DOI · Paper page
- M. Huxham, 1996, Oikos, 76, 284, 10.2307/3546201 · DOI
- N. D. Martinez, 1991, Ecological Monographs, 61, 367, 10.2307/2937047 · DOI · Paper page
- L. A. Adamic, 2000, Science, 287, 2115, 10.1126/science.287.5461.2115a · DOI · Paper page
- M. Molloy, 1995, Random Struct. Algorithms, 6, 161, 10.1002/rsa.3240060204 · DOI · Paper page
- M. Morris, 1993, Nature (London), 365, 437, 10.1038/365437a0 · DOI
- 10.1103/PhysRevLett.86.3682 · DOI · Paper page
- 10.1103/PhysRevE.65.056109 · DOI · Paper page
- 10.1103/PhysRevE.65.036104 · DOI · Paper page
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Self-citationComplex network measures of brain connectivity: Uses and interpretations
Rubinov, M., & Sporns, O. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2009.10.003 · Cited by 11,522
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
Network biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903
The Spread of Obesity in a Large Social Network over 32 Years
Christakis, N. A., & Fowler, J. H. (2007) · New England Journal of Medicine · doi:10.1056/nejmsa066082 · Cited by 5,007
Metadata
- Authors
- Newman, M. E. J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2002-10-28
- Volume
- 89
- Issue
- 20
- Pages
- 208701-208701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2040956707
- Cited by
- 4,988
- References
- 4
- FWCI
- 43.26
- 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: Assortative Mixing in Networks. https://app.cochat.ai/papers/10.1103/physrevlett.89.208701
- The paper
- Newman, M. E. J. (2002). Assortative Mixing in Networks. Physical Review Letters. https://doi.org/10.1103/physrevlett.89.208701
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.
