Identifiability and Consistent Estimation for Gaussian Chain Graph Models
From MaRDI portal
Publication:6651417
DOI10.1080/01621459.2024.2304692MaRDI QIDQ6651417FDOQ6651417
Authors: Haoran Zhang, Junhui Wang
Publication date: 10 December 2024
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Cites Work
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- High-dimensional graphs and variable selection with the Lasso
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Sparse inverse covariance estimation with the graphical lasso
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- A useful variant of the Davis–Kahan theorem for statisticians
- The max-min hill-climbing Bayesian network structure learning algorithm
- Title not available (Why is that?)
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Rank-Sparsity Incoherence for Matrix Decomposition
- Identifiability of Gaussian structural equation models with equal error variances
- Title not available (Why is that?)
- Alternative Markov properties for chain graphs
- Title not available (Why is that?)
- Separation and completeness properties for AMP chain graph Markov models.
- Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
- Title not available (Why is that?)
- On causal discovery with an equal-variance assumption
- A recovery algorithm for chain graphs
- Learning Marginal AMP Chain Graphs under Faithfulness
- Title not available (Why is that?)
- Penalized maximum likelihood estimation of multi-layered Gaussian graphical models
- Bayesian Structure Learning in Multilayered Genomic Networks
- AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms
This page was built for publication: Identifiability and Consistent Estimation for Gaussian Chain Graph Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651417)