Estimation of Gaussian graphs by model selection
From MaRDI portal
Publication:1951762
DOI10.1214/08-EJS228zbMATH Open1320.62094arXiv0710.2044OpenAlexW3101229196MaRDI QIDQ1951762FDOQ1951762
Authors: Christophe Giraud 
Publication date: 24 May 2013
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Abstract: We investigate in this paper the estimation of Gaussian graphs by model selection from a non-asymptotic point of view. We start from a n-sample of a Gaussian law P_C in R^p and focus on the disadvantageous case where n is smaller than p. To estimate the graph of conditional dependences of P_C, we introduce a collection of candidate graphs and then select one of them by minimizing a penalized empirical risk. Our main result assess the performance of the procedure in a non-asymptotic setting. We pay a special attention to the maximal degree D of the graphs that we can handle, which turns to be roughly n/(2 log p).
Full work available at URL: https://arxiv.org/abs/0710.2044
Recommendations
Nonparametric regression and quantile regression (62G08) Linear regression; mixed models (62J05) Random matrices (algebraic aspects) (15B52)
Cites Work
- Sparse graphical models for exploring gene expression data
- High-dimensional graphs and variable selection with the Lasso
- Multiple testing and error control in Gaussian graphical model selection
- Tests for Gaussian graphical models
- Gaussian model selection with an unknown variance
- Sparse inverse covariance estimation with the graphical lasso
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Model selection and estimation in the Gaussian graphical model
- Local operator theory, random matrices and Banach spaces.
- Decoding by Linear Programming
- Covariance matrix selection and estimation via penalised normal likelihood
- A SINful approach to Gaussian graphical model selection
- Model selection for regression on a random design
- Exploring gene causal interactions using an enhanced constraint-based method
- Low-Order Conditional Independence Graphs for Inferring Genetic Networks
- Assessing the validity domains of graphical Gaussian models in order to infer relationships among components of complex biological systems
Cited In (24)
- High-dimensional Gaussian graphical model selection: walk summability and local separation criterion
- Berry-Esseen bounds for estimating undirected graphs
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Forest density estimation
- Goodness-of-fit tests for high-dimensional Gaussian linear models
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons
- Block-Diagonal Covariance Selection for High-Dimensional Gaussian Graphical Models
- Estimation of means in graphical Gaussian models with symmetries
- Robust concentration graph model selection
- Tuning parameter selection for penalized likelihood estimation of Gaussian graphical model
- On the impact of contaminations in graphical Gaussian models
- Edge selection based on the geometry of dually flat spaces for Gaussian graphical models
- On estimation and inference in latent structure random graphs
- Model selection for Gaussian concentration graphs
- High-dimensional Gaussian model selection on a Gaussian design
- Graph selection with GGMselect
- Topology selection in graphical models of autoregressive processes
- Neighborhood selection methods
- Model selection for Markov random fields on graphs under a mixing condition
- On generating random Gaussian graphical models
- A note on the Lasso for Gaussian graphical model selection
- Multiple Matrix Gaussian Graphs Estimation
- Loss function, unbiasedness, and optimality of Gaussian graphical model selection
- High-dimensional regression with unknown variance
Uses Software
This page was built for publication: Estimation of Gaussian graphs by model selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1951762)
