Seth Sullivant

Orcid: 0000-0002-5883-8768

According to our database1, Seth Sullivant authored at least 35 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On mixing behavior of a family of random walks determined by a linear recurrence.
Discret. Math., 2023

The $h^*$-Polynomial of the Order Polytope of the Zig-Zag Poset.
Electron. J. Comb., 2023

Identifiability of linear compartmental tree models and a general formula for input-output equations.
Adv. Appl. Math., 2023

2022
Structural identifiability of series-parallel LCR systems.
J. Symb. Comput., 2022

Exchangeable and sampling-consistent distributions on rooted binary trees.
J. Appl. Probab., 2022

Directed Gaussian graphical models with toric vanishing ideals.
Adv. Appl. Math., 2022

2021
Identifiability in phylogenetics using algebraic matroids.
J. Symb. Comput., 2021

Quasi-independence models with rational maximum likelihood estimator.
J. Symb. Comput., 2021

Toric geometry of the Cavender-Farris-Neyman model with a molecular clock.
Adv. Appl. Math., 2021

Markov equivalence of max-linear Bayesian networks.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

2019
Bounds on the Expected Size of the Maximum Agreement Subtree for a Given Tree Shape.
SIAM J. Discret. Math., 2019

2017
Unimodular binary hierarchical models.
J. Comb. Theory, Ser. B, 2017

Statistically Consistent <i>k</i>-mer Methods for Phylogenetic Tree Reconstruction.
J. Comput. Biol., 2017

Normal Binary Hierarchical Models.
Exp. Math., 2017

2016
Lifting Markov bases and higher codimension toric fiber products.
J. Symb. Comput., 2016

2015
Bounds on the Expected Size of the Maximum Agreement Subtree.
SIAM J. Discret. Math., 2015

Identifiability of 3-class Jukes-Cantor mixtures.
Adv. Appl. Math., 2015

2014
Distance-Based Phylogenetic MethodsAround a Polytomy.
IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Identifiable reparametrizations of linear compartment models.
J. Symb. Comput., 2014

2013
Positivity for Gaussian graphical models.
Adv. Appl. Math., 2013

Polyhedral combinatorics of UPGMA cones.
Adv. Appl. Math., 2013

2012
The Disentangling Number for Phylogenetic Mixtures.
SIAM J. Discret. Math., 2012

Geodesics in CAT(0) cubical complexes.
Adv. Appl. Math., 2012

Algebraic statistics.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
Identifiability of Two-Tree Mixtures for Group-Based Models.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Eulerian-Catalan Numbers.
Electron. J. Comb., 2011

2010
Identifying Causal Effects with Computer Algebra.
Proceedings of the UAI 2010, 2010

2008
Algebraic geometry of Gaussian Bayesian networks.
Adv. Appl. Math., 2008

2007
A finiteness theorem for Markov bases of hierarchical models.
J. Comb. Theory, Ser. A, 2007

2006
The space of compatible full conditionals is a unimodular toric variety.
J. Symb. Comput., 2006

Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models.
J. Symb. Comput., 2006

2005
Small Contingency Tables with Large Gaps.
SIAM J. Discret. Math., 2005

Toric Ideals of Phylogenetic Invariants.
J. Comput. Biol., 2005

2004
A Divide-and-Conquer Algorithm for Generating Markov Bases of Multi-way Tables.
Comput. Stat., 2004

2002
Gröbner Bases and Polyhedral Geometry of Reducible and Cyclic Models.
J. Comb. Theory, Ser. A, 2002


  Loading...