Identifiability and Consistent Estimation for Gaussian Chain Graph Models
From MaRDI portal
Publication:6651417
DOI10.1080/01621459.2024.2304692MaRDI QIDQ6651417
Haoran Zhang, Unnamed Author, Junhui Wang
Publication date: 10 December 2024
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Sparse inverse covariance estimation with the graphical lasso
- The max-min hill-climbing Bayesian network structure learning algorithm
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- A recovery algorithm for chain graphs
- Separation and completeness properties for AMP chain graph Markov models.
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- High-dimensional graphs and variable selection with the Lasso
- Alternative Markov Properties for Chain Graphs
- Learning Marginal AMP Chain Graphs under Faithfulness
- Rank-Sparsity Incoherence for Matrix Decomposition
- A Constrainedℓ1Minimization Approach to Sparse Precision Matrix Estimation
- Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
- Bayesian Structure Learning in Multilayered Genomic Networks
- AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms
- On causal discovery with an equal-variance assumption
- A useful variant of the Davis–Kahan theorem for statisticians
- Identifiability of Gaussian structural equation models with equal error variances
This page was built for publication: Identifiability and Consistent Estimation for Gaussian Chain Graph Models
