Name
Abstract | ||
|---|---|---|
We consider the problem of counting the number of DAGs which are Markov equivalent, i.e., which encode the same conditional independencies between random variables. The problem has been studied, among others, in the context of causal discovery, and it is known that it reduces to counting the number of so-called moral acyclic orientations of certain undirected graphs, notably chordal graphs. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.artint.2021.103648 | Artificial Intelligence |
Keywords | DocType | Volume |
Markov equivalence,Computational complexity,Chordal graphs | Journal | 304 |
Issue | ISSN | Citations |
1 | 0004-3702 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Ganian | 1 | 208 | 40.19 |
| Thekla Hamm | 2 | 1 | 1.71 |
| Topi Talvitie | 3 | 7 | 5.01 |