Informational cost and networks navigability

DOI10.1016/j.amc.2020.125914OpenAlexW4245015312MaRDI QIDQ2242057

Ernesto Estrada

Publication date: 9 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21203/rs.3.rs-112637/v1

zbMATH Keywords

quantum theorystatistical mechanicsmatrix functionsbiological networksnetwork communicabilitynetwork navigability

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Systems biology, networks (92C42) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (1)

Communication in complex networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperspherical embedding of graphs and networks in communicability spaces
• Universal augmentation schemes for network navigability
• Properties of Euclidean and non-Euclidean distance matrices
• Complex networks: structure and dynamics
• Minimal webs in Riemannian manifolds
• Navigability of interconnected networks under random failures
• A Lower Bound for Network Navigability
• The electron density function of the Hückel (tight-binding) model
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Informational cost and networks navigability