Enumerating the junction trees of a decomposable graph

A Thomas, Peter J Green

Research output: Contribution to journalArticle (Academic Journal)peer-review

17 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)930-940
Number of pages11
JournalJournal of Computational and Graphical Statistics
Publication statusPublished - 2009


  • Chordal graphs, triangulated graphs, graphical models, Markov chain Monte Carlo methods.


Dive into the research topics of 'Enumerating the junction trees of a decomposable graph'. Together they form a unique fingerprint.

Cite this