2 problems

Let $G=(V \cup \mathcal{H},D)$ be a factor analysis graph. M-identifiability and extended M-identifiability are the two identifiability properties defined by the matching criterion…

A sparse two-factor analysis model is the model associated with a graph $G$ having two latent variables, with $M_{\leq 1}(G)$ denoting the set of model polynomials indexed by subse…