Strong uniform convergence of Laplacians of random geometric and directed <i>k</i> NN graphs on compact manifolds

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 ( k NN) 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 k NN 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.

Authors

Institutions

Publication Details

Journal
Advances in Applied Probability
Published
2026-04-24
DOI
https://doi.org/10.1017/apr.2026.10060
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Viet Chi Tran, Dinh–Toan Nguyen, Hélène Guérin
Advances in Applied Probability
Stochastic processes and statistical mechanics
article

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

Viet Chi Tran, Dinh–Toan Nguyen, Hélène Guérin
article en

Abstract

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 ( k NN) 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 k NN 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.

Advances in Applied Probability
Institut national de recherche en sciences et technologies du numérique (FR), Université Gustave Eiffel (FR)
Agence Nationale de la Recherche, Labex Bézout, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 6%
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.