Maximum-Entropy Networks

DOI10.1007/978-3-319-69438-2zbMath1384.82002OpenAlexW4254499387MaRDI QIDQ4589257

Tiziano Squartini, Diego Garlaschelli

Publication date: 9 November 2017

Published in: SpringerBriefs in Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-69438-2

zbMATH Keywords

pattern recognitioncomplex networksnetwork reconstructiongraph combinatorics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Identification in stochastic control theory (93E12) Research exposition (monographs, survey articles) pertaining to statistical mechanics (82-02)

Related Items (7)

Is breaking of ensemble equivalence monotone in the number of constraints? ⋮ Covariance structure behind breaking of ensemble equivalence in random graphs ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Breaking of ensemble equivalence for dense random graphs under a single constraint ⋮ Tackling information asymmetry in networks: a new entropy-based ranking index ⋮ Statistical ensembles for economic networks ⋮ A betweenness structural entropy of complex networks

This page was built for publication: Maximum-Entropy Networks