Nonparametric Smoothing of Laplacian Graph Spectra

A nonparametric method to approximate Laplacian graph spectra of a network with ordered vertices. This provides a computationally efficient algorithm for obtaining an accurate and smooth estimate of the graph Laplacian basis. The approximation results can then be used for tasks like change point detection, k-sample testing, and so on. The primary reference is Mukhopadhyay, S. and Wang, K. (2018, Technical Report).


News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("LPGraph")

2.0 by Kaijun Wang, a year ago


Browse source code at https://github.com/cran/LPGraph


Authors: Subhadeep Mukhopadhyay , Kaijun Wang


Documentation:   PDF Manual  


GPL-2 license


Depends on stats, SDMTools, car, PMA


See at CRAN