Description Author(s) References
This package provides an algorithm to approximate and smooth the Laplacian graph spectra of a network with ordered vertices using LP-nonparametric basis. The underlying theory yields a reduced order (compressive) characterization of spectral graph properties.
Mukhopadhyay, S. and Wang, K.
Maintainer: Kaijun Wang <kaijun.wang@temple.edu>
Mukhopadhyay, S. and Wang, K. (2018), "Graph Spectral Compression via Smoothing".
Mukhopadhyay, S. (2017+), "Unified Statistical Theory of Spectral Graph Analysis".
Mukhopadhyay, S. and Parzen, E. (2014), "LP Approach to Statistical Modeling", arXiv:1405.2601.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.