Network bypasses sustain complexity

DOI10.1073/PNAS.2305001120MaRDI QIDQ7017456zbMATH OpenFDO

Authors Ernesto Estrada, Jesús Gómez-Gardeñes, Lucas Lacasa

Publication date 6 March 2025

Published in Proceedings of the National Academy of Sciences of the United States of America (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1073/PNAS.2305001120

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cited in

(4)

• Forman-Ricci communicability curvature of graphs and networks
• Geometries of mixed graphs in complex vector spaces. Hierarchies and clusters in complex networks
• Signed graphs in data sciences via communicability geometry
• Balance with memory in signed networks via Mittag-Leffler matrix functions

This page was built for publication: Network bypasses sustain complexity

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