Formulas for counting acyclic digraph Markov equivalence classes

DOI10.1016/J.JSPI.2004.10.007MaRDI QIDQ2491863zbMATH OpenOpenAlexFDO

Authors Steven B. Gillispie

Publication date 29 May 2006

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jspi.2004.10.007

zbMATH Keywords

Bayesian networkGMMchordal graphdaggraphical Markov modelessential graphADGcount

Mathematics Subject Classification ID

Inference from stochastic processes (62M99) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Enumeration in graph theory (05C30)

Recommendations

• A characterization of Markov equivalence classes for acyclic digraphs
• The size distribution for Markov equivalence classes of acyclic digraph models.
• Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
• Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
• Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3871363 (Why is no real title available?)
• scientific article; zbMATH DE number 3585466 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 3409391 (Why is no real title available?)
• 10.1162/153244302760200696
• A characterization of Markov equivalence classes for acyclic digraphs
• A graphical characterization of the largest chain graphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Learning Bayesian networks: The combination of knowledge and statistical data
• On rigid circuit graphs
• The size distribution for Markov equivalence classes of acyclic digraph models.

Cited in

(4)

• The size distribution for Markov equivalence classes of acyclic digraph models.
• Counting Markov equivalence classes for DAG models on trees
• An efficient algorithm for counting Markov equivalent DAGs
• Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs

This page was built for publication: Formulas for counting acyclic digraph Markov equivalence classes

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