The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Maximum likelihood: Extracting unbiased information from complex networks
Open accessAbstract
The choice of free parameters in network models is subjective, since it depends on what topological properties are being monitored. However, we show that the maximum likelihood (ML) principle indicates a unique, statistically rigorous parameter choice, associated with a well-defined topological feature. We then find that, if the ML condition is incompatible with the built-in parameter choice, network models turn out to be intrinsically ill defined or biased. To overcome this problem, we construct a class of safely unbiased models. We also propose an extension of these results that leads to the fascinating possibility to extract, only from topological data, the "hidden variables" underlying network organization, making them "no longer hidden." We test our method on World Trade Web data, where we recover the empirical gross domestic product using only topological information.
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Cited by
The statistical physics of real-world networks
Cimini, G., Squartini, T., Saracco, F., Garlaschelli, D., Gabrielli, A., & Caldarelli, G. (2019) · Nature Reviews Physics · doi:10.1038/s42254-018-0002-6 · Cited by 378
Self-citationEntropy measures for networks: Toward an information theory of complex topologies
Anand, K., & Bianconi, G. (2009) · Physical Review E · doi:10.1103/physreve.80.045102 · Cited by 368
The multiplex structure of interbank networks
Bargigli, L., di Iasio, G., Infante, L., Lillo, F., & Pierobon, F. (2015) · Quantitative Finance · doi:10.1080/14697688.2014.968356 · Cited by 278
Bianconi, G. (2009) · Physical Review E · doi:10.1103/physreve.79.036114 · Cited by 273
Coordinated Behavior on Social Media in 2019 UK General Election
Nizzoli, L., Tardelli, S., Avvenuti, M., Cresci, S., & Tesconi, M. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v15i1.18074 · Cited by 95
Metadata
- Authors
- Garlaschelli, D., & Loffredo, M. I.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2008-07-28
- Volume
- 78
- Issue
- 1
- Pages
- 015101-015101
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2115364079
- Cited by
- 189
- References
- 1
- FWCI
- 5.76
- 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: Maximum likelihood: Extracting unbiased information from complex networks. https://app.cochat.ai/papers/10.1103/physreve.78.015101
- The paper
- Garlaschelli, D., & Loffredo, M. I. (2008). Maximum likelihood: Extracting unbiased information from complex networks. Physical Review E. https://doi.org/10.1103/physreve.78.015101
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.