Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping
oleh: Maksim Kitsak, Alexander Ganin, Ahmed Elmokashfi, Hongzhu Cui, Daniel A. Eisenberg, David L. Alderson, Dmitry Korkin, Igor Linkov
| Format: | Article |
|---|---|
| Diterbitkan: | Nature Portfolio 2023-01-01 |
Deskripsi
Shortest paths between the nodes of complex networks are challenging to obtain if the information on network structure is incomplete. Here the authors show that the shortest paths are geometrically localized in hyperbolic representations of networks, and can be detected even if the large amount of network links are missing. The authors demonstrate the utility of geometric pathfinding in Internet routing and the reconstruction of cellular pathways.