Algebraic methods of classifying directed graphical models
Name
Polyanskiy_Algebraic methods.pdf
Size
664.41 KB
Format
Adobe PDF
Checksum (MD5)
46e015eaf9e18d295ccaa4183b66216b
Author(s) •
Polyanskiy, Yury
Hosseini Roozbehani, Hajir
Date Issued
June 2014
Journal
Proceedings of the 2014 IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Roozbehani, Hajir, and Yury Polyanskiy. “Algebraic Methods of Classifying Directed Graphical Models.” 2014 IEEE International Symposium on Information Theory (June 2014).
Version
Author's final manuscript
Abstract
In information theory, structural system constraints are frequently described in the form of a directed acyclic graphical model (DAG). This paper addresses the question of classifying DAGs up to an isomorphism. By considering Gaussian densities, the question reduces to verifying equality of certain algebraic varieties. A question of computing equations for these varieties has been previously raised in the literature. Here it is shown that the most natural method adds spurious components with singular principal minors, proving a conjecture of Sullivant. This characterization is used to establish an algebraic criterion for isomorphism, and to provide a randomized algorithm for checking that criterion. Results are applied to produce a list of the isomorphism classes of tree models on 4 and 5 nodes.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2014.6875189