  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
$o_p(n^{1/4})$ window around a constant multiple of the graph distance.
