Dynamical dimensional reduction in toy models of 4D causal quantum gravity

Dynamical dimensional reduction in toy models of 4D causal quantum gravity


In recent years several approaches to quantum gravity have found evidence for a scale dependent spectral dimension of space-time varying from four at large scales to two at small scales of order of the Planck length. The first evidence came from numerical results on four-dimensional causal dynamical triangulations (CDT) [Ambjørn et al., Phys. Rev. Lett. 95 (2005) 171]. Since then little progress has been made in analytically understanding the numerical results coming from the CDT approach and showing that they remain valid when taking the continuum limit. Here we argue that the spectral dimension can be determined from a model with fewer degrees of freedom obtained from the CDTs by “radial reduction”. In the resulting “toy” model we can take the continuum limit analytically and obtain a scale dependent spectral dimension varying from four to two with scale and having functional behaviour exactly of the form which was conjectured on the basis of the numerical results.


I Introduction

The quest to reconcile classical general relativity and quantum mechanics has a long history. One of the main difficulties is the fact that gravity is perturbatively non-renormalizable in four dimensions as was shown by ’t Hooft and Veltman in the seventies (1). However, defining quantum gravity non-perturbatively, there is evidence from different approaches that there might still be a non-trivial ultraviolet fixed-point as suggested by Weinberg (2). The causal dynamical triangulation (CDT) approach to quantum gravity (see (3) and (4) for a review) recently gave a surprising answer to what dynamical mechanism might regulate the theory at short distances in such a scenario. In particular, numerical simulations (5) show evidence for the dynamical reduction of the spectral dimension from four at large scales to two at small scales of order of the Planck length (see also (6) for a discussion in a three-dimensional setting). More recently similar results have also been observed in other approaches to quantum gravity, most notably the exact renormalization group approach (7) and Hořava-Lifshitz gravity (8). This also points towards several possible relations between those approaches (9).

Ii Previous numerical insights from four-dimensional CDT

The idea behind the spectral dimension as a scale dependent measure of dimensionality is the following. Consider a diffusion process on a fixed space-time geometry. The diffusion kernel is determined by the diffusion equation


where denotes the space-time metric, the starting point of the diffusion and the position of the diffusion process after time . We can then define the return probability (density) by choosing starting and end point equal and integrating over all positions


with . If we consider diffusion on quantum space-time we would have to take the ensemble average, formally defined using the gravitational path integral


where is the partition function and the Euclidean Einstein Hilbert action. Formally, the scale dependent spectral dimension is then defined as (5)


where is the diffusion time and corresponds to the scale at which the diffusion process probes the quantum geometry.

The set of four-dimensional rooted causal triangulations consists of all graphs of topology made of (4,1) and (3,2)-simplices connecting vertices at distance to vertices at distance from the root, see Figure 1 (10). is partly characterised by the number of -simplices, , it contains; as well as two different four-simplices, there are three different types of three-simplices and two different types of triangles and links (i.e. space-like and time-like). These ten quantities are related by seven topological constraints so only three are independent (10). In the CDT approach the gravitational partition function is defined as


where is a combinatorial symmetry factor and the Euclidean Einstein-Regge action of the triangulation is


Here is the bare cosmological constant and is the bare inverse Newton’s constant.

To compute the spectral dimension one should evaluate (3) using the partition function (5) and then take the infinite volume limit in which is tuned towards its critical value and is expressed in terms of the inverse renormalized Newton’s constant . At present this is analytically out of reach but Monte Carlo simulations of random walks (discrete diffusion) on four-dimensional CDTs of fixed (5) yield a scale dependent spectral dimension given by


A possible objection to (7) is that the simulations are inevitably affected by finite size effects and the dimensional reduction observed might simply be an artefact of the discreteness scale. However, assuming that this expression can be extrapolated to continuum physics, the return probability (density) (3) for four-dimensional CDT in the infinite volume limit (5) would be


where “” denotes equality up to multiplicative logarithmic corrections.

Figure 1: The two building blocks of four-dimensional CDT; The (4,1) and (3,2) simplex are on the left and right respectively. Dotted lines correspond to 3 simplices.

Iii Random walk on CDT

The strict sliced structure of CDT graphs implies that every step in a random walk either moves in the time-like direction or to a neighbouring vertex in the same spatial hypersurface. We can then consider a projection of the random walk in which it is viewed as one-dimensional (in the time direction) with biases caused by the connectivity between adjacent hypersurfaces and a delay in the diffusion time caused by excursions into the spatial hypersurface. The delays will generally be different for each visit to a given hypersurface but if the number of space-like edges attached to any vertex is bounded by a finite number then the delay time will be finite and the detailed structure of the spatial hypersurfaces cannot affect the spectral dimension – it can only produce a finite rescaling of the time variable. For the 2d CDT, where there are exactly two space-like edges attached to each vertex, this intuition has been turned into a rigorous argument (11). The spectral dimension of a 2d CDT graph is bounded above by that of the multigraph obtained from radial reduction of the full graph which maps all vertices in at a fixed graph distance from the root to a single vertex while retaining all time-like edges (see Figure 2). Denoting the number of time-like edges connecting vertex to vertex by , is characterised by the sequence . The partition function (5) induces a measure for which defines the multigraph ensemble.

