Counting Markov Equivalent Directed Acyclic Graphs Consistent with Background Knowledge (2206.06744v2)
Abstract: A polynomial-time exact algorithm for counting the number of directed acyclic graphs in a Markov equivalence class was recently given by Wien\"obst, Bannach, and Li\'skiewicz (AAAI 2021). In this paper, we consider the more general problem of counting the number of directed acyclic graphs in a Markov equivalence class when the directions of some of the edges are also fixed (this setting arises, for example, when interventional data is partially available). This problem has been shown in earlier work to be complexity-theoretically hard. In contrast, we show that the problem is nevertheless tractable in an interesting class of instances, by establishing that it is ``fixed-parameter tractable''. In particular, our counting algorithm runs in time that is bounded by a polynomial in the size of the graph, where the degree of the polynomial does \emph{not} depend upon the number of additional edges provided as input.
- A Characterization of Markov Equivalence Classes for Acyclic Digraphs. Annals of Statistics, 25(2):505–541, 1997.
- On Sampling Graphical Markov Models. arXiv:1705.09717, 2017.
- David Maxwell Chickering. A Transformational Characterization of Equivalent Bayesian Network Structures. In Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI 1995), pages 87–98, 1995.
- Parameterized Algorithms. Springer International Publishing, 2015.
- Robust Graphical Modeling of Gene Networks using Classical and Alternative t𝑡titalic_t-Distributions. Annals of Applied Statistics, pages 1057–1080, 2011.
- Nir Friedman. Inferring Cellular Networks using Probabilistic Graphical Models. Science, 303(5659):799–805, 2004.
- Incidence Matrices and Interval Graphs. Pacific Journal of Mathematics, 15:835–855, 1965.
- An Efficient Algorithm for Counting Markov Equivalent DAGs. In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), volume 34, pages 10136–10143, 2020.
- Counting and Sampling from Markov Equivalent DAGs using Clique Trees. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019), volume 33, pages 3664–3671, 2019.
- Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs. Journal of Machine Learning Research, 13:2409–2464, 2012.
- Formulas for Counting the Sizes of Markov Equivalence Classes of Directed Acyclic Graphs. arXiv:1610.07921, 2016.
- Counting and Exploring Sizes of Markov Equivalence Classes of Directed Acyclic Graphs. Journal of Machine Learning Research, 16(1):2589–2609, 2015.
- Graphical Models for Game Theory. In Proceedings of the 17th Conference on Uncertainity in Artifical Intelligence conference (UAI 2001), pages 253–260, 2001.
- Bayesian Model Averaging and Model Selection for Markov Equivalence Classes of Acyclic Digraphs. Communications in Statistics–Theory and Methods, 25:2493–2519, 1996.
- Christopher Meek. Causal Inference and Causal Explanation with Background Knowledge. In Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI 1995), pages 403–410, 1995.
- Judea Pearl. Causality: Models, Reasoning and Inference. Cambridge University Press, 2009.
- Embedding Physics Domain Knowledge into a Bayesian Network Enables Layer-by-Layer Process Innovation for Photovoltaics. NPJ Computational Materials, 6(1):9, January 2020.
- Algorithmic Aspects of Vertex Elimination on Graphs. SIAM Journal on Computing, 5(2):266–283, 1976.
- Counting and Sampling Markov Equivalent Directed Acyclic Graphs. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019), volume 33, pages 7984–7991, 2019.
- Equivalence and Synthesis of Causal Models. In Proceedings of the 6th Conference on Uncertainity in Artifical Intelligence conference (UAI 1990), pages 220–227, 1990.
- Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), pages 12198–12206, 2021.
- Jean R. S. Blair and Barry Peyton. An introduction to Chordal Graphs and Clique Trees. In Graph Theory and Sparse Matrix Computation, pages 1–29. Springer, 1993.
- Exploring network structure, dynamics, and function using networkx. In Gaël Varoquaux, Travis Vaught, and Jarrod Millman, editors, Proceedings of the 7th Python in Science Conference, pages 11 – 15, Pasadena, CA USA, 2008.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.