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

A Thomas, Peter J Green

Research output: Contribution to journalArticle (Academic Journal)

4 Citations (Scopus)

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 this 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.
Original languageEnglish
Pages (from-to)1232-1238
Number of pages7
JournalComputational Statistics & Data Analysis
Volume53
Publication statusPublished - 2009

Keywords

  • Graphical models, model estimation, triangulated graphs, chordal graphs, Markov chain Monte Carlo methods.

Fingerprint Dive into the research topics of 'Enumerating the decomposable neighbours of a decomposable graph under a simple perturbation scheme'. Together they form a unique fingerprint.

Cite this