Maximum-entropy networks. Pattern detection, network reconstruction and graph combinatorics

DOI10.1007/978-3-319-69438-2MaRDI QIDQ4589257zbMATH OpenOpenAlexFDO

Authors 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

complex networksgraph combinatoricsnetwork reconstructionpattern recognition

Mathematics Subject Classification ID

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

Recommendations

• Random graphs and complex networks. Volume 1
• Introduction to Random Graphs
• Generating Random Networks and Graphs
• Complex networks: principles, methods and applications
• The Nature of Complex Networks

Cited in

(14)

• Is breaking of ensemble equivalence monotone in the number of constraints?
• Covariance structure behind breaking of ensemble equivalence in random graphs
• Tackling information asymmetry in networks: a new entropy-based ranking index
• A betweenness structural entropy of complex networks
• Statistical ensembles for economic networks
• Sufficient conditions for graphicality of bidegree sequences
• Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles)
• Analytical maximum-likelihood method to detect patterns in real networks
• Breaking of ensemble equivalence for dense random graphs under a single constraint
• Introduction to correlation networks: interdisciplinary approaches beyond thresholding
• Statistics of the non-zero eigenvalues and singular values of low-rank random matrices with non-negative entries
• Maximizing entropy with an expectation constraint and one-parameter exponential families of distributions: a reexamination
• Analysis of flows in social media uncovers a new multi-step model of information spread
• Urn modeling of random graphs across granularity scales: a framework for origin-destination human mobility networks

This page was built for publication: Maximum-entropy networks. Pattern detection, network reconstruction and graph combinatorics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589257)