161 citations · 1k across the 69 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2017★ 2 cited
Counting Markov Equivalence Classes for DAG models on Trees
Adityanarayanan Radhakrishnan, Liam Solus, Caroline Uhler
DAG models are statistical models satisfying a collection of conditional independence relations encoded by the nonedges of a directed acyclic graph (DAG) . Such models…
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.CO2015
Extremal Positive Semidefinite Matrices for Graphs without Minors
Liam Solus, Caroline Uhler, Ruriko Yoshida
For a graph with vertices the closed convex cone consists of all real positive semidefinite matrices with zeros in the off-diagonal…