First-passage percolation on random simple triangulations.

We study first-passage percolation on random simple triangulations and their dual maps with independent identically distributed link weights. Our main result shows that the first-passage percolation distance concentrates in an op(n1/4) window around a constant multiple of the graph distance. Our approach follows the proof strategy by Curien and Le Gall (Ann. Sci. Éc. Norm. Supér., 2019), but we have to overcome several obstacles specific to simple triangulations. [ABSTRACT FROM AUTHOR]