Matrix completion for the independence model

DOI10.18409/JAS.V8I1.50MaRDI QIDQ3133814zbMATH OpenOpenAlexFDO

Authors Kaie Kubjas, Zvi Rosen

Publication date 5 February 2018

Published in Journal of Algebraic Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.3254

zbMATH Keywords

independence modelmatrix completionoptimal completionsreal algebraic geometrytensor completionweighted graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Semialgebraic sets and related spaces (14P10) Matrix completion problems (15A83)

Abstract: We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex. 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.

Recommendations

• Typical and generic ranks in matrix completion
• Direct approach to rank-1 completions of partial matrices
• scientific article; zbMATH DE number 4158856
• Unique low rank completability of partially filled matrices
• Typical ranks in symmetric matrix completion

Cited in

(6)

• Typical ranks in symmetric matrix completion
• Unique low rank completability of partially filled matrices
• Direct approach to rank-1 completions of partial matrices
• The geometry of rank-one tensor completion
• Completions to discrete probability distributions in log-linear models
• Geometry of low nonnegative rank matrix completion

This page was built for publication: Matrix completion for the independence model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133814)