Spanning trees and identifiability of a single-factor model
From MaRDI portal
Publication:1766966
DOI10.1007/BF02511482zbMATH Open1145.62412MaRDI QIDQ1766966FDOQ1766966
Authors: Claudia Tarantola, Paola Vicard
Publication date: 3 March 2005
Published in: Statistical Methods and Applications (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Decomposition of maximum likelihood in mixed graphical interaction models
- Gaussian Markov distributions over finite graphs
- Title not available (Why is that?)
- Decomposable graphical Gaussian model determination
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factor analysis of multiple batteries by maximum likelihood
- Bayesian inference for graphical factor analysis models
- Miscellanea. Identification of a single-factor model using graphical Gaussian rules
- Miscellanea. On the identification of a single-factor model with correlated residuals
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)