First-passage percolation in random planar maps and Tutte's bijection (Q2119692)

A rooted planar map \(M\) is a finite planar graph embedded in the 2-sphere, with one oriented edge marked as root edge. For a wide range of models of random maps it is known that the vertex set \(V(M)\), when viewed as a metric space for the graph distance, converges in distribution towards a random compact metric space called the Brownian map. The author asks what can be said when the graph distance is replaced by other distances? Such distances can be obtained by assigning weights to the edges of the graph. Of particular interest is the so-called first-passage percolation distance for which i.i.d. weights are chosen for the edges. The first main goal of the paper is to extend the results of [\textit{N. Curien} and \textit{J.-F. Le Gall}, Ann. Sci. Éc. Norm. Supér. (4) 52, No. 3, 631--701 (2019; Zbl 1429.05188)] in which the first-passage percolation distance was studied in large triangulations. In Theorem 1.1, the author shows that the first-passage percolation distance in quadrangulations as well as in general planar maps behaves like a constant times the graph distance. In Theorem 1.2, the author relates his findings to Tutte transformations of rooted quandrangulations. Furthermore, he gives versions of his results for the infinite random lattices that arise as local limits of large quadrangulations or general planar maps.