The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Comparing methods for comparing networks
Open accessAbstract
With the impressive growth of available data and the flexibility of network modelling, the problem of devising effective quantitative methods for the comparison of networks arises. Plenty of such methods have been designed to accomplish this task: most of them deal with undirected and unweighted networks only, but a few are capable of handling directed and/or weighted networks too, thus properly exploiting richer information. In this work, we contribute to the effort of comparing the different methods for comparing networks and providing a guide for the selection of an appropriate one. First, we review and classify a collection of network comparison methods, highlighting the criteria they are based on and their advantages and drawbacks. The set includes methods requiring known node-correspondence, such as DeltaCon and Cut Distance, as well as methods not requiring a priori known node-correspondence, such as alignment-based, graphlet-based, and spectral methods, and the recently proposed Portrait Divergence and NetLSD. We test the above methods on synthetic networks and we assess their usability and the meaningfulness of the results they provide. Finally, we apply the methods to two real-world datasets, the European Air Transportation Network and the FAO Trade Network, in order to discuss the results that can be drawn from this type of analysis.
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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Trade Liberalisation and “Revealed” Comparative Advantage 1
Balassa, B. (1965) · The Manchester School · doi:10.1111/j.1467-9957.1965.tb00050.x · Cited by 4,809
Ward’s Hierarchical Agglomerative Clustering Method: Which Algorithms Implement Ward’s Criterion?
Murtagh, F., & Legendre, P. (2014) · Journal of Classification · doi:10.1007/s00357-014-9161-z · Cited by 3,782
Benchmark graphs for testing community detection algorithms
Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008) · Physical Review E · doi:10.1103/physreve.78.046110 · Cited by 3,051
Hand, D. J., Mannila, H., & Smyth, P. (2001) · Cited by 2,581
Barabรกsi, A.-L. (2016) · Cited by 1,375
Cited by
Evaluating the Reproducibility of Single-Cell Gene Regulatory Network Inference Algorithms
Kang, Y., Thieffry, D., & Cantini, L. (2021) · Frontiers in Genetics · doi:10.3389/fgene.2021.617282 · Cited by 41
Urban, A., Agus, M., Aru, N., Corona, F., Cantone, E., Cortese, C. G., & Nonnis, M. (2024) · doi:10.20944/preprints202411.0084.v1 · Cited by 8
Metadata
- Authors
- Tantardini, M., Ieva, F., Tajoli, L., & Piccardi, C.
- Venue
- Scientific Reports
- Published
- 2019-11-26
- Volume
- 9
- Issue
- 1
- Pages
- 17557-17557
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2991388718
- Cited by
- 264
- References
- 64
- FWCI
- 10.79
- Type
- journal article
- Language
- en
- Open access
- gold
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: Comparing methods for comparing networks. https://app.cochat.ai/papers/10.1038/s41598-019-53708-y
- The paper
- Tantardini, M., Ieva, F., Tajoli, L., & Piccardi, C. (2019). Comparing methods for comparing networks. Scientific Reports. https://doi.org/10.1038/s41598-019-53708-y
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.