Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth

1 code implementation • 17 Feb 2022 • Jeff Calder, Mahmood Ettehad

We show that the $p$-eikonal equation with $p=1$ is a provably robust distance-type function on a graph, and the $p\to \infty$ limit recovers shortest path distances.