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

DOI10.1016/J.CSDA.2008.10.029zbMATH Open1452.62129DBLPjournals/csda/ThomasG09OpenAlexW2065410169WikidataQ43130215 ScholiaQ43130215MaRDI QIDQ961265FDOQ961265

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

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

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)

Cites Work

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

Cited In (4)

• Sampling decomposable graphs using a Markov chain on junction trees
• Sequential sampling of junction trees for decomposable graphs
• Title not available (Why is that?)
• Efficient local updates for undirected graphical models

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)