Graph-distance scaling limit conjecture for planar maps

Let a\from(2,5/2)a\from (2,5/2), let (fi)i1\bigl(f_i\bigr)_{i\geq 1} be the sampled marked vertices or faces, let dgrd^\dagger_\mathrm{gr} denote the graph distance, and let (wi)i1\bigl(w_i\bigr)_{i\geq 1} be the corresponding points of (Da,dDa)(\mathcal{D}_a,d_{\mathcal{D}_a}). Write cac_a, pqp_{\bf q}, and eqe_{\bf q} for the model-dependent constants, and interpret the convergence in the product topology. Graph-distance scaling-limit conjecture. Under P()\mathbb{P}^{(\ell)},

(2adgr(fi,fj))i,j1(d)(1+eq2capqdDa(wi,wj))i,j1.\left(\ell^{2-a}d^\dagger_\mathrm{gr}(f_i,f_j)\right)_{i,j\geq 1}\mathop{\longrightarrow}\limits_{\ell\to\infty}^{(\mathrm{d})}\left(\frac{1+e_{\bf q}}{2c_ap_{\bf q}}d_{\mathcal{D}_a}(w_i,w_j)\right)_{i,j\geq 1}.

Moreover, Da\mathcal{D}_a has a compact completion, and this convergence of metric spaces also holds in the Gromov–Hausdorff sense for that completion. The claim concerns the conjectural scaling limit of graph distances and the compactness of the resulting continuum metric space; the supplied text gives no resolution evidence.

Sources & referencesView supporting material

Primary source

Emmanuel Kammerer, “Scaling limit of first passage percolation geodesics on planar maps”, arXiv:2412.02666 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.