161 citations · 1k across the 69 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016★ 5 cited
Counting Markov Equivalence Classes by Number of Immoralities
Adityanarayanan Radhakrishnan, Liam Solus, Caroline Uhler
Two directed acyclic graphs (DAGs) are called Markov equivalent if and only if they have the same underlying undirected graph (i.e. skeleton) and the same set of immoralities. Usin…
math.ST2016★ 1 cited
Generalized Permutohedra from Probabilistic Graphical Models
Fatemeh Mohammadi, Caroline Uhler, Charles Wang +1
A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a sim…