Provides a nonparametric method for estimating scalefree graphical models. To avoid the usual Gaussian assumption, we restrict the graph to be a forest and build on the work of forest density estimation. The method is motivated from a Bayesian perspective and is equivalent to finding the maximum spanning tree of a weighted graph with a log degree penalty. We solve the optimization problem via a minorizemaximization procedure with Kruskal's algorithm.
Package details 


Author  Zhe Liu <zheliu@uchicago.edu> 
Maintainer  Zhe Liu <zheliu@uchicago.edu> 
License  GPL3 
Version  0.1.0 
Package repository  View on GitHub 
Installation 
Install the latest version of this package by entering the following in R:

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.