Home Graph Selection with GGMselect
Article
Licensed
Unlicensed Requires Authentication

Graph Selection with GGMselect

  • Christophe Giraud , Sylvie Huet and Nicolas Verzelen
Published/Copyright: February 10, 2012

Applications on inference of biological networks have raised a strong interest in the problem of graph estimation in high-dimensional Gaussian graphical models. To handle this problem, we propose a two-stage procedure which first builds a family of candidate graphs from the data, and then selects one graph among this family according to a dedicated criterion. This estimation procedure is shown to be consistent in a high-dimensional setting, and its risk is controlled by a non-asymptotic oracle-like inequality. The procedure is tested on a real data set concerning gene expression data, and its performances are assessed on the basis of a large numerical study.The procedure is implemented in the R-package GGMselect available on the CRAN.

Published Online: 2012-2-10

©2012 Walter de Gruyter GmbH & Co. KG, Berlin/Boston

Downloaded on 22.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/1544-6115.1625/html?lang=en
Scroll to top button