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

DOI10.1016/J.CSDA.2008.10.029MaRDI QIDQ961265zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alun Thomas, P. J. Green

Publication date 30 March 2010

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL http://europepmc.org/articles/pmc2680312

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Applications of graph theory (05C90) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Recommendations

• Sampling decomposable graphs using a Markov chain on junction trees
• scientific article; zbMATH DE number 3979108
• Markov bases for decomposable graphical models
• Decomposable graphical Gaussian model determination
• Hyper Markov laws in the statistical analysis of decomposable graphical models

Cites work

• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
• Decomposable graphical Gaussian model determination
• Decomposition of maximum likelihood in mixed graphical interaction models
• Equation of state calculations by fast computing machines
• Experiments in stochastic computation for high-dimensional graphical models
• Monte Carlo sampling methods using Markov chains and their applications
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Sparse graphical models for exploring gene expression data

Cited in

(4)

• Efficient local updates for undirected graphical models
• Sampling decomposable graphs using a Markov chain on junction trees
• Sequential sampling of junction trees for decomposable graphs
• scientific article; zbMATH DE number 3979108 (Why is no real title available?)

Describes a project that uses

Uses Software

• HdBCS

This page was built for publication: Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q961265)