首页 | 本学科首页   官方微博 | 高级检索  
     


Faithfulness in chain graphs: The discrete case
Authors:Jose M. Pe  a
Affiliation:aLaboratory for Intelligent Information Systems, Department of Computer and Information Science, Linköping University, SE-58183 Linköping, Sweden
Abstract: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 View the MathML source, whereas those that factorize according to G but are not faithful to it have zero Lebesgue measure wrt View the MathML source. 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.
Keywords:Chain graphs   Faithfulness   Markov equivalence   Factorization equivalence   Largest chain graphs
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号