Navigability of Random Geometric Graphs in the Universe and Other Spacetimes
arXiv:1703.09057 · doi:10.1038/s41598-017-08872-4
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 spacetime), only with matter, and with a mixture of dark energy and matter as in our universe. We find that these graphs are navigable only in the manifolds with dark energy. This result implies that, in terms of navigability, random geometric graphs in asymptotically de Sitter spacetimes are as good as random hyperbolic graphs. It also establishes a connection between the presence of dark energy and navigability of the discretized causal structure of spacetime, which provides a basis for a different approach to the dark energy problem in cosmology.
arXiv comment15 pages, 10 figures
References in corpus (37)
- Seven-Year Wilkinson Microwave Anisotropy Probe (WMAP) Observations: Cosmological Interpretation
- The Supernova Legacy Survey: Measurement of Omega_M, Omega_Lambda and w from the First Year Data Set
- Hyperbolic Geometry of Complex Networks
- Popularity versus Similarity in Growing Networks
- The Rich-Club Phenomenon In The Internet Topology
- Navigability of Complex Networks
- Random Geometric Graphs
- Sustaining the Internet with Hyperbolic Mapping
- Holographic probabilities in eternal inflation
- Random geometric complexes
- Emergent Hyperbolic Network Geometry
- A New Perspective on Cosmic Coincidence Problems
- Network geometry with flavor: from complexity to quantum geometry
- Hidden geometric correlations in real multiplex networks
- On the dimensionality of spacetime
- Network Cosmology
- The cosmological constant and the time of its dominance
- Interdisciplinary and physics challenges of Network Theory
- Emergent Complex Network Geometry
- Emergence of Soft Communities from Geometric Preferential Attachment
- The hidden geometry of weighted complex networks
- Connectivity of soft random geometric graphs
- An Experimental Investigation of Hyperbolic Routing with a Smart Forwarding Plane in NDN
- Generalized communities in networks
- Navigable Networks as Nash Equilibria of Navigation Games
- Eternal Symmetree
- A New Solution of The Cosmological Constant Problems
- Complex Quantum Network Geometries: Evolution and Phase Transitions
- A geometric solution to the coincidence problem, and the size of the landscape as the origin of hierarchy
- Navigating ultrasmall worlds in ultrashort time
- Embedding Graphs in Lorentzian Spacetime
- What is the dimension of citation space?
- Is the cosmological "constant" a nonlocal quantum residue of discreteness of the causal set type?
- Opinion Dynamics and Influencing on Random Geometric Graphs
- Fundamental groups of random clique complexes
- Statistical mechanics of random geometric graphs: Geometry-induced first order phase transition
- On the diameter of hyperbolic random graphs