Article | Open

Navigability of Random Geometric Graphs in the Universe and Other Spacetimes

  • Scientific Reports 7, Article number: 8699 (2017)
  • doi:10.1038/s41598-017-08872-4
  • Download Citation
Published online:


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. We find 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.


Random geometric graphs1,2,3 formalize the notion of “discretization” of a continuous geometric space or manifold. Nodes in these graphs are points, sprinkled randomly at constant sprinkling density, over the manifold, thus representing “atoms” of space, while links encode geometry—two nodes are connected if they happen to lie close in the space. These graphs are also a central object in algebraic topology since their clique complexes4 are Rips complexes5, 6 whose topology is known to converge to the manifold topology under very mild assumptions7.

In network science and applied mathematics, random geometric graphs have attracted increasing attention over recent years8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44, since it was shown that if the space defining these graphs is not Euclidean but negatively curved, i.e., hyperbolic, then these graphs provide a geometric explanation of many common structural and dynamical properties of many real networks, including scale-free degree distributions, strong clustering, community structure, and network growth dynamics45,46,47. Yet more interestingly, these graphs also explain the optimality of many network functions related to finding paths in the network without global knowledge of the network structure48, 49. Random hyperbolic graphs appear to be optimal, that is, maximally efficient, with respect to the greedy path finding strategy that uses only spatial geometry to navigate through a complex network structure by moving at each step from a current node to its neighbor closest to the destination in the space37, 45. The efficiency of this process is called network navigability50. High navigability of random hyperbolic graphs led to practically viable applications, including the design of efficient routing in the future Internet51, 52, and demonstration that the spatiostructural organization of the human brain is nearly as needed for optimal information routing between different parts of the brain53. Yet if random hyperbolic graphs are truly geometric, meaning that if the sprinkling density is indeed constant with respect to the hyperbolic volume form, then the exponent γ of the distribution P(k) k γ of node degrees k in the resulting graphs is exactly γ = 345. In contrast, in random geometric graphs in de Sitter spacetime, which is asymptotically the spacetime of our accelerating universe, or indeed in the spacetime representing the exact large-scale Lorentzian geometry of our universe, this exponent asymptotically approaches γ = 254, as in many real networks55. Yet it remains unclear if these random Lorentzian graphs are as navigable as random hyperbolic graphs.

In physics, random geometric graphs in Lorentzian spacetimes, directed in the time direction, are known as causal sets, a central object in the causal set approach to quantum gravity56. A seemingly unrelated big, if not the biggest unsolved problem in cosmology is the dark energy puzzle57. What is dark energy? Why is its density orders of magnitude smaller than one would expect from high-energy physics? Causal sets provide one of the simplest explanation attempts to date58, but there are many other attempts59,60,61,62,63,64,65, none commonly considered to be the final answer.

Here we study the navigability of undirected random geometric graphs in three Lorentzian manifolds. One manifold is de Sitter spacetime, corresponding to a universe filled with dark energy only, and no matter. Another manifold is the other extreme, a universe filled only with dust matter, and no dark energy. The third manifold is a universe like ours, containing both matter and dark energy. This last manifold interpolates between the other two. At early times and small graph sizes, it is matter-dominated and “looks” like the dust-only spacetime. At later times and large graph sizes, it is dark-energy-dominated and “looks” increasingly more like de Sitter spacetime.

We find that random geometric graphs only in manifolds with dark energy are navigable. Specifically, if there is no dark energy, that is, in the dust-only spacetime, there is a finite fraction of paths for which geometric path finding fails, and that this fraction is constant—it does not depend on the cutoff time, i.e., the present cosmological time in the universe, if the average degree in the graph is kept constant. In contrast, in spacetimes with dark energy, i.e., de Sitter spacetime and the spacetime of our universe, the fraction of unsuccessful paths quickly approaches zero as the cutoff time increases.

For network science this finding implies that in terms of navigability, random geometric graphs in Lorentzian spacetimes with dark energy are as good as random hyperbolic graphs. For physics, this finding 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.

Lorentzian Manifolds

While Riemannian manifolds are manifolds with positive-definite metric tensors g ij defining geodesic distances ds by d s 2 = i , j = 1 d g i j d x i d x j , where d is the manifold dimension, Lorentzian manifolds are manifolds whose metric tensors g μν , μ, ν = {0, 1, …, d}, have signature (+++), meaning that if diagonalized by a proper choice of the coordinate system, these tensors have one negative entry on the diagonal, while all other entries are positive. In general relativity, Lorentzian manifolds represent relativistic spacetimes, which are solutions of Einstein’s equations. Typically, the dimension of a Lorentzian manifold is denoted by d + 1, with the “+1” referring to the temporal (zeroth) dimension, while the other d dimensions are spatial. In this paper we consider only (3 + 1)-dimensional Lorentzian manifolds, that is, manifolds of dimension equal to the dimension of our universe66. The Lorentzian metric structure naturally defines spacetime’s causal structure: timelike intervals with Δs2 < 0 connect pairs of causally related events, i.e., timelike-separated points on a manifold.

Einstein’s equations are a set of ten coupled non-linear partial differential equations:

R μ ν 1 2 R g μ ν +Λ g μ ν =8π T μ ν ,

where we use the natural units with the gravitational constant and speed of light set to unity. The Ricci curvature tensor R μν and Ricci scalar R measure the manifold curvature, the cosmological constant Λ is proportional to the dark energy density in the spacetime, and the stress-energy tensor T μν represents the matter content. Spacetimes which are homogeneous and isotropic are called Friedmann-Robertson-Walker (FRW) spacetimes, which have a metric of the form ds2 = −dt2 + a(t)2dΣ2. The time-dependent function a(t) in front of the spatial metric dΣ is called the scale factor. This function characterizes the expansion of the volume form in a spatial hypersurface with respect to time; it alone tells whether there is a “Big Bang” at t = 0, i.e., whether a(0) = 0. The scale factor is derived explicitly as a solution to the 00-component (μ = ν = 0) of (1), known as the first Friedmann equation:

