Each latent variable with at least two pure observed children makes the bipartite graph identifiable from the population tensor via rank tests on unfolded matrices.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Unfolding Tensors to Identify the Graph in Discrete Latent Bipartite Graphical Models
Each latent variable with at least two pure observed children makes the bipartite graph identifiable from the population tensor via rank tests on unfolded matrices.