The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Assortativity in complex networks
Abstract
We survey the concept of assortativity, starting from its original definition by Newman in 2002. Degree assortativity is the most commonly used form of assortativity. Degree assortativity is extensively used in network science. Since degree assortativity alone is not sufficient as a graph analysis tool, assortativity is usually combined with other graph metrics. Much of the research on assortativity considers undirected, non-weighted networks. The research on assortativity needs to be extended to encompass also directed links and weighted links. In addition, the relation between assortativity and line graphs, complementary graphs and graph spectra needs further work, to incorporate directed graphs and weighted links. The present survey paper aims to summarize the work in this area and provides a new scope of research.
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
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
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
Cited by
Farahani, F. V., Karwowski, W., & Lighthall, N. R. (2019) · Frontiers in Neuroscience · doi:10.3389/fnins.2019.00585 · Cited by 718
Williamson, C. M., Franks, B., & Curley, J. P. (2016) · Frontiers in Behavioral Neuroscience · doi:10.3389/fnbeh.2016.00152 · Cited by 64
Metadata
- Authors
- Noldus, R., & Van Mieghem, P.
- Venue
- Journal of Complex Networks
- Publisher
- Oxford University Press (OUP)
- Published
- 2015-03-26
- Volume
- 3
- Issue
- 4
- Pages
- 507-542
- ISSN
- 2051-1310 (ISSN-L)
- 2051-1329
- OpenAlex
- W2129315144
- Cited by
- 266
- References
- 51
- FWCI
- 11.55
- Type
- journal article
- Language
- en
- Open access
- closed
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: Assortativity in complex networks. https://app.cochat.ai/papers/10.1093/comnet/cnv005
- The paper
- Noldus, R., & Van Mieghem, P. (2015). Assortativity in complex networks. Journal of Complex Networks. https://doi.org/10.1093/comnet/cnv005
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.