Property testing in Gaussian graphical models: trees and small separation numbers

DOI10.1093/IMAIAI/IAAG016MaRDI QIDQ7312540zbMATH OpenFDO

Authors Luc Devroye, Gábor Lugosi, Piotr Zwiernik

Publication date 11 August 2026

Published in Information and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/IMAIAI/IAAG016

Mathematics Subject Classification ID

Statistics (62-XX) Information and communication theory, circuits (94-XX)

Cites work

• About groups of straight lines
• An Experimental Study of the Treewidth of Real-World Graph Data
• Combinatorial inference for graphical models
• Dependence in elliptical partial correlation graphs
• Finding small balanced separators
• Geometry of the faithfulness assumption in causal inference
• Graph minors. II. Algorithmic aspects of tree-width
• Graphical models, exponential families, and variational inference
• High-dimensional semiparametric Gaussian copula graphical models
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 7049740 (Why is no real title available?)
• scientific article; zbMATH DE number 1857651 (Why is no real title available?)
• scientific article; zbMATH DE number 7626718 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Introduction to Property Testing
• Learning Markov networks: Maximum bounded tree-width graphs
• Marginalization and collapsibility in graphical interaction models
• Multiple testing and error control in Gaussian graphical model selection
• Non-independent component analysis
• On rigid circuit graphs
• Ordinal Measures of Association
• Parametrized complexity theory.
• Probability inequalities for the sum in sampling without replacement
• Property testing in high-dimensional Ising models
• Tests for Gaussian graphical models
• The necessity of bounded treewidth for efficient inference in Bayesian networks
• The nonparanormal: semiparametric estimation of high dimensional undirected graphs
• Treewidth of graphs with balanced separations
• Treewidth reduction for constrained separation and bipartization problems
• Trek separation for Gaussian graphical models
• Uniform inference in high-dimensional Gaussian graphical models

This page was built for publication: Property testing in Gaussian graphical models: trees and small separation numbers

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