Counting Markov equivalence classes for DAG models on trees

DOI10.1016/j.dam.2018.03.015zbMath1387.05104arXiv1706.06091OpenAlexW2641483345MaRDI QIDQ1752602

Adityanarayanan Radhakrishnan, Caroline Uhler, Liam Solus

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.06091

zbMATH Keywords

treesBayesian networkMarkov equivalence classMarkov equivalenceDAG modelimmoralities

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (4)

An efficient algorithm for counting Markov equivalent DAGs ⋮ Causal structure learning: a combinatorial perspective ⋮ Counting Markov equivalence classes for DAG models on trees ⋮ A review of Gaussian Markov models for conditional independence

Uses Software

• nauty
• Traces
• TETRAD

Cites Work

• Asymptotic enumeration of extensional acyclic digraphs
• The max-min hill-climbing Bayesian network structure learning algorithm
• A characterization of Markov equivalence classes for acyclic digraphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• \(r\)-stable hypersimplices
• Counting Markov equivalence classes for DAG models on trees
• A symmetric function generalization of the chromatic polynomial of a graph
• Practical graph isomorphism. II.
• On distinguishing trees by their chromatic symmetric functions
• Formulas for counting acyclic digraph Markov equivalence classes
• Unimodality, log-concavity, real-rootedness and beyond
• Bounds on the Expected Size of the Maximum Agreement Subtree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting Markov equivalence classes for DAG models on trees