Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
DOI10.1214/13-AOS1125zbMATH Open1360.62369arXiv1303.0632OpenAlexW2038769064MaRDI QIDQ385762FDOQ385762
Authors: Jinzhu Jia, Bin Yu, Yangbo He
Publication date: 11 December 2013
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.0632
Recommendations
- Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
- A characterization of Markov equivalence classes for acyclic digraphs
- The size distribution for Markov equivalence classes of acyclic digraph models.
- Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
- Counting Markov equivalence classes for DAG models on trees
Multivariate analysis (62H99) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)
Cites Work
- A characterization of Markov equivalence classes for acyclic digraphs
- Learning Bayesian networks: The combination of knowledge and statistical data
- Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- 10.1162/153244302760200696
- Title not available (Why is that?)
- Robust graphical modeling of gene networks using classical and alternative \(t\)-distributions
- Estimating high-dimensional intervention effects from observational data
- Markov Chains
- Title not available (Why is that?)
- Chain Graph Models and their Causal Interpretations
- 10.1162/153244303321897717
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- Active learning of causal networks with intervention experiments and optimal designs
- The size distribution for Markov equivalence classes of acyclic digraph models.
- Formulas for counting acyclic digraph Markov equivalence classes
- Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Cited In (12)
- Bayesian learning of multiple directed networks from observational data
- Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
- Objective Bayes model selection of Gaussian interventional essential graphs for the identification of signaling pathways
- Learning Markov equivalence classes of directed acyclic graphs: an objective Bayes approach
- Equivalence class selection of categorical graphical models
- Counting Markov equivalence classes for DAG models on trees
- Formulas for counting acyclic digraph Markov equivalence classes
- Exact estimation of multiple directed acyclic graphs
- Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs
- Bayesian Model Selection of Gaussian Directed Acyclic Graph Structures
- Structural Markov graph laws for Bayesian model uncertainty
- Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Uses Software
This page was built for publication: Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385762)