Sangam: A Confluence of Knowledge Streams

Algebraic methods of classifying directed graphical models

Show simple item record

dc.contributor Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
dc.contributor Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.contributor Hosseini Roozbehani, Hajir
dc.contributor Polyanskiy, Yury
dc.creator Polyanskiy, Yury
dc.creator Hosseini Roozbehani, Hajir
dc.date 2016-01-27T15:14:28Z
dc.date 2016-01-27T15:14:28Z
dc.date 2014-06
dc.date.accessioned 2023-03-01T18:06:30Z
dc.date.available 2023-03-01T18:06:30Z
dc.identifier 978-1-4799-5186-4
dc.identifier http://hdl.handle.net/1721.1/100995
dc.identifier Roozbehani, Hajir, and Yury Polyanskiy. “Algebraic Methods of Classifying Directed Graphical Models.” 2014 IEEE International Symposium on Information Theory (June 2014).
dc.identifier https://orcid.org/0000-0001-7755-6814
dc.identifier https://orcid.org/0000-0002-2109-0979
dc.identifier.uri http://localhost:8080/xmlui/handle/CUHPOERS/278775
dc.description 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.
dc.description National Science Foundation (U.S.) (CAREER Award Grant Agreement CCF-12-53205)
dc.description Siemens Corporation (MIT Energy Initiative)
dc.format application/pdf
dc.language en_US
dc.publisher Institute of Electrical and Electronics Engineers (IEEE)
dc.relation http://dx.doi.org/10.1109/ISIT.2014.6875189
dc.relation Proceedings of the 2014 IEEE International Symposium on Information Theory
dc.rights Creative Commons Attribution-Noncommercial-Share Alike
dc.rights http://creativecommons.org/licenses/by-nc-sa/4.0/
dc.source MIT web domain
dc.title Algebraic methods of classifying directed graphical models
dc.type Article
dc.type http://purl.org/eprint/type/ConferencePaper


Files in this item

Files Size Format View
Polyanskiy_Algebraic methods.pdf 680.3Kb application/pdf View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse