Search UTSePress Research

Browse

Now showing items 1-2 of 2

Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme

Thomas A; Green Peter (Elsevier Science Bv, 2009)

Given a decomposable graph, we characterize and enumerate the set of pairs of vertices whose connection or disconnection results in a new graph that is also decomposable. We discuss the relevance of these results to Markov ...
Enumerating The Junction Trees Of A Decomposable Graph

Thomas A; Green Peter (Amer Statistical Assoc, 2009)

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 ...

Now showing items 1-2 of 2