( a ̇ a ) 2 = Λ 3 K a 2 + c a 3 g .

The variable g represents the type of matter in the spacetime: in this work we use the values g = {0, 1} to indicate no matter and dust matter, respectively. The spatial curvature of the spacetime is captured by K: K = {+1, 0, −1} implies positive, zero, or negative spatial curvature, respectively. Motivated by the observation that our universe is nearly flat67, in this work we use K = 0, which significantly simplifies the calculations below. In the flat case, the spatial metric, hereafter using dimensionless spherical coordinates, becomes d Σ 2 =d r 2 + r 2 d θ 2 + r 2 sin 2 θd φ 2 . Finally, c is a constant proportional to the density of matter in the universe.

The total energy density in the universe is known to come from four sources: the matter (dark and baryonic) density ρ M , the dark energy density ρΛ, the radiation energy density ρ R , and the curvature K. The densities may be rescaled by a critical density: Ω ρ / ρ c , where ρ c 3 H 0 2 / 8 π ; H 0 a ̇ 0 / a 0 is the Hubble constant and a 0 a( t 0 ), i.e., the scale factor at the present time. Similarly, the curvature density parameter may be written as Ω K K / ( a 0 H 0 ) 2 so that we obtain the state equation Ω M  + ΩΛ + Ω R  + Ω K  = 1. This allows us to rewrite (2) in the integral form68

H 0 t= 0 a / a 0 d x x Ω Λ + Ω K x 2 + Ω M x 3 + Ω R x 4 .

In the flat universe, the curvature energy density contribution is zero: Ω K  = 0. Furthermore, except for a short period in the early universe, the radiation energy density is also negligible compared to the other terms: Ω R  ≈ 0. Therefore, we study manifolds defined only by ΩΛ and Ω M : the de Sitter (dark energy only) manifold (Λ > 0, g = c = 0), the Einstein-de Sitter (dust only) manifold (Λ = 0, g = 1, c > 0), and the mixed dark energy and dust manifold (Λ, c > 0, g = 1). Hereafter, these three manifolds are respectively referred to as the energy (E), dust (D), and mixed (M) manifolds. Defining rescaled time τ = t/λ, the scale factors in these spacetimes are solutions to (3), respectively using non-zero ΩΛ, Ω M , or both:

a E (τ)=λ e τ , a D (τ)=α ( 3 2 τ ) 2/3 , a M (τ)=α sinh 2 / 3 ( 3 2 τ ) .

The parameters λ and α respectively define the temporal and spatial scales. In a de Sitter manifold, there is no distinction between temporal and spatial scales, so that there is no α, because the generators of the Lorentz group SO(1, 3) form a proper subset of those of the de Sitter group SO(1, 4), thereby removing a degree of freedom in the model. In manifolds which represent spacetimes with dust matter, this symmetry is broken, and relative rescalings between λ and α are equivalent to an isotropic rescaling of space with respect to time.

The spatial scale of a mixed manifold, such as the one approximating our real universe, arises naturally from (3) when dimensionless variables are used; it is defined as α a M ( t 0 ) ( Ω M / Ω Λ ) 1/3 , related to the relative amount of dark energy54. The scale factor a M (τ) asymptotically matches a D (τ) at earlier times (a hot, matter-dominated universe) and a E (τ) at later times (a cold, dark energy-dominated universe), so that the mixed manifold can be characterized by the dark energy density parameter ΩΛ. This way, the dark energy density is a measure of time via τ=(2/3)arctanh Ω Λ . Using the present-day value of ΩΛ,0 ≈ 0.737 in our universe gives the current rescaled cosmological time τ0 = t0/λ ≈ 0.473, so that λ sets the spacetime’s timescale69.

In the FRW spacetimes defined by (4), the scale factor and the metric tensor are used to find the volume form of the manifold:

dV= | g μ ν | dtdrdθdφ=a ( t ) 3 r 2 sinθdtdrdθdφ,

where r is the dimensionless radial coordinate and θ and ϕ are the polar and azimuthal angular coordinates. To study a particular spacetime in simulations below, it is necessary to consider its compact region, bounded by a temporal cutoff t [0, t0] and radial cutoff r [0, r0]. Using rescaled temporal and spatial cutoffs τ0 = t0/λ and ρ 0 = α ˜ r 0 , where α ˜ = α / λ , except de Sitter spacetime where ρ0 = r0, the volume of such a region in each spacetime is easily obtained via the integration of (5) within the corresponding bounds:

V E ( τ 0 , ρ 0 ) = 4 π 9 λ 4 ρ 0 3 ( e 3 τ 0 1 ) , V D ( τ 0 , ρ 0 ) = π λ 4 ρ 0 3 τ 0 3 , V M ( τ 0 , ρ 0 ) = 2 π 9 λ 4 ρ 0 3 ( sinh ( 3 τ 0 ) 3 τ 0 ) .

We will also use conformal time η, defined as η(t)= t dt/a(t), which is

η E ( τ ) = e τ , η D ( τ ) = 1 α ˜ ( 12 τ ) 1/3 , η M ( τ ) = 2 α ˜ sinh 1 / 3 ( 3 2 τ ) F 1 2 ( 1 6 , 1 2 ; 7 6 ; sinh 2 ( 3 2 τ ) ) ,

