Identifiability and Consistent Estimation for Gaussian Chain Graph Models
type: Item
instance of: scholarly article
title: Identifiability and Consistent Estimation for Gaussian Chain Graph Models
DOI: 10.1080/01621459.2024.2304692
author: Q6651416
author: Haoran Zhang
author: Junhui Wang
published in: Journal of the American Statistical Association
publication date: 2024-12-10T00:00:00Z
Mathematics Subject Classification ID: 62-XX
zbMATH DE Number: 7956513
MaRDI profile type: Publication
cites work: Alternative Markov properties for chain graphs
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: A Constrainedℓ1Minimization Approach to Sparse Precision Matrix Estimation
cites work: Rank-Sparsity Incoherence for Matrix Decomposition
cites work: On causal discovery with an equal-variance assumption
cites work: Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
cites work: Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
cites work: Sparse inverse covariance estimation with the graphical lasso
cites work: Q3198595
cites work: Bayesian Structure Learning in Multilayered Genomic Networks
cites work: AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms
cites work: Q3174091
cites work: Graphical models for associations between variables, some of which are qualitative and some quantitative
cites work: Separation and completeness properties for AMP chain graph Markov models.
cites work: Penalized maximum likelihood estimation of multi-layered Gaussian graphical models
cites work: Q3096216
cites work: High-dimensional graphs and variable selection with the Lasso
cites work: Q4969132
cites work: Learning Marginal AMP Chain Graphs under Faithfulness
cites work: Identifiability of Gaussian structural equation models with equal error variances
cites work: Q4611402
cites work: High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
cites work: A recovery algorithm for chain graphs
cites work: The max-min hill-climbing Bayesian network structure learning algorithm
cites work: Q4712715
cites work: A useful variant of the Davis–Kahan theorem for statisticians
description: scientific article; zbMATH DE number 7956513