Thermodynamic depth in undirected and directed networks

DOI10.1002/9783527670468.CH10MaRDI QIDQ3463391zbMATH OpenOpenAlexWikidataFDO

Authors F. Escolano, Edwin R. Hancock

Publication date 14 January 2016

Published in Advances in Network Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/9783527670468.ch10

zbMATH Keywords

Bayesian networksBirkhoff-von Neumann decompositiondoubly stochastic matrixmaximum entropystatistical complexityprotein-protein interaction networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Classical and relativistic thermodynamics (80A10)

Recommendations

• Complexity of networks
• Entropy and the complexity of graphs revisited
• On measuring the complexity of networks: Kolmogorov complexity versus entropy
• Depth-based hypergraph complexity traces from directed line graphs
• Spectral complexity of directed graphs and application to structural decomposition

Cited in

(3)

• Depth-based hypergraph complexity traces from directed line graphs
• The entropy of a thermodynamic graph
• Network thermodynamics: A simulation and modeling method based on the extension of thermodynamic thinking into the realm of highly organized systems

This page was built for publication: Thermodynamic depth in undirected and directed networks

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