There are two relevant characteristics which determine the spectral dimension of ; the growth in the number of time-like edges with distance from the root and the behaviour of the electrical resistance of the graph viewed as an electrical network (12); (13); (11). In the 2d case the multigraphs have , so the CDTs have and it is believed, although not proven, that . Here we pursue this intuition and show that it can account for the behaviour of the spectral dimension observed in numerical simulations of 4d CDT in the physical phase where vertices of arbitrarily high degree are not seen (9). In essence we argue that a reduced, or “toy”, model based on an ensemble of multigraphs obtained from radial reduction of the CDTs carries all the information about spectral dimension; it does not of course carry information about everything else as many degrees of freedom have been integrated out.

Figure 2: An example of a multigraph.

Iv Multigraphs as toy models for causal quantum gravity

The measure of the multigraph ensemble related to four-dimensional CDT is not known analytically; instead we will show that to determine the spectral dimension it is sufficient to introduce three assumptions concerning the volume and resistance growth in this measure.

Computer simulations in four-dimensional CDT (14) show that for a graph with maximum distance from the root the number of 4-simplices is so the average number of time-like edges is bounded by


We will assume that the expectation of the number of time-like edges takes the form


where “” denotes equality up to a multiplicative constant and can be taken arbitrarily small. (The use of here is for purely technical reasons and for all practical purposes one can think of it as being zero.) It follows from (10) that there are positive constants such that


which is consistent with (9). The sub-leading term is absent in (10) as to survive the continuum limit it would have to couple with , which in turn would imply its appearance in the Euclidean Einstein-Regge action. Our other assumptions concern the size of the fluctuations in . Defining the resistance from a vertex at distance to infinity to be , we assume


at large for almost all graphs of the ensemble. In other words, the above bounds are obeyed by any typical configuration, such as those obtained from self-averaging in the computer simulations. Upward fluctuations in are controlled by (13) and downward fluctuations by (12) and and are functions which diverge and vary slowly at and .1 This is the known behaviour of the fluctuations in 2d CDT, where (11), and consistent with the simulation results in 4d. Note that the finite resistance implies that this multigraph ensemble is non-recurrent, i.e. .

V Spectral dimension and dimensional reduction

We now show that the multigraph model whose measure has the properties (10), (12) and (13) has a scale dependent spectral dimension which is two at small scales and four at large scales, as observed in the numerical simulations of 4d CDT. In order to do this we use the formalism developed in (15) to understand scale dependent spectral dimension on graphs. Full technical details, such as mathematically rigorous proofs, may be found in (13).

Let be the probability that a random walker on a fixed multigraph returns to the root after time . The spectral dimension is defined through via the relation at large time. More precisely, using the generating function for the return probabilities


we define the spectral dimension using


in the case where the random walk is recurrent () and diverges as . If the random walk is non-recurrent, is finite and we define the spectral dimension through the derivative of of lowest degree which is diverging via the relation


for . As we will see later for the expectation value of is finite while its first derivative diverges.

Given a fixed multigraph the probability for a random walker at to step next to is given by and the probability that the next step is to is (note that the probability to move from the root to vertex one is ). Then we decompose the random walk into two pieces; a step from vertex to , then a random walk returning to and a final step from to n at time . This decomposition relates and and the generating function satisfies the following recursion relation (11)


where and is the multigraph obtained from by removing the first vertices and all edges attached to them and relabelling the remaining multigraph. Recall that . Differentiating (17) and iterating we get


which is the starting point of our proofs.

On the one hand, (18) can be rearranged using (17) and bounded from below by


Using the Cauchy–Schwartz inequality on the second term and (12)–(13), one obtains that (19) is bounded further by


where and is a positive constant. Note that the second term in the numerator is sub-leading as , since the functions , are slowly varying. Averaging over the ensemble , applying Jensen’s inequality and using (10)–(11) we get


On the other hand, (18) can be rearranged so that it is bounded from above by


Using the fact that is a finite convex decreasing function in , i.e. and note that the exponentials are bounded by constants for the choice , one gets


where , are positive constants. Noting that is the (finite) resistance, taking the expectation value and using the fact that


together with (10)–(13) we finally get


Combining (21) and (25) in a compact form, we write


We obtain the scaling limit by taking the lattice spacing and following the prescription of (15) define


with . Using (21) and (25) we now have that


Eq. (28) implies that in the short walk limit (i.e. ) and in the long walk limit (i.e. ) for arbitrarily small (see (15) for the detailed correspondence between walk length and ). At this point we should mention that it is a highly non-trivial fact that there exists a non-trivial limit (27). The first example of the existence of such a limit (in the recurrent case) was given in the context of random combs (15).

We can extract from (26) the average return probability as a function of large walk length. In particular, from (14) we get


From (26) the left hand side of (29) reads


where and is a slowly varying function at infinity. Using a Tauberian theorem (chapter XIII, (16)) one gets (setting to zero in the expressions below to simplify the discussion)


as . Scaling and as before one obtains the probability density of the continuous diffusion time through


