Theorem 3.1. Let $(\mathbf{m}_{\infty}, D^*)$ be the Brownian map. There exists some constant $c_0 \in [2/3, 1]$, such that the following convergence in distribution holds:
Consequently, we have the following joint convergences
n−1/4⋅(V(Tn),dn)(d)n→∞(m∞,D∗)
n−1/4⋅(V(Tn),dn)(d)n→∞c0⋅(m∞,D∗),
for the Gromov-Hausdorff distance on the space of isometry classes of compact metric spaces.
Note that we would like to have a statement similar to the one on $\overleftrightarrow{d}_n$ for $\vec{d}_n$. However, as $\vec{d}_n$ is not a proper distance, it does not induce a metric space structure on $V(T_n)$. Thus, we would need to generalize the Gromov-Hausdorff topology to spaces equipped with a non-symmetric pseudo-distance, to be able to write such a statement.
Proof. We admit here Theorem 1.2, that will be proven later in the paper: for every $\varepsilon > 0$, we have
We proceed similarly to the case of usual triangulations in [20].
For this whole proof, we work with the pointed triangulation $\bar{\mathcal{T}}_n$, but, as all Eulerian triangulations with $n$ black faces have the same number of vertices, this does not introduce any bias for the underlying, non-pointed triangulation, so that the final statement also holds for $\mathcal{T}_n$.
We have, from Proposition 2.11, for any $0 \le i < j \le 2n$:
As noted before, if we did not have the global multiplicative factor of 2 in (3.2), we could then proceed as for usual triangulations and other well-known families of planar maps. Thus, the rest of this proof will consist in proving that Theorem 1.2 makes it possible to “get rid” of this cumbersome factor.
We claim that the sequence of the rescaled distances $(\vec{D}{(n)}(s,t)){s,t \in [0,1]}$ is tight. First note that, for any $s, s', t, t' \in [0,1]$, we have
which gives (3.3) when taking into account that, while $\vec{D}{(n)}$ is not symmetric, we do have, for any $s,t \in [0,1]$, $\vec{D}{(n)}(s,t) \le 2\vec{D}_{(n)}(t,s)$. Then, using (3.2) and Theorem 2.12, we