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

Authors:
Alun Thomas;Peter J. Green
Affiliations:
Department of Biomedical Informatics, University of Utah, USA;Department of Mathematics, University of Bristol, Bristol BS8 1TW, UK
Venue:
Computational Statistics & Data Analysis
Year:
2009

Citing 4
Cited 0

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
BIFROST—block recursive models induced from relevant knowledge, observations, and statistical techniques

Computational Statistics & Data Analysis - Special issue dedicated to Toma´sˇ Havra´nek
Efficient Stepwise Selection in Decomposable Models

UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Sparse graphical models for exploring gene expression data

Journal of Multivariate Analysis

Quantified Score

Hi-index	0.03

Visualization

Abstract

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 chain Monte Carlo methods that sample or optimize over the space of decomposable graphical models according to probabilities determined by a posterior distribution given observed multivariate data.