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

TL;DR

This supplementary material provides additional theoretical results, examples, algorithms, and proofs to support the main paper on reversible MCMC methods for Markov equivalence classes of sparse DAGs.

Contribution

It introduces new algorithms and detailed proofs that extend the main work on reversible MCMC for sparse DAGs.

Findings

Enhanced algorithms for reversible MCMC

Additional proofs supporting main results

Illustrative examples and experiments

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".