Matrix Completion for the Independence Model
matrix completion
independence model
weighted graphs
tensor completion
real algebraic geometry
optimal completions
We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex ∆mn−1. The motivation for studying this problem comes from statistics: A lack of eligible completion can provide a falsification test for partial observations to come from the independence model. For each pattern of specified entries, we give equations and inequalities which are satisfied if and only if an eligible completion exists. We also describe the set of valid completions, and we optimize over this set.
Kubjas, Kaie
Rosen, Zvi
Article
application/pdf
islandora:1009725
https://doi.org/10.18409/jas.v8i1.50
http://hdl.handle.net/10560/islandora:1009725
MATH / Applied Mathematics
Illinois Institute of Technology
Journal of Algebraic Statistics
en (english)
Open Access