Supplement to "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs"

2013/03/04 by Yangbo He, He, Yangbo, Jinzhu Jia +3
Mathematics · #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (stat.ML) #math.CO #stat.ML

paper · pdf · doi:10.48550/arxiv.1303.0632

14 papges

arxiv created 2013/08/10 · arxiv updated 2013/08/13

Abstract

This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs".

Cited by

• Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs

Related

• Markov Equivalences for Subclasses of Loopless Mixed Graphs
• A Polynomial-Time Algorithm for Deciding Markov Equivalence of Directed Cyclic Graphical Models
• On the number and size of Markov equivalence classes of random directed acyclic graphs
• Formulas for Counting the Sizes of Markov Equivalence Classes of Directed Acyclic Graphs
• A Transformational Characterization of Markov Equivalence for Directed Acyclic Graphs with Latent Variables