where 2F1 is the hypergeometric function. This transformation is particularly useful for distinguishing between timelike and spacelike intervals, since in these coordinates, the scale factor may be factored out: ds2 = a2(t(η)) (−2 + dΣ2), so that timelike and spacelike intervals with Δs2 < 0 and Δs2 > 0 correspond to intervals with Δη2 > ΔΣ2 and Δη2 < ΔΣ2, respectively.

Random Geometric Graphs

Given a compact region of any d-dimensional manifold , a geometric graph G (N,R) in it is a set of N nodes n = {n1, …, n N } with coordinates x = {x1, …, x N }, and undirected edges connecting pairs (n i , n j ) located at distance D(x i , x j ) < R in the manifold2. Such a graph is called a random geometric graph (RGG) when the coordinates x i are a realization of a Poisson or other random point process, thereby defining an ensemble of RGGs. Directed Lorentzian RGGs G M (N , 0 ) , also known as causal sets56, “converge” to Lorentzian manifolds in the thermodynamic limit N → ∞, since the causal structure alone is enough to recover the topology of a Lorentzian manifold70, 71. While the simplest base (open sets) of the manifold topology in the Riemannian case are open balls, this base in the Lorentzian case are Alexandroff sets, which are intersections of past and future light cones of points in the manifold72, 73. Therefore, an undirected Lorentzian RGG is constructed by Poisson sprinkling points onto , and then linking those pairs which are timelike separated, hence R = 0.


Constructing Random Geometric Graphs in Lorentzian Manifolds

We construct RGGs in Lorentzian manifolds by sampling three spatial and one temporal coordinates for N nodes in a particular region using a Poisson point process: N is a random variable sampled from the Poisson distribution with mean N ¯ , giving a sprinkling density δN/V. Given volumes (6), and using the rescaled sprinkling density q = δλ4, the numbers of nodes in the three spacetimes are given by

N E ( τ 0 , ρ 0 ) = 4 π 9 q ρ 0 3 ( e 3 τ 0 1 ) , N D ( τ 0 , ρ 0 ) = π q ρ 0 3 τ 0 3 , N M ( τ 0 , ρ 0 ) = 2 π 9 q ρ 0 3 ( sinh ( 3 τ 0 ) 3 τ 0 ) ,

where all the parameters q, ρ0, τ0 are dimensionless. The distributions P(t), P(r), P(θ), and P(ϕ) used to sample the coordinates are found in (4, 5) by comparing it to the volume form dV = χ(t)χ(r)χ(θ)χ(ϕ)dtdrdθdϕ, where χ’s are the non-normalized density functions, χ(t) = a(t)3, χ(r) = r2, χ(θ) = sinθ, χ(ϕ) = 1, and χ()P() upon normalization, i.e., P(t)=χ(t)/ 0 t 0 χ(t)dt, for instance. A pair of nodes (n i , n j ) is timelike related and, therefore, linked in the resulting graph if the following inequality is true:

Δ Σ i j 2 = r i 2 + r j 2 2 r i r j (cos θ i cos θ j +sin θ i sin θ j cos( φ i φ j ))< ( η i η j ) 2 ,

where the law of cosines has been used for the spatial distance ΔΣ ij between the two nodes in three dimensions. Figure 1 visualizes a random geometric graph in (1 + 1)-dimensional de Sitter spacetime, where Δ Σ i j 2 = ( θ i θ j ) 2 instead of (9).

Figure 1
Figure 1

Random geometric graph in (1 + 1)-dimensional de Sitter spacetime. The graph is realized by Poisson sprinkling 700 nodes onto a (1 + 1)-dimensional de Sitter manifold, with compact spatial foliation by circles, which are hypersurfaces of constant time. The temporal cutoff is τ 0 = 5.94, which is the radius of the disk shown. In the figure, the graph has been mapped from the de Sitter manifold to a disk of this radius by equating the time coordinates of all points in de Sitter spacetime with the radial coordinates in the shown disk. A pair of nodes, shown in yellow, is chosen and their light cones are shown in gray and green. The yellow nodes are connected to all other nodes that happen to lie in their corresponding light cones. In particular, the yellow nodes are connected to each other since they lie within each other’s light cones. The overlap between the past and future light cones of the higher-t and lower-t yellow nodes respectively, shown in orange, is their Alexandroff set. The full set of grey links is obtained by iterating over all node pairs.

In simulations in the next section, we will also need to generate graphs with a given average degree. To find the expected average degree in RGGs in our Lorentzian regions, we observe that the volume of the past and future light cones emanating from any given node, and bounding regions timelike-related to the node, is directly proportional, with the proportionality coefficient 1/δ, to the expected number of sprinkled nodes in them, and consequently, to the expected past and future degrees of the node. Integrating the expressions for these volumes, weighted by the node density in the space, over the entire region provides a theoretical expression for the expected degree as a function of the rescaled sprinkling density q = δλ4 and the rescaled temporal cutoff τ0 = t0/λ, we get:

k ¯ E ( τ 0 ) = 4 π q 9 ( e τ 0 1 ) ( 13 e τ 0 ( 14 13 e τ 0 ) ) + 6 τ 0 ( e 3 τ 0 + 1 ) 1 e 3 τ 0 , k ¯ D ( τ 0 ) = 18 π q 385 τ 0 4 , k ¯ M ( τ 0 ) = 8 π q sinh ( 3 τ 0 ) 3 τ 0 0 τ 0 d τ 0 τ 0 d τ sinh 2 ( 3 τ 2 ) sinh 2 ( 3 τ 2 ) | η ˜ M ( τ ) η ˜ M ( τ ) | 3 ,

