Geometric and spectral properties of causal maps

Understand

We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level.

• This random graph is closely related to the well-known causal dynamical triangulation that was introduced by Ambj{\o}rn and Loll and has been studied extensively by physicists.
• We prove that the horizontal distances in the graph are smaller than the vertical distances, but only by a subpolynomial factor: The diameter of the set of vertices at level $n$ is both $o(n)$ and $n^{1-o(1)}$.
• This enables us to prove that the spectral dimension of the infinite version of the graph is almost surely equal to 2, and consequently that the random walk is diffusive almost surely.