CRAN/E | LPGraph

LPGraph

Nonparametric Smoothing of Laplacian Graph Spectra

Installation

About

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).

Key Metrics

Version 2.1
R ≥ 3.5.0
Published 2020-01-30 1560 days ago
Needs compilation? no
License GPL-2
CRAN checks LPGraph results

Downloads

Yesterday 8 0%
Last 7 days 39 -35%
Last 30 days 172 +2%
Last 90 days 476 -31%
Last 365 days 2.098 -15%

Maintainer

Maintainer

Kaijun Wang

kaijun.wang@temple.edu

Authors

Subhadeep Mukhopadhyay
Kaijun Wang

Material

Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

LPGraph archive

Depends

R ≥ 3.5.0
stats
car
PMA

Reverse Depends

LPKsample

Reverse Imports

LPsmooth