Enumerating the junction trees of a decomposable graph.
We derive methods for enumerating the distinct junction tree representations for any given decomposable graph. We discuss the relevance of the method to estimating conditional independence graphs of graphical models and give an algorithm that, given a junction tree, will generate uniformly at random a tree from the set of those that represent the same graph. Programs implementing these methods are included as supplemental material.
Thomas
Alun
A
Department of Biomedical Informatics, University of Utah.
Green
Peter J
PJ