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
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.67.026126 · Cited by 3,087
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051
Spectra of graphs : theory and application
Cvetković, D., Doob, M., & Sachs, H. (1995) · Cited by 1,825
On the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
Dynamical and Correlation Properties of the Internet
Pastor-Satorras, R., Vázquez, A., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.258701 · Cited by 1,466
Klein, D. J., & Randić, M. (1993) · Journal of Mathematical Chemistry · doi:10.1007/bf01164627 · Cited by 1,372
THE LAPLACIAN SPECTRUM OF GRAPHS y
Mohar, B. (1991) · Cited by 1,090
Graph Spectra for Complex Networks
Mieghem, P. V. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921681 · Cited by 702
Myers, C. R. (2003) · Physical Review E · doi:10.1103/physreve.68.046116 · Cited by 456
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
The origin of power laws in Internet topologies revisited
Chen, Q., Chang, H., Govindan, R., & Jamin, S. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019306 · Cited by 430
A first-principles approach to understanding the internet's router-level topology
Li, L., Alderson, D., Willinger, W., & Doyle, J. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015470 · Cited by 354
Information Theory of Complex Networks: On Evolution and Architectural Constraints
Solé, R. V., & Valverde, S. (2004) · Lecture Notes in Physics · doi:10.1007/978-3-540-44485-5_9 · Cited by 337
Ellens, W., Spieksma, F. M., Mieghem, P. V., Jamakovic, A., & Kooij, R. E. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.02.024 · Cited by 273
Edge direction and the structure of networks
Foster, J. G., Foster, D. V., Grassberger, P., & Paczuski, M. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0912671107 · Cited by 256
Assortativity decreases the robustness of interdependent networks
Zhou, D., Stanley, H. E., D’Agostino, G., & Scala, A. (2012) · Physical Review E · doi:10.1103/physreve.86.066103 · Cited by 217
Performance Analysis of Complex Networks and Systems
Van Mieghem, P. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781107415874 · Cited by 169
Self-citationAssortative model for social networks
Catanzaro, M., Caldarelli, G., & Pietronero, L. (2004) · Physical Review E · doi:10.1103/physreve.70.037101 · Cited by 136
Weighted assortative and disassortative networks model
LEUNG, C. C., & Chau, H. F. (2006) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.12.022 · Cited by 128
Influence of assortativity and degree-preserving rewiring on the spectra of networks
Mieghem, P. V., Wang, H., Ge, X., Tang, S., & Kuipers, F. A. (2010) · The European Physical Journal B · doi:10.1140/epjb/e2010-00219-x · Cited by 127
A first-principles approach to understanding the internet's router-level topology
Li, L., Alderson, D., Willinger, W., & Doyle, J. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1030194.1015470 · Cited by 127
Uncovering disassortativity in large scale-free networks
Litvak, N., & van der Hofstad, R. (2013) · Physical Review E · doi:10.1103/physreve.87.022801 · Cited by 105
Local assortativeness in scale-free networks
Piraveenan, M., Prokopenko, M., & Zomaya, A. Y. (2008) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/84/28002 · Cited by 98
Robustness and assortativity for diffusion-like processes in scale-free networks
D’Agostino, G., Scala, A., Zlatić, V., & Caldarelli, G. (2012) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/97/68006 · Cited by 95
Directed Random Graphs with given Degree Distributions
Chen, N., & Olvera‐Cravioto, M. (2013) · Stochastic Systems · doi:10.1214/12-ssy076 · Cited by 92
Exploring the assortativity-clustering space of a network’s degree sequence
Holme, P., & Zhao, J. (2007) · Physical Review E · doi:10.1103/physreve.75.046111 · Cited by 74
Epidemic threshold in directed networks
Li, C., Wang, H., & Mieghem, P. V. (2013) · Physical Review E · doi:10.1103/physreve.88.062802 · Cited by 62
Spectral graph analysis of modularity and assortativity
Mieghem, P. V., Ge, X., Schumm, P., Trajanovski, S., & Wang, H. (2010) · Physical Review E · doi:10.1103/physreve.82.056113 · Cited by 60
Combinatorial study of degree assortativity in networks
Estrada, E. (2011) · Physical Review E · doi:10.1103/physreve.84.047101 · Cited by 44
Effect of tumor resection on the characteristics of functional brain networks
Wang, H., Douw, L., Hernández, J. M., Reijneveld, J. C., Stam, C. J., & Mieghem, P. V. (2010) · Physical Review E · doi:10.1103/physreve.82.021924 · Cited by 44
GENERATING AN ASSORTATIVE NETWORK WITH A GIVEN DEGREE DISTRIBUTION
Zhou, J., Xu, X.-K., Zhang, J., et al. (2008) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127408022536 · Cited by 26
Modeling network growth with assortative mixing
Quayle, A. P., Siddiqui, A. S., & Jones, S. J. M. (2006) · The European Physical Journal B · doi:10.1140/epjb/e2006-00170-5 · Cited by 22
Classifying Complex Networks using Unbiased Local Assortativity
Piraveenan, M., Prokopenko, M., & Zomaya, A. Y. (2013) · Cited by 22
Revising the simple measures of assortativity in complex networks
Xu, X.-K., Zhang, J., Sun, J., & SMALL, M. P. (2009) · Physical Review E · doi:10.1103/physreve.80.056106 · Cited by 21
On congruity of nodes and assortative information content in complex networks
Piraveenan, M., Prokopenko, M., & Zomaya, A. Y. (2012) · Networks and Heterogeneous Media · doi:10.3934/nhm.2012.7.441 · Cited by 18
Do greedy assortativity optimization algorithms produce good results?
Winterbach, W., de Ridder, D., Wang, H., et al. (2012) · The European Physical Journal B · doi:10.1140/epjb/e2012-20899-2 · Cited by 17
Emergence of scaling and assortative mixing through altruism
Li, P., Zhang, J., & SMALL, M. P. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.02.018 · Cited by 14
A universal assortativity measure for network analysisPreprint
Zhang, G., Cheng, S., & Zhang, G.-Q. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.6456 · Cited by 12
Evolving network – simulation study
Makowiec, D. (2005) · The European Physical Journal B · doi:10.1140/epjb/e2006-00008-2 · Cited by 12
From Assortative to Dissortative Networks: The Role of Capacity ConstraintsPreprint
König, M., Tessone, C. J., & Zénou, Y. (2010) · SSRN Electronic Journal · doi:10.2139/ssrn.1660987 · Cited by 7
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
Wang, X., Liu, X., & Loguinov, D. (2008) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2008.164 · Cited by 7
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
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.