Graph density and uncertainty of graphical model selection algorithms

DOI10.1007/978-3-031-48751-4_14MaRDI QIDQ6959259zbMATH OpenFDO

Authors Valery A. Kalyagin, Ilya Kostylev

Publication date 15 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-48751-4_14

zbMATH Keywords

concentration graphgraph densitygraphical modeloptimal identification algorithmuncertainty

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A review of Gaussian Markov models for conditional independence
• scientific article; zbMATH DE number 1964693 (Why is no real title available?)
• Loss function, unbiasedness, and optimality of Gaussian graphical model selection
• Multiple testing and error control in Gaussian graphical model selection
• Sparse inverse covariance estimation with the graphical lasso
• Statistical analysis of graph structures in random variable networks

This page was built for publication: Graph density and uncertainty of graphical model selection algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6959259)