1 citations · 1 across the 8 of their papers we have counts for
9 papers
Identifiability of phylogenetic networks and quintet concordance factors
Joseph Cummings, Maize Curiel, Bryan Currie +3
Several statistical methods of phylogenetic network inference and testing for non-tree-like relationships are based on assessing genomic data through quartet Concordance Factors, t…
Common Real Secants to Pairs of Real Twisted Cubic Curves
Saima Aslam, Matthew Faust, Jonathan D. Hauenstein +5
It is well established that a general pair of twisted cubic curves in complex projective space has ten common secant lines. As an initial investigation, we show that the monodromy…
The poset of maximal tubings of the cycle graph is a lattice
Ben Adenbaum, Emily Barnard, Max Hlavacek +4
The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets…
Identifiability of Large Phylogenetic Mixtures for Many Phylogenetic Model Structures
Bryson Kagy, Seth Sullivant
Identifiability of phylogenetic models is a necessary condition to ensure that the model parameters can be uniquely determined from data. Mixture models are phylogenetic models whe…
Methodological considerations for semialgebraic hypothesis testing with incomplete U-statistics
David Barnhill, Marina Garrote-López, Elizabeth Gross +4
Recently, Sturma, Drton, and Leung proposed a general-purpose stochastic method for hypothesis testing in models defined by polynomial equality and inequality constraints. Notably,…
New directions in algebraic statistics: Three challenges from 2023
Yulia Alexandr, Miles Bakenhus, Mark Curiel +11
In the last quarter of a century, algebraic statistics has established itself as an expanding field which uses multilinear algebra, commutative algebra, computational algebra, geom…
Equidistant Circular Split Networks
Bryson Kagy, Seth Sullivant
Phylogenetic networks are generalizations of trees that allow for the modeling of non-tree like evolutionary processes. Split networks give a useful way to construct networks with…
Phase Transition in the One-bit Johnson-Lindenstrauss Lemma
Amadou Bah, Bryson Kagy, Emily Smith
The Johnson-Lindenstrauss Lemma (J-L Lemma) is a cornerstone of dimension reduction techniques. We study it in the one-bit context, namely we consider the unit sphere $ \mathbb S ^…
An analysis of a fair division protocol for drawing legislative districts
Jessica De Silva, Brady Gales, Bryson Kagy +1
Landau, Reid, and Yershov [A Fair Division Solution to the Problem of Redistricting, \textit{Social Choice and Welfare}, 2008] propose a protocol for drawing legislative districts…