Title
Graph Laplacians and their Convergence on Random Neighborhood Graphs
Abstract
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in several machine learning methods like semi-supervised learning, dimensionality reduction and clustering. In this paper we determine the pointwise limit of three different graph Laplacians used in the literature as the sample size increases and the neighborhood size approaches zero. We show that for a uniform measure on the submanifold all graph Laplacians have the same limit up to constants. However in the case of a non-uniform measure on the submanifold only the so called random walk graph Laplacian converges to the weighted Laplace-Beltrami operator.
Year
DOI
Venue
2007
10.5555/1314498.1314544
Clinical Orthopaedics and Related Research
Keywords
DocType
Volume
random walk graph laplacian,graph laplacians,different graph,non-uniform measure,semi-supervised learning,probability measure,neighborhood size approach,dimensional- ity reduction,spectral clustering,graph laplacian,random neighborhood graphs,uniform measure,pointwise limit,graphs,neighborhood graph
Journal
8,
ISSN
Citations 
PageRank 
1532-4435
64
5.58
References 
Authors
13
5
Name
Order
Citations
PageRank
Matthias Hein166362.80
Jean-yves Audibert2122578.45
von luxburg33246170.11
AudibertJean-Yves4645.58
LuxburgUlrike von5856.81