Hostname: page-component-89b8bd64d-n8gtw Total loading time: 0 Render date: 2026-05-06T13:56:13.277Z Has data issue: false hasContentIssue false

Strong uniform convergence of Laplacians of random geometric and directed kNN graphs on compact manifolds

Published online by Cambridge University Press:  24 April 2026

Héléne Guérin*
Affiliation:
UQAM
Dinh-Toàn Nguyen*
Affiliation:
Université Gustave Eiffel and UQAM
Viet Chi Tran*
Affiliation:
Inria
*
*Postal address: Département de Mathématiques, UQAM, Canada. Email: guerin.helene@uqam.ca
**Postal address: LAMA, Université Gustave Eiffel, France; Département de Mathématiques, UQAM, Canada. Email: dinhtoan.nguyenvn@gmail.com
***Postal address: Centre Inria de l’Université de Lille, France. Email: viet-chi.tran@inria.fr
Rights & Permissions [Opens in a new window]

Abstract

Consider n points independently sampled from a density p of class $\mathcal{C}^2$ on a smooth compact d-dimensional submanifold $\mathcal{M}$ of $\mathbb{R}^m$, and consider the random walk visiting these points according to a transition kernel K. We study the almost sure uniform convergence of the generator of this process to the diffusive Laplace–Beltrami operator when n tends to infinity, from which we establish the convergence of the random walk to a diffusion process on the manifold. In contrast to known results, our result does not require the kernel K to be continuous, which covers the cases of walks exploring k-nearest neighbor (kNN) and geometric graphs, and convergence rates are given. The distance between the random walk generator and the limiting operator is separated into several terms: a statistical term, related to the law of large numbers, is treated with concentration tools and an approximation term that we control with tools from differential geometry. The case of kNN Laplacians is detailed. The convergence of the stochastic processes having these operators as generators is also studied, by establishing additional tightness results of their distributions on the space of càdlàg functions.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2026. Published by Cambridge University Press on behalf of Applied Probability Trust