Abstract
In the present discussion we highlight the applicability of the method proposed by the authors beyond the space of random partitions, to Directed Acyclic Graphs (DAGs) and to their Markov equivalence classes, namely to Essential Graphs (EGs).
Lingua originale | English |
---|---|
pagine (da-a) | 47-49 |
Numero di pagine | 3 |
Rivista | Bayesian Analysis |
DOI | |
Stato di pubblicazione | Pubblicato - 2018 |
Keywords
- Directed Acyclic Graphs
- Essential Graphs