Navigability of Random Geometric Graphs in the Universe and Other Spacetimes.

ABSTRACT: Random geometric graphs in hyperbolic spaces explain many common structural and dynamical properties of real networks, yet they fail to predict the correct values of the exponents of power-law degree distributions observed in real networks. In that respect, random geometric graphs in asymptotically de Sitter spacetimes, such as the Lorentzian spacetime of our accelerating universe, are more attractive as their predictions are more consistent with observations in real networks. Yet another important property of hyperbolic graphs is their navigability, and it remains unclear if de Sitter graphs are as navigable as hyperbolic ones. Here we study the navigability of random geometric graphs in three Lorentzian manifolds corresponding to universes filled only with dark energy (de Sitter spacetim

SUBMITTER: Cunningham W 

PROVIDER: S-EPMC5562713 | biostudies-literature | 2017 Aug

REPOSITORIES: biostudies-literature