English

First-passage percolation on random simple triangulations

Probability 2022-03-15 v1 Combinatorics

Abstract

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

Keywords

Cite

@article{arxiv.2203.07297,
  title  = {First-passage percolation on random simple triangulations},
  author = {Benedikt Stufler},
  journal= {arXiv preprint arXiv:2203.07297},
  year   = {2022}
}
R2 v1 2026-06-24T10:12:45.821Z