most citedTrek separation for Gaussian graphical models

50 citations · 95 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2012★ 19 cited

Network Parameterizations for the Grassmannian

Kelli Talaska, Lauren Williams

Deodhar introduced his decomposition of partial flag varieties as a tool for understanding Kazhdan-Lusztig polynomials. The Deodhar decomposition of the Grassmannian is also useful…

math.CO2012

Positivity for Gaussian graphical models

Jan Draisma, Seth Sullivant, Kelli Talaska

Gaussian graphical models are parametric statistical models for jointly normal random variables whose dependence structure is determined by a graph. In previous work, we introduced…

math.CO2012★ 9 cited

Determinants of weighted path matrices

Kelli Talaska

We find rational expressions for all minors of the weighted path matrix of a directed graph, generalizing the classical Lindstrom/Gessel-Viennot result for acyclic directed graphs…

stat.ML2008★ 50 cited

Trek separation for Gaussian graphical models

Seth Sullivant, Kelli Talaska, Jan Draisma

Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. Submatrices with low rank correspond to generalizations of conditional in…

math.CO2008★ 8 cited

Combinatorial formulas for Le-coordinates in a totally nonnegative Grassmannian

Kelli Talaska

Postnikov constructed a decomposition of a totally nonnegative Grassmannian into positroid cells. We provide combinatorial formulas that allow one to decide which cell a given poin…

math.CO2008★ 9 cited

A formula for Plücker coordinates associated with a planar network

Kelli Talaska

For a planar directed graph G, Postnikov's boundary measurement map sends positive weight functions on the edges of G onto the appropriate totally nonnegative Grassmann cell. We es…