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

12/20/2022
by   Hélène Guérin, et al.
0

Consider n points independently sampled from a density p of class 𝒞^2 on a smooth compact d-dimensional sub-manifold ℳ of ℝ^m, and consider the generator of a random walk visiting these points according to a transition kernel K. We study the almost sure uniform convergence of this operator to the diffusive Laplace-Beltrami operator when n tends to infinity. This work extends known results of the past 15 years. In particular, our result does not require the kernel K to be continuous, which covers the cases of walks exploring kNN-random 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 convergence of kNN Laplacians is detailed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/01/2022

Clustering for directed graphs using parametrized random walk diffusion kernels

Clustering based on the random walk operator has been proven effective f...
research
03/02/2020

Evolutionary Image Transition and Painting Using Random Walks

We present a study demonstrating how random walk algorithms can be used ...
research
01/25/2021

Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation

This work studies the spectral convergence of graph Laplacian to the Lap...
research
11/28/2018

Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets

We introduce a novel harmonic analysis for functions defined on the vert...
research
08/30/2018

A Divergence Proof for Latuszynski's Counter-Example Approaching Infinity with Probability "Near" One

This note is a technical supplement to the following paper: latuszynski2...
research
12/06/2017

Oblivious Routing via Random Walks

We present novel oblivious routing algorithms for both splittable and un...
research
04/20/2020

From graph cuts to isoperimetric inequalities: Convergence rates of Cheeger cuts on data clouds

In this work we study statistical properties of graph-based clustering a...

Please sign up or login with your details

Forgot password? Click here to reset