where rescaled conformal time η ˜ α ˜ η is used for convenience. These expressions do not depend on spatial cutoff ρ0 because they are approximations for spatially large regions with ρ 0 τ 0 , so that boundary effects, i.e., the contributions to the average degree from nodes with ρs close to ρ0, are negligible.

It is evident from the exposition above including (8, 10) that the only three out of the original five parameters defining the RGG ensemble with N nodes and average degree k ¯ —sprinkling density δN/V, temporal scale λ, spatial scale α, and temporal and spatial cutoffs t0 and r0—are independent because N depends only three dimensionless parameters, q, ρ0, and τ0, while k ¯ depends only on two, q and τ0. This is because sprinkling density δ sets the discreteness scale, which can be rescaled by λ: two graph ensembles with different δs and λs are the same if their rescaled sprinkling density q = δλ4 is the same. Similarly, two graph ensembles with different λs and t0s are the same if their τ0s are the same, and two graph ensembles, and even spacetime regions, with different αs and r0s are the same if their ρ0s are the same. Therefore, parameters q,ρ0,τ0 form one natural choice of independent parameters, the one we use in simulations below. Yet any three independent functions of these parameters is an equivalent choice. In particular, N and k ¯ are two such independent functions, so that N, k ¯ , τ0 is another choice of parameters that we also use in simulations. Yet we note that one parameter in these two sets of three parameters is not entirely independent, because the spatial cutoff ρ0 must be such that ρ 0 τ 0 , so that the spatial boundary effects are negligible, and approximations (10) are valid, see Fig. 2 and Methods.

Figure 2
Figure 2

Graph size and average degree as functions of the cutoff time. The figure shows the graph size N and average degree k ¯ in simulations versus theoretical predictions, the solid curves, given by (8, 10), for the constant rescaled sprinkling density q = 60 and spatial cutoff ρ 0 = 6.

Navigability of Random Geometric Graphs in Lorentzian Manifolds

The navigability of a geometric graph is the efficiency of greedy geometric path finding in it. This path finding strategy uses only local nearest-neighbor information to find a path in the graph between a given source node and a given destination node. Starting with the source node, the next node on the path is determined as the node’s neighbor closest to the destination node according to geodesic distances in the manifold. When the closest neighbor has already been visited, the greedy path enters a loop. It does not reach the destination and is thus unsuccessful. This situation occurs when the two nodes forming the loop, also called a local minimum, do not have any third node that would be closer to the destination than the two nodes. The success ratio p s is defined as the fraction of greedy paths which successfully reach their destination, across a given set of source-destination node pairs in the graph. Here we select N such pairs uniformly at random, where N is the graph size. Increasing the number of pairs above N does not noticeably affect the results, as can be seen from Fig. S1. Another navigability metric is the stretch. The stretch of a successful greedy path is the ratio of the length of the path, measured as the number of hops, to the length of the shortest path between the same source and destination in the graph. The average stretch is the average of this quantity across successful paths between a given set of source-destination node pairs.

The geodesic distance between a pair of nodes on the underlying manifold is found by integrating the geodesic differential equations: 2 x μ σ 2 + Γ ν ρ μ x ν σ x ρ σ =0, with μ, ν, ρ = {0, 1, 2, 3}, where xμ(σ) = (t(σ), r(σ), θ(σ), ϕ(σ)) is a geodesic curve in four dimensions parameterized by an affine parameter σ, and Γ ρ ν μ = 1 2 g μ β ( g β ν x ρ + g β ρ x ν g ν ρ x β ) , with β = {0, 1, 2, 3}, are the Christoffel symbols which specify the affine connections in a curved space. The convention of summation over repeating indices is assumed. For a pair of nodes with temporal coordinates t1 and t2 and spatial distance ΔΣ1,2, the integration of this equation yields the geodesic distance:

d 1,2 = t 1 t 2 | ψ a 2 ( t ) 1 + ψ a 2 ( t ) | dt, Δ Σ 1,2 = t 1 t 2 ( a 2 ( t ) + ψ a 4 ( t ) ) 1/2 dt,

where the parameter ψ is found by solving the second transcendental equation numerically.

As opposed to Riemannian manifolds, Lorentzian manifolds can be geodesically incomplete, i.e., there can exist pairs of spacelike separated points between which a geodesic does not exist74. For such geodesically disconnected source-destination pairs, geodesic distances and consequently geodesic routing are undefined, so that we exclude such pairs from our calculations. The percentages of geodesically disconnected node pairs in random graphs in the experiments below are reported in Fig. S2.

Figure 3(a,b) show that if the dimensionless sprinkling density q is held constant as the temporal cutoff increases, the success ratio p s increases to 100% in all the three manifolds, while the average stretch remains low and close to its minimum value 1, especially in the manifolds with dark energy. However, the average degree grows quickly with the temporal cutoff in this case, Eq. (10) and Fig. 2, and the success ratio and stretch depend both on the manifold geometry and on the average degree. Indeed, all other things equal, e.g., the same patch of the same manifold with the same spatial and temporal cutoff, the higher the average degree, the higher the navigability, i.e., the higher the success ratio and the lower the stretch, because the larger the number of neighbors that each node has, the higher the chances that the node has a neighbor that does not lead to a loop, and the higher the chances that the next-hop neighbor is closer to the geodesic to the destination in the manifold, thus minimizing the stretch.

Figure 3
Figure 3

