An Analysis of the Convergence of Graph Laplacians

Details An Analysis of the Convergence of Graph Laplacians An Analysis of the Convergence of Graph Laplacians

2011-01-28

arxiv.org/abs/1101.5435v1

Statistics

Machine Learning

Scientific paper

Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumption and generalize the analysis of graph Laplacians to include previously unstudied graphs including kNN graphs. We also introduce a kernel-free framework to analyze graph constructions with shrinking neighborhoods in general and apply it to analyze locally linear embedding (LLE). We also describe how for a given limiting Laplacian operator desirable properties such as a convergent spectrum and sparseness can be achieved choosing the appropriate graph construction.

Affiliated with

Also associated with

No associations

Rating

An Analysis of the Convergence of Graph Laplacians does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Analysis of the Convergence of Graph Laplacians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Analysis of the Convergence of Graph Laplacians will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-551428