In this paper we consider conditional independence models closed under graphoid properties. We investigate their representation by means of acyclic directed graphs (DAG). A new algorithm to build a DAG, given an ordering among random variables, is described and peculiarities and advantages of this approach are discussed. Finally, some properties ensuring the existence of perfect maps are provided. These conditions can be used to define a procedure able to find a perfect map for some classes of independence models.
Acyclic directed graphs to represent conditional independence models
BAIOLETTI, Marco;
2009
Abstract
In this paper we consider conditional independence models closed under graphoid properties. We investigate their representation by means of acyclic directed graphs (DAG). A new algorithm to build a DAG, given an ordering among random variables, is described and peculiarities and advantages of this approach are discussed. Finally, some properties ensuring the existence of perfect maps are provided. These conditions can be used to define a procedure able to find a perfect map for some classes of independence models.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.