The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Entropy of network ensembles
Open accessAbstract
In this paper we generalize the concept of random networks to describe network ensembles with nontrivial features by a statistical mechanics approach. This framework is able to describe undirected and directed network ensembles as well as weighted network ensembles. These networks might have nontrivial community structure or, in the case of networks embedded in a given space, they might have a link probability with a nontrivial dependence on the distance between the nodes. These ensembles are characterized by their entropy, which evaluates the cardinality of networks in the ensemble. In particular, in this paper we define and evaluate the structural entropy, i.e., the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence. We stress the apparent paradox that scale-free degree distributions are characterized by having small structural entropy while they are so widely encountered in natural, social, and technological complex systems. We propose a solution to the paradox by proving that scale-free degree distributions are the most likely degree distribution with the corresponding value of the structural entropy. Finally, the general framework we present in this paper is able to describe microcanonical ensembles of networks as well as canonical or hidden-variable network ensembles with significant implications for the formulation of network-constructing algorithms.
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
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
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051
Comparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
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
The asymptotic number of labeled graphs with given degree sequences
Bender, E. A., & Canfield, E. R. (1978) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(78)90059-6 · Cited by 970
Connected Components in Random Graphs with Given Expected Degree Sequences
Chung, F., & Lu, L. (2002) · Annals of Combinatorics · doi:10.1007/pl00012580 · Cited by 938
Models of social networks based on social distance attachment
Boguñá, M., Pastor-Satorras, R., Díaz-Guilera, A., & Arenas, A. (2004) · Physical Review E · doi:10.1103/physreve.70.056122 · Cited by 769
A model of Internet topology using k-shell decomposition
Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., & Shir, E. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701175104 · Cited by 760
k-Core Organization of Complex Networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.040601 · Cited by 709
Mixture models and exploratory analysis in networks
Newman, M. E. J., & Leicht, E. A. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610537104 · Cited by 554
Class of correlated random networks with hidden variables
Boguñá, M., & Pastor-Satorras, R. (2003) · Physical Review E · doi:10.1103/physreve.68.036112 · Cited by 452
General formalism for inhomogeneous random graphs
Söderberg, B. (2002) · Physical Review E · doi:10.1103/physreve.66.066121 · Cited by 244
The entropy of randomized network ensembles
Bianconi, G. (2008) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/81/28005 · Cited by 239
Self-citationEntropy rate of diffusion processes on complex networks
Gómez-Gardeñes, J., & Latora, V. (2008) · Physical Review E · doi:10.1103/physreve.78.065102 · Cited by 199
Maximum likelihood: Extracting unbiased information from complex networks
Garlaschelli, D., & Loffredo, M. I. (2008) · Physical Review E · doi:10.1103/physreve.78.015101 · Cited by 189
Statistical ensemble of scale-free random graphs
Burda, Z., Correia, J. D., & Krzywicki, A. (2001) · Physical Review E · doi:10.1103/physreve.64.046118 · Cited by 175
Berg, J., & Lässig, M. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.228701 · Cited by 166
Solution of the two-star model of a network
Park, J., & Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.066146 · Cited by 164
Glassiness in a Model without Energy Barriers
Ritort, F. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1190 · Cited by 154
Principles of statistical mechanics of uncorrelated random networks
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2003) · Nuclear Physics B · doi:10.1016/s0550-3213(03)00504-2 · Cited by 144
Local Structure of Directed Networks
Bianconi, G., Gulbahce, N., & Motter, A. E. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.118701 · Cited by 128
Self-citationEntropies of complex networks with hierarchically constrained topologies
Bianconi, G., Coolen, A. C. C., & Vicente, C. J. P. (2008) · Physical Review E · doi:10.1103/physreve.78.016114 · Cited by 85
Self-citationBogacz, L., Burda, Z., & Waclaw, B. (2005) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.10.024 · Cited by 68
A statistical mechanics approach for scale-free networks and finite-scale networks
Bianconi, G. (2007) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.2720642 · Cited by 46
Self-citationTransition from small to large world in growing networks
Dorogovtsev, S. N., Krapivsky, P. L., & Mendes, J. F. F. (2007) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/81/30004 · Cited by 18
Cited by
Hyperbolic geometry of complex networks
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., & Boguñá, M. (2010) · Physical Review E · doi:10.1103/physreve.82.036106 · Cited by 1,059
Mathematical Formulation of Multilayer Networks
De Domenico, M., Solé-Ribalta, A., Cozzo, E., Kivelä, M., Moreno, Y., Porter, M. A., Gómez, S., & Arenas, A. (2013) · Physical Review X · doi:10.1103/physrevx.3.041022 · Cited by 930
Jusup, M., Holme, P., Kanazawa, K., Takayasu, M., Romić, I., Wang, Z., Geček, S., Lipić, T., Podobnik, B., Wang, L., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2021.10.005 · Cited by 643
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
Entropy 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
Self-citation
Metadata
- Authors
- Bianconi, G.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2009-03-27
- Volume
- 79
- Issue
- 3
- Pages
- 036114-036114
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2158863573
- Cited by
- 273
- References
- 32
- FWCI
- 12.28
- 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
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.