Navigability of random geometric graphs in the three manifolds. In (a,b), corresponding to graphs in panels (a,b) in Fig. 2 where the sprinkling density and spatial cutoff are held constant q = 60 and ρ 0 = 6, the success ratio increases toward 100% as the temporal cutoff increases, while the average stretch remains low and close to 1, especially for spacetimes with dark energy. In (c,d), the graph size and average degree are kept constant N = 220 and k ¯ =10 as described in the Methods. The success ratio and stretch in this case depend only on manifold geometry. The average stretch is still low, especially for the manifolds with dark energy. However, the success ratio increases to 100% only for spacetimes with dark energy, while for the dust manifold it is a constant below 100%, which does not depend on the cutoff time.

To disentangle the dependency of navigability on manifold geometry from its dependency on the graph properties, the average degree and graph size, we select for different temporal cutoffs, different sprinkling densities and spatial cutoffs such that the average degree and graph size stay constant as the temporal cutoff increases, see the Methods. In this case, the navigability metrics depend only on the geometry of the manifold.

The results in Fig. 3(c,d) show that in this case, while the average stretch remains low, especially in the manifolds with dark energy, the success ratio depends strongly on the presence of dark energy in the spacetime. In spacetimes with dark energy, the success ratio still quickly reaches 100%, while in the dust-only spacetime, it is a constant below 100%, i.e., does not increase with time.

We thus conclude that unless dark energy is present, random graphs in Lorentzian geometries are not navigable as their success ratio is a constant below 100%, independent of the temporal cutoff. Only in spacetimes with dark energy and asymptotically de Sitter geometry, the success ratio quickly reaches its maximum value of 100%, so that such spacetimes, including the spacetime of our universe, are fully navigable with respect to all geodesically connected pairs of nodes. This result deserves a discussion.


The navigability of random hyperbolic graphs and real networks is the higher, the lower the power-law degree distribution exponent γ, and the stronger the clustering45, 48. Clustering in Lorentzian random geometric graphs considered here is not so strong, Fig. S3, primarily because of their higher dimensionality1, 40 (3 + 1 versus 1 + 1) and small cut-off times, but the tails of the degree distributions in the graphs in the manifolds with dark energy follow power laws in the full agreement with the earlier results54 showing that random geometric graphs in asymptotically de Sitter spacetimes have double power-law degree distributions with γ = 3/4 at low degrees k < q and γ → 2 at high degrees k > q. We note however that those results were derived only for the two limits of τ 0 1 and τ 0 1.

More interestingly, as evident from Fig. 1, hubs, i.e., high-degree nodes, in random geometric graphs in Lorentzian manifolds are not densely interconnected, Fig. S5, versus random hyperbolic graphs and real networks exhibiting strong rich club effects55, 75. This hub disconnectedness is a characteristic feature of any Lorentzian random geometric graphs because nodes of similar degrees in them have similar time coordinates, and thus tend to be not connected since they do not lie within each other’s light cones with high probability. This observation may be puzzling, as it brings up the question of how Lorentzian graphs can be navigable at all, since one might intuitively think that geometric routing paths must go through the network core48, and if the hubs in this core are not all densely interconnected, then routing would fail with high probability.

This intuition turns out to be wrong, and the resolution of this puzzle lies in that the structure of geometric routing paths in Lorentzian graphs is completely different from the one in Riemannian graphs45, 48. Specifically, the Lorentzian path structure exhibits a peculiar periphery-core zigzagging pattern illustrated in Fig. S6. This pattern, in which subsequent hops tend to lie close to light cone boundaries, is caused by a completely different nature of Lorentzian geometry and the structure of geodesics in it, versus the Riemannian case, making the graphs navigable even though their cores are sparse.

As a final remark, this navigation pattern also shows that navigability of directed causal sets based on random geometric graphs in Lorentzian manifolds is not so interesting. If links are directed in the past → future time direction, then geometric routing respecting link direction and starting from a given source node succeeds only for destination nodes lying in the future light cone of the source. All such destinations are directly connected to the source. Navigation fails for any other source-destination pairs, including all spacelike-separated pairs of nodes, because paths between them necessarily involve hops in the future → past direction.


Parameter range selection

As discussed in the main text, the three parameters of the studied graph ensembles are the rescaled sprinkling density q = δλ4, (rescaled) spatial cutoff ρ0 = (α/λ)r0 (ρ0 = r0 in de Sitter spacetime), and rescaled cutoff time τ0 = t0/λ, which taken together determine the graph size N and average degree k ¯ via (8, 10). In simulations, especially in navigability experiments, we have the following constraints: (1) the graphs cannot be too large so that they fit into memory, N < ˜ 2 21 ; (2) the average degree cannot be too low so that the graphs are above the percolation threshold, k ¯ > ˜ 5; (3) the spatial cutoff must be sufficiently larger than the temporal cutoff, so that the spatial boundary effects are negligible and we can rely on (10); (4) we want to explore the most interesting region of τ0 ~ 1, corresponding to the rescaled dark energy density ΩΛ changing over essentially an entire range of its values between 0 and 1.

In experiments with constant q = 60, Figs 2 and 3(a,b), we select constant ρ0 = 6 such that the average degree observed in simulations is within the error bound of 5% from (10) for the largest considered value of τ0 > 1. This largest value of τ0 and the value of q = 60 are determined in turn by the rest of the constraints above—decreasing q would decrease the graph sizes, but would also decrease the average degree. The largest considered value of τ0 correspond to the largest graph sizes that fit into the memory, while the lowest value of τ0 is determined by the average degree value just above the percolation threshold.

In experiments with constant k ¯ =10 and N = 220, Fig. 3(c,d), q and ρ0 as functions of τ0 are varied as solutions of the systems of equations (8 and 10), Fig. 4. For all the considered values of temporal cutoff τ0, the spatial cutoff ρ0 is sufficiently larger than τ0, so that the average degree is within the 5% error bound from its theoretical fixed value k ¯ =10, except for the largest value of τ0 = 4.64, where the average degrees in the de Sitter and mixed manifold cases are 8.13 and 8.48, respectively.

