CoChat

Entropies of complex networks with hierarchically constrained topologies

Open access
Bianconi, Ginestra, Coolen, Anthony C. C., Perez Vicente, Conrad J. · 2008 · Physical Review E
Cited by 87

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

The entropy of a hierarchical network topology in an ensemble of sparse random networks, with "hidden variables" associated with its nodes, is the log-likelihood that a given network topology is present in the chosen ensemble. We obtain a general formula for this entropy, which has a clear interpretation in some simple limiting cases. The results provide keys with which to solve the general problem of "fitting" a given network with an appropriate ensemble of random networks.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreve.78.016114

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 87

Metadata

Authors
Bianconi, G., Coolen, A. C. C., & Perez Vicente, C. J.
Venue
Physical Review E
Published
2008-07-28
Volume
78
Issue
1
Pages
016114-016114
ISSN
  • 1539-3755 (ISSN-L)
  • 1550-2376
OpenAlex
W2003688007
Cited by
87
References
2
FWCI
6.02
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: Entropies of complex networks with hierarchically constrained topologies. https://app.cochat.ai/papers/10.1103/physreve.78.016114
The paper
Bianconi, G., Coolen, A. C. C., & Perez Vicente, C. J. (2008). Entropies of complex networks with hierarchically constrained topologies. Physical Review E. https://doi.org/10.1103/physreve.78.016114

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.