LPGraph
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).
- Version2.1
- R version≥ 3.5.0 stats,
- LicenseGPL-2
- Needs compilation?No
- Last release01/30/2020
Team
Kaijun Wang
Subhadeep Mukhopadhyay
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends2 packages
- Reverse Depends1 package
- Reverse Imports1 package