Figure 4
Figure 4

Rescaled sprinkling density and spatial cutoff as functions of the temporal cutoff in Fig. 3(c,d).

The non-monotonic dependency of the success ratio p s on the cutoff time τ0 in the dark energy manifold in Fig. 3(c) is likely due to an interplay between increasing τ0, tending to increase p s , and decreasing q, Fig. 4(a), tending to decrease p s , in the absence of spacetime singularity at τ0. The exact reason why this interplay is not important in the other two spacetimes that have this singularity is unclear. The non-monotonic behavior of stretch in Fig. 3(b,d) is not surprising, since stretch is computed for successful paths only, whose percentages vary as shown in Fig. 3(a,c). In particular, we have verified that the stretch increase in spacetimes with dark energy for the largest value of τ0 in Fig. 3(d) is not due a below-the-borderline value of ρ0: we have densely sampled the region of τ 0 [1.6,4.5] (not shown), and found that the intermediate stretch values for these two manifolds lie on smooth curves connecting the two shown data points, while for most of these intermediate values of τ0, the value of ρ0 is above the 5% k ¯ -accuracy borderline discussed above.

Statistics, simulations

All the data shown in Figs 2 and 3 are averaged over ten random graphs if N < 220, over five graphs if N = 220, or over three graphs if N > 220. All the error bars in these figures are smaller than the symbol sizes. To generate graphs efficiently, we use OpenMP to generate node coordinates in parallel. Nodes are then linked using an NVIDIA K20m GPU via the CUDA library, since this step is the slowest when N is large. While the linking algorithm is still O(N2), GPU parallelization offers a speedup of several orders of magnitude.

Additional Information

