Spanning trees and identifiability of a single-factor model
From MaRDI portal
Recommendations
- Identifiability of directed Gaussian graphical models with one latent source
- Miscellanea. Identification of a single-factor model using graphical Gaussian rules
- Miscellanea. On the identification of a single-factor model with correlated residuals
- Identification of discrete concentration graph models with one hidden binary variable
- On identification of multi-factor models with correlated residuals
Cites work
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 45532 (Why is no real title available?)
- scientific article; zbMATH DE number 53892 (Why is no real title available?)
- scientific article; zbMATH DE number 1264885 (Why is no real title available?)
- Bayesian inference for graphical factor analysis models
- Decomposable graphical Gaussian model determination
- Decomposition of maximum likelihood in mixed graphical interaction models
- Factor analysis of multiple batteries by maximum likelihood
- Gaussian Markov distributions over finite graphs
- Miscellanea. Identification of a single-factor model using graphical Gaussian rules
- Miscellanea. On the identification of a single-factor model with correlated residuals
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
This page was built for publication: Spanning trees and identifiability of a single-factor model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766966)
