论文信息 - An efficient algorithm for the symmetric principal minor assignment problem

An efficient algorithm for the symmetric principal minor assignment problem

Abstract We consider the problem of reconstructing a symmetric matrix from its principal minors, which has several applications in information theory and statistical modeling. We develop a theory of symmetric matrices with equal corresponding principal minors based on a simple equivalent property due to Oeding (2011) [10] . We then use this theory to provide a method for choosing a canonical representative from the class of all symmetric matrices with specified principal minors. Finally, we provide an efficient algorithm for computing this canonical representative given its principal minors as input.

[1] Hans Schneider,et al. Matrices diagonally similar to a symmetric matrix , 1980 .

[2] Bernd Sturmfels,et al. Hyperdeterminantal relations among symmetric principal minors , 2006, math/0604374.

[3] L. Oeding,et al. Set-theoretic defining equations of the variety of principal minors of symmetric matrices , 2008, 0809.4236.

[4] Y. Peres,et al. Determinantal Processes and Independence , 2005, math/0503110.

[5] Ben Taskar,et al. Determinantal Point Processes for Machine Learning , 2012, Found. Trends Mach. Learn..

[6] Frank Uhlig,et al. Numerical Algorithms with C , 1996 .

[7] Michael J. Tsatsomeros,et al. Principal minors, Part I: A method for computing all the principal minors of a matrix , 2006 .

[8] Babak Hassibi,et al. On a Construction of Entropic Vectors Using Lattice-Generated Distributions , 2007, 2007 IEEE International Symposium on Information Theory.

[9] Michael J. Tsatsomeros,et al. Principal minors, Part II: The principal minor assignment problem , 2006 .

[10] J. Baik,et al. The Oxford Handbook of Random Matrix Theory , 2011 .