Publisher's note: Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.


  1. 1.

    Dall, J. & Christensen, M. Random geometric graphs. Phys. Rev. E 66, 016121 (2002).

  2. 2.

    Penrose, M. Random Geometric Graphs (Oxford University Press, Oxford, 2003).

  3. 3.

    Spodarev, E. (ed.) Stochastic Geometry, Spatial Statistics and Random Fields: Asymptotic Methods (Springer, Heidelberg, 2013).

  4. 4.

    Costa, A., Farber, M. & Horak, D. Fundamental groups of clique complexes of random graphs. Trans. London Math. Soc. 2, 1–32 (2015).

  5. 5.

    Hausmann, J.-C. On the Vietoris-Rips complexes and a cohomology theory for metric spaces. In Prospects in topology: Proceedings of a conference in honor of William Browder (Princeton University Press, Princeton, 1995).

  6. 6.

    Kahle, M. Random Geometric Complexes. Discrete Comput. Geom. 45, 553–573 (2011).

  7. 7.

    Latschev, J. Vietoris-Rips complexes of metric spaces near a closed Riemannian manifold. Arch. der Math. 77, 522–528 (2001).

  8. 8.

    Serrano, M. Á., Boguñá, M. & Sagués, F. Uncovering the hidden geometry behind metabolic networks. Mol. Biosyst. 8, 843 (2012).

  9. 9.

    Kleineberg, K.-K., Boguñá, M., Ángeles Serrano, M. & Papadopoulos, F. Hidden geometric correlations in real multiplex networks. Nat. Phys. 12, 1076–1081 (2016).

  10. 10.

    Allard, A., Serrano, M. Á., García-Pérez, G. & Boguñá, M. The geometric nature of weights in real complex networks. Nat. Commun. 8, 14103 (2017).

  11. 11.

    Bianconi, G. Interdisciplinary and physics challenges of network theory. Europhys. Lett. 111, 56001 (2015).

  12. 12.

    Ostilli, M. & Bianconi, G. Statistical mechanics of random geometric graphs: Geometry-induced first-order phase transition. Phys. Rev. E 91, 042136 (2015).

  13. 13.

    Bianconi, G., Rahmede, C. & Wu, Z. Complex quantum network geometries: Evolution and phase transitions. Phys. Rev. E 92, 022815 (2015).

  14. 14.

    Wu, Z., Menichetti, G., Rahmede, C. & Bianconi, G. Emergent Complex Network Geometry. Sci. Rep. 5, 10073 (2015).

  15. 15.

    Bianconi, G. & Rahmede, C. Network geometry with flavor: From complexity to quantum geometry. Phys. Rev. E 93, 032315 (2016).

  16. 16.

    Bianconi, G. & Rahmede, C. Emergent Hyperbolic Network Geometry. Sci. Rep. 7, 41974 (2017).

  17. 17.

    Zhang, W., Lim, C. C., Korniss, G. & Szymanski, B. K. Opinion Dynamics and Influencing on Random Geometric Graphs. Sci. Rep. 4, 5568 (2014).

  18. 18.

    Newman, M. E. J. & Peixoto, T. P. Generalized Communities in Networks. Phys. Rev. Lett. 115, 088701 (2015).

  19. 19.

    Henderson, J. A. & Robinson, P. A. Geometric Effects on Complex Network Structure in the Cortex. Phys. Rev. Lett. 107, 018102 (2011).

  20. 20.

    Roberts, J. A. et al. The contribution of geometry to the human connectome. Neuroimage 124, 379–393 (2016).

  21. 21.

    Javarone, M. A. & Armano, G. Perception of similarity: a model for social network dynamics. J. Phys. A Math. Theor. 46, 455102 (2013).

  22. 22.

    Xie, Z., Ouyang, Z., Zhang, P., Yi, D. & Kong, D. Modeling the Citation Network by Network Cosmology. PLoS One 10, e0120687 (2015).

  23. 23.

    Xie, Z., Zhu, J., Kong, D. & Li, J. A random geometric graph built on a time-varying Riemannian manifold. Physica A 436, 492–498 (2015).

  24. 24.

    Jin, X., Jin, C., Huang, J. & Min, Y. Coupling effect of nodes popularity and similarity on social network persistence. Sci. Rep. 7, 42956 (2017).

  25. 25.

    Clough, J. R. & Evans, T. S. What is the dimension of citation space? Physica A 448, 235–247 (2016).

  26. 26.

    Clough, J. R. & Evans, T. S. Embedding Graphs in Lorentzian Spacetime arXiv:1602.03103 (2016).

  27. 27.

    Asta, D. & Shalizi, C. R. Geometric Network Comparison. In UAI’15 Proc. Thirty-First Conf. Uncertain. Artif. Intell., 102–110 arXiv:1411.1350 (AUAI Press, Arlington, VA, 2015).

  28. 28.

    Gugelmann, L., Panagiotou, K. & Peter, U. Random Hyperbolic Graphs: Degree Sequence and Clustering. In Czumaj, A., Mehlhorn, K., Pitts, A. & Wattenhofer, R. (eds) Autom. Lang. Program. (ICALP 2012, Part II), LNCS 7392, 573–585 (Springer, Berlin, Heidelberg, 2012).

  29. 29.

    Fountoulakis, N. On a geometrization of the Chung–Lu model for complex networks. J. Complex Networks 3, 361–387 (2015).

  30. 30.

    Bode, M., Fountoulakis, N. & Müller, T. On the Largest Component of a Hyperbolic Model of Complex Networks. Electron. J. Comb. 22, P3.24 (2015).

  31. 31.

    Candellero, E. & Fountoulakis, N. Bootstrap percolation and the geometry of complex networks. Stoch. Process. their Appl. 126, 234–264 (2016).

  32. 32.

    Candellero, E. & Fountoulakis, N. Clustering and the Hyperbolic Geometry of Complex Networks. Internet Math. 12, 2–53 (2016).

  33. 33.

    Abdullah, M. A., Bode, M. & Fountoulakis, N. Typical distances in a geometric model for complex networks arXiv:1506.07811 (2015).

  34. 34.

    Fountoulakis, N. & Müller, T. Law of large numbers for the largest component in a hyperbolic model of complex networks arXiv:1604.02118 (2016).

  35. 35.

    Bringmann, K., Keusch, R. & Lengler, J. Geometric Inhomogeneous Random Graphs arXiv:1511.00576 (2015).

  36. 36.

    Bringmann, K., Keusch, R. & Lengler, J. Average Distance in a General Class of Scale-Free Networks with Underlying Geometry arXiv:1602.05712 (2016).

  37. 37.

    Bringmann, K., Keusch, R., Lengler, J., Maus, Y. & Molla, A. Greedy Routing and the Algorithmic Small-World Phenomenom arXiv:1612.05539 (2016).

  38. 38.

    Bradonjić, M., Elsässer, R., Friedrich, T., Sauerwald, T. & Stauffer, A. Efficient Broadcast on Random Geometric Graphs. In Proc. Twenty-First Annu. ACM-SIAM Symp. Discret. Algorithms, 1412–1421 (SIAM, Philadelphia, PA, 2010).

  39. 39.

    Bubeck, S., Ding, J., Eldan, R. & Rácz, M. Testing for high-dimensional geometry in random graphs arXiv:1411.5713 (2014).

  40. 40.

    Dhara, S., van Leeuwaarden, J. S. H. & Mukherjee, D. Solvable random network model for disordered sphere packing arXiv:1611.05019 (2016).

  41. 41.

    Friedrich, T. & Krohmer, A. Cliques in hyperbolic random graphs. In 2015 IEEE Conf Comput Commun (INFOCOM), vol. 26, 1544–1552 (IEEE, 2015).

  42. 42.

    Friedrich, T. & Krohmer, A. On the Diameter of Hyperbolic Random Graphs. In ICALP, 614–625 (2015).

  43. 43.

    Bläsius, T., Friedrich, T. & Krohmer, A. Hyperbolic Random Graphs: Separators and Treewidth. In Eur Symp Algorithms, 15:1–15:15 (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2016).

  44. 44.

    Penrose, M. Connectivity of soft random geometric graphs. Ann. Appl. Probab. 26, 986–1028 (2016).

  45. 45.

    Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A. & Boguñá, M. Hyperbolic Geometry of Complex Networks. Phys Rev E 82, 36106 (2010).

  46. 46.

    Papadopoulos, F., Kitsak, M., Serrano, M. Á., Boguñá, M. & Krioukov, D. Popularity versus similarity in growing networks. Nature 489, 537–540 (2012).

  47. 47.

    Zuev, K., Boguñá, M., Bianconi, G. & Krioukov, D. Emergence of Soft Communities from Geometric Preferential Attachment. Sci. Rep. 5, 9421 (2015).

  48. 48.

    Boguñá, M., Krioukov, D. & Claffy, K. Navigability of Complex Networks. Nat. Phys. 5, 74–80 (2009).

  49. 49.

    Boguñá, M. & Krioukov, D. Navigating Ultrasmall Worlds in Ultrashort Time. Phys Rev Lett 102, 58701 (2009).

  50. 50.

    Kleinberg, J. Navigation in a Small World. Nature 406, 845 (2000).

  51. 51.

    Boguñá, M., Papadopoulos, F. & Krioukov, D. Sustaining the Internet with Hyperbolic Mapping. Nat. Commun. 1, 62 (2010).

  52. 52.

    Lehman, V. et al. An experimental investigation of hyperbolic routing with a smart forwarding plane in NDN. In 2016 IEEE/ACM 24th Int. Symp. Qual. Serv., 1–10 (IEEE, 2016).

  53. 53.

    Gulyás, A., Bíró, J. J., Körösi, A., Rétvári, G. & Krioukov, D. Navigable networks as Nash equilibria of navigation games. Nat. Commun. 6, 7651 (2015).

  54. 54.

    Krioukov, D. et al. Network cosmology. Sci. Rep. 2, 793 (2012).

  55. 55.

    Boccaletti, S., Latora, V., Moreno, Y., Chavez, M. & Hwanga, D.-U. Complex Networks: Structure and Dynamics. Phys Rep 424, 175–308 (2006).

  56. 56.

    Bombelli, L., Lee, J., Meyer, D. & Sorkin, R. D. Space-time as a causal set. Phys. Rev. Lett. 59, 521–524 (1987).

  57. 57.

    Albrecht, A. et al. Report of the Dark Energy Task Force. Rep. Dark Energy Task Force (2006).

  58. 58.

    Sorkin, R. D. Is the cosmological “constant” a nonlocal quantum residue of discreteness of the causal set type? In Rajantie, A., Contaldi, C., Dauncey, P. & Stoica, H. (eds) AIP Conf. Proc., vol. 957, 142–153 (AIP, College Park, 2007).

  59. 59.

    Weinberg, S. Anthropic Bound on the Cosmological Constant. Phys Rev Lett 59, 2607–2610 (1987).

  60. 60.

    Garriga, J., Livio, M. & Vilenkin, A. Cosmological constant and the time of its dominance. Phys Rev D 61, 023503 (1999).

  61. 61.

    Arkani-Hamed, N., Hall, L., Kolda, C. & Murayama, H. New perspective on cosmic coincidence problems. Phys Rev Lett 85, 4434–7 (2000).

  62. 62.

    Bousso, R. Holographic Probabilities in Eternal Inflation. Phys Rev Lett 97, 191302 (2006).

  63. 63.

    Bousso, R., Freivogel, B., Leichenauer, S. & Rosenhaus, V. A Geometric Solution to the Coincidence Problem, and the Size of the Landscape as the Origin of Hierarchy. Phys. Rev. Lett. 106, 101301 (2011).

  64. 64.

    Barrow, J. & Shaw, D. New Solution of the Cosmological Constant Problems. Phys Rev Lett 106, 101302 (2011).

  65. 65.

    Harlow, D., Shenker, S., Stanford, D. & Susskind, L. Tree-like structure of eternal inflation: A solvable model. Phys Rev D 85, 063516 (2012).

  66. 66.

    Tegmark, M. On the dimensionality of spacetime. Class. Quantum Gravity 14, L69–L75 (1997).

  67. 67.

    Komatsu, E. et al. Seven-year Wilkinson microwave anisotropy probe (WMAP) observations: Cosmological interpretation. Astrophys. J. Suppl. S. 192 (2011).

  68. 68.

    Weinberg, S. Cosmology (Oxford University Press, New York, 2008).

  69. 69.

    Astier, P. et al. The supernova legacy survey: Measurement of Ω M , ΩΛ and w from the first year data set. Astron. Astrophys. 447, 31–48 (2006).

  70. 70.

    Hawking, S. W., King, A. R. & McCarthy, P. J. A new topology for curved space-time which incorporates the causal, differential, and conformal structures. J. Math. Phys. 17, 174–181 (1976).

  71. 71.

    Malament, D. B. The class of continuous timelike curves determines the topology of spacetime. J. Math. Phys. 18, 1399 (1977).

  72. 72.

    Alexandroff, P. Diskrete räume. Rec. Math. [Mat. Sbornik] N.S. 2(44), 501–519 (1937).

  73. 73.

    Kronheimer, E. H. & Penrose, R. On the structure of causal spaces. Proc. Camb. Philos. Soc. 63, 481–501 (1967).

  74. 74.

    O’Neill, B. Semi-Riemannian Geometry with Applications to Relativity (Academic Press, San Diego, 1983).

  75. 75.

    Zhou, S. & Mondragon, R. The Rich-Club Phenomenon in the Internet Topology. IEEE Commun. Lett. 8, 180–182 (2004).

Download references


We thank Alexander Vilenkin, Jaume Garriga, Ken Olum, Jiří Podolský, David Rideout, and Michel Buck for useful discussions. This work was supported by NSF grants Nos CNS-1442999 and CCF-1212778; and by ARO grant No. W911NF-16-1-0391.

Author information


  1. Department of Physics, Northeastern University, 360 Huntington Ave., Boston, MA, 02115, United States

    • William Cunningham
  2. Department of Computing and Mathematical Sciences, California Institute of Technology, 1200 E. California Blvd., Pasadena, CA, 91125, United States

    • Konstantin Zuev
  3. Department of Physics, Department of Mathematics, Department of Electrical & Computer Engineering, Northeastern University, 360 Huntington Ave., Boston, MA, 02115, United States

    • Dmitri Krioukov


  1. Search for William Cunningham in:

  2. Search for Konstantin Zuev in:

  3. Search for Dmitri Krioukov in:


D.K. and K.Z. designed research; W.C. and K.Z. performed research; W.C. and D.K. wrote the manuscript; all authors discussed the results and reviewed the manuscript.

Competing Interests

The authors declare that they have no competing interests.

Corresponding author

Correspondence to William Cunningham.

Electronic supplementary material


By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.

Creative Commons BY

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit