Appendices

In Appendix B, we discuss the concept of identifiability off-DAGs and MarkovEquivalence Classes (MEC). Let E be a set of directed edges, such that there are no edges betweentwonodesofsametype(factorsorfeatures).Wedefinea FactorDirectedGraph (f-DiGraph) asthebipartitegraphGf =(V,F,E). By definition, we have thatGmd G for all m, which proves the reverse set inclusion. The case forDmd (σ) is slightly more technical. Also, each feature vertex va appearing afterfj gives rise to2j potential edge patterns and there areij+1 ij such vertices.