This is precisely expression (8) which was conjectured in (5) as the behaviour of the continuum return probability density for diffusion on four-dimensional CDT. It yields the scale dependent continuum spectral dimension


consistent with the numerical results.

Vi Discussion

The multigraph ensemble which describes radially reduced 4d CDT provides some physical insight into the degrees of freedom which determine the spectral dimension in the physical phase. Firstly the fact that the behaviour of the return probability density (8) implied by simulations (5) can be reproduced strongly suggests that the detailed structure of the spatial hypersurfaces is not important; it is the behaviour of the number of time-like edges which is crucial. To determine the spectral dimension on the multigraphs it is sufficient to know the volume growth and the resistance behaviour reflected in the assumptions (10), (12) and (13). These are all motivated from robust results in lower-dimensional studies (13); (11) but it is a non-trivial result of this letter that the continuum limit exists and that one can perform it exactly to obtain the return probability density (32) and show that there is a scale dependent spectral dimension varying from four at large scales to two at small scales.

These results show that the intuition about random walks on sliced graphs described earlier leads to a consistent picture in which the computer observations of a scale dependent spectral dimension can be related to the relatively simple question of the distribution of time-like edges in the CDT providing evidence they could be a real continuum physical phenomenon rather than a consequence of finite size effects. While this study only requires the averages of functions of it indicates that further light may be shed on the mechanisms of dynamical dimensional reduction in four-dimensional CDT by investigating the distribution and correlations of the in the numerical simulations. Understanding these distributions would help towards an analytical solution of the full four-dimensional model.


GG acknowledges the support of the A.G. Leventis Foundation and A.S. Onassis Public Benefit Foundation grant F-ZG 097/ 2010-2011. JFW and SZ are supported by EPSRC grant EP/I01263X/1 and STFC grant ST/G000492/1. SZ would like to acknowledge the support of a Visiting Scholarship at Corpus Christi College, Oxford University.


  1. A function is slowly varying at if for any .


  1. G. ’t Hooft and M. J. G. Veltman, Phys. Theor. A20 (1974) 69-94.
  2. S. Weinberg, in General Relativity, S. Hawking and W. Israel, eds., p. 790-831, 1980.
  3. Ambjørn, J., Loll, R. Nucl. Phys. B536, 407–434 (1998), arXiv: hep-th/9805108.
  4. J. Ambjørn, A. Görlich, J. Jurkiewicz, R. Loll, [arXiv:1007.2560 [hep-th]].
  5. Ambjørn, J., Jurkiewicz, J., Loll, R. Phys. Rev. Lett. 95, 171301 (2005), arXiv: hep-th/0505113.
  6. D. Benedetti, J. Henson, Phys. Rev. D80 (2009) 124036. [arXiv:0911.0401 [hep-th]].
  7. D. F. Litim, Phys. Rev. Lett. 92 (2004) 201301, arXiv: hep-th/0312114; O. Lauscher and M. Reuter, JHEP 10 (2005) 050, arXiv: hep-th/0508202.
  8. P. Hořava, Phys. Rev. D79 (2009) 084008, arXiv: 0901.3775 [hep-th]; Phys. Rev. Lett. 102 (2009) 161301, arXiv: 0901.3775 [hep-th].
  9. J. Ambjørn, A. Görlich, S. Jordan, J. Jurkiewicz, R. Loll, Phys. Lett. B690 (2010) 413-419. [arXiv:1002.3298 [hep-th]]; J. Ambjørn, S. Jordan, J. Jurkiewicz, R. Loll, [arXiv:1108.3932 [hep-th]]; T. P. Sotiriou, M. Visser, S. Weinfurtner, [arXiv:1105.6098 [hep-th]]; C. Anderson, S. Carlip, J. H. Cooperman, P. Horava, R. Kommu and P. R. Zulkowski, “Quantizing Horava-Lifshitz Gravity via Causal Dynamical Triangulations,” arXiv:1111.6634 [hep-th].
  10. J. Ambjørn, J. Jurkiewicz, R. Loll, Nucl. Phys. B610 (2001) 347-382. [hep-th/0105267].
  11. B. Durhuus, T. Jonsson and J. F. Wheater, J. Stat. Phys. 139 (2010) 859-881, arXiv:0908.3643 [math-ph]; J. Stat. Phys. 128 (2007) 1237-1260, arXiv:math-ph/0607020.
  12. Lyons, R. with Peres, Y. (2011). Probability on Trees and Networks. Cambridge University Press. In preparation.
  13. G. Giasemidis, J. F. Wheater and S. Zohren, J.Phys. A45 355001 (2012), arXiv:1202.6322 [hep-th].
  14. J. Ambjørn, J. Jurkiewicz, and R. Loll, Phys. Rev. Lett. 93 (2004) 131301, arXiv: hep-th/0404156.
  15. M. R. Atkin, G. Giasemidis, and J. F. Wheater, J.Phys. A44 265001 (2011), arXiv:1101.4174 [hep-th].
  16. W. Feller, An Introduction to Probability Theory and Its Applications vol. II, J. Wiley & Sons, Inc, Canada, 1971.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description