Limits of non-local approximations to the Eikonal equation on manifolds
Jalal M. Fadili, Nicolas Forcadel, Rita Zantout
TL;DR
This work studies a time-dependent non-local Eikonal equation on a compact Riemannian manifold and its convergence to the local form as the non-local kernel is scaled. Using viscosity solution theory, Perron’s method, and geometric tools on manifolds, the authors establish well-posedness and regularity for both the local and non-local problems, along with explicit error bounds between the two formulations in both continuous time and Forward Euler discretization. They then transfer these results to sequences of random geometric graphs, proving almost-sure uniform convergence of graph-based solutions to the local viscosity solution as the graph size grows and the kernel scale shrinks at a controlled rate. The results provide a rigorous continuum limit for non-local graph approximations of Eikonal-type dynamics on manifolds, with quantified rates depending on kernel regularity, graph sampling density, and discretization parameters. Practically, this enables robust, scalable PDE-based front propagation and distance computations on manifold-structured data and graphs, with guaranteed convergence guarantees as data resolution increases.
Abstract
In this paper, we consider a non-local approximation of the time-dependent Eikonal equation defined on a Riemannian manifold. We show that the local and the non-local problems are well-posed in the sense of viscosity solutions and we prove regularity properties of these solutions in time and space. If the kernel is properly scaled, we then derive error bounds between the solution to the non-local problem and the one to the local problem, both in continuous-time and Forward Euler discretization. Finally, we apply these results to a sequence of random weighted graphs with n vertices. In particular, we establish that the solution to the problem on graphs converges almost surely uniformly to the viscosity solution of the local problem as the kernel scale parameter decreases at an appropriate rate when the number of vertices grows and the time step vanishes.
