Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs

zbMATH Open1351.68211MaRDI QIDQ2788374FDOQ2788374

Yangbo He, Jinzhu Jia, Bin Yu

Publication date: 19 February 2016

Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL: http://jmlr.csail.mit.edu/papers/v16/he15a.html

zbMATH Keywords

causalitydirected acyclic graphsMarkov equivalence classsize distribution

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Applications of graph theory (05C90) Directed graphs (digraphs), tournaments (05C20)

Cited In (13)

• Sound and complete causal identification with latent variables given local background knowledge
• A local method for identifying causal relations under Markov equivalence
• The size distribution for Markov equivalence classes of acyclic digraph models.
• Counting Markov equivalence classes for DAG models on trees
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• On the Markov equivalence of maximal ancestral graphs
• Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
• An efficient algorithm for counting Markov equivalent DAGs
• Fast causal orientation learning in directed acyclic graphs
• Causal structure learning: a combinatorial perspective
• Title not available (Why is that?)
• A review of Gaussian Markov models for conditional independence
• Beyond the mean: a flexible framework for studying causal effects using linear models

Uses Software

• TETRAD

This page was built for publication: Counting and exploring sizes of Markov equivalence classes of directed acyclic graphs

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