Faithfulness in chain graphs: The discrete case
2009 (English)In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 50, no 8, 1306-1313 p.Article in journal (Refereed) Published
This paper deals with chain graphs under the classic Lauritzen-Wermuth-Frydenberg interpretation. We prove that the strictly positive discrete probability distributions with the prescribed sample space that factorize according to a chain graph G with dimension d have positive Lebesgue measure wrt R-d. whereas those that factorize according to G but are not faithful to it have zero Lebesgue measure wrt R-d. This means that, in the measure-theoretic sense described, almost all the strictly positive discrete probability distributions with the prescribed sample space that factorize according to G are faithful to it.
Place, publisher, year, edition, pages
2009. Vol. 50, no 8, 1306-1313 p.
Chain graphs, Faithfulness, Markov equivalence, Factorization equivalence, Largest chain graphs
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-52377DOI: 10.1016/j.ijar.2009.06.006OAI: oai:DiVA.org:liu-52377DiVA: diva2:282170