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.
- Maksim Kitsak
- Alexander Ganin
- Igor Linkov
