First-passage percolation, non-positive curvature, and radial maps

Dominic Bair, Sagnik Jana, Yulan Qing

Given an infinite connected graph $G$, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph, a process called first-passage percolation…