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

DOI10.1016/j.csda.2008.10.029zbMath1452.62129OpenAlexW2065410169WikidataQ43130215 ScholiaQ43130215MaRDI QIDQ961265

Peter J. Green, Alun Thomas

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) Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items

Efficient local updates for undirected graphical models ⋮ Sequential sampling of junction trees for decomposable graphs

Uses Software

• HdBCS

Cites Work

• Unnamed Item
• BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
• Sparse graphical models for exploring gene expression data
• Experiments in stochastic computation for high-dimensional graphical models
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Decomposition of maximum likelihood in mixed graphical interaction models
• Decomposable graphical Gaussian model determination
• Equation of State Calculations by Fast Computing Machines
• Monte Carlo sampling methods using Markov chains and their applications