Unknown

Dataset Information

Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping.


ABSTRACT: Dynamic processes on networks, be it information transfer in the Internet, contagious spreading in a social network, or neural signaling, take place along shortest or nearly shortest paths. Computing shortest paths is a straightforward task when the network of interest is fully known, and there are a plethora of computational algorithms for this purpose. Unfortunately, our maps of most large networks are substantially incomplete due to either the highly dynamic nature of networks, or high cost of network measurements, or both, rendering traditional path finding methods inefficient. We find that shortest paths in large real networks, such as the network of protein-protein interactions and the Internet at the autonomous system level, are not random but are organized according to latent-geome

SUBMITTER: Kitsak M 

PROVIDER: S-EPMC9845360 | biostudies-literature | 2023 Jan

REPOSITORIES: biostudies-literature