Nicholas Eriksson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nicholas Eriksson has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Seth Sullivant
Department of Mathematics, North Carolina State University, Raleigh, USA
2 shared publications - Alessandro Rinaldo
Department of Statistics Carnegie Mellon University Pittsburgh USA
1 shared publication Bernd Sturmfels
Department of Mathematics University of California Berkeley 94720 CA USA
1 shared publication- Bernd Sturmfels
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
1 shared publication - Kristian Ranestad
University of Oslo, Oslo, Norway
1 shared publication Niko Beerenwinkel
Department of Mathematics University of California Berkeley 94720 CA USA
1 shared publication
Latest Publications
- Open Access
Evolution on distributive lattices
We consider the directed evolution of a population after an intervention that has significantly altered the underlying fitness landscape. We model the space of genotypes as a distributive lattice; the fitness landscape is a real-valued function on that lattice. The risk of escape from intervention, i.e., the probability that the population develops an escape mutant before extinction, is encoded in the risk polynomial. Tools from algebraic combinatorics are applied to compute the risk polynomial in terms of the fitness landscape. In an application to the development of drug resistance in HIV, we study the risk of viral escape from treatment with the protease inhibitors ritonavir and indinavir.
Open AccessEvolution on distributive lattices
We consider the directed evolution of a population after an intervention that has significantly altered the underlying fitness landscape. We model the space of genotypes as a distributive lattice; the fitness landscape is a real-valued function on that lattice. The risk of escape from intervention, i.e., the probability that the population develops an escape mutant before extinction, is encoded in the risk polynomial. Tools from algebraic combinatorics are applied to compute the risk polynomial in terms of the fitness landscape. In an application to the development of drug resistance in HIV, we study the risk of viral escape from treatment with the protease inhibitors ritonavir and indinavir.
- Open Access
Markov bases for noncommutative Fourier analysis of ranked data
To calibrate Fourier analysis of $S_5$ ranking data by Markov chain Monte Carlo techniques, a set of moves (Markov basis) is needed. We calculate this basis, and use it to provide a new statistical analysis of two data sets. The calculation involves a large Gr\"obner basis computation (45825 generators), but reduction to a minimal basis and reduction by natural symmetries leads to a remarkably small basis (14 elements). Although the Gr\"obner basis calculation is infeasible for $S_6$, we exploit the symmetry of the problem to calculate a Markov basis for $S_6$ with 7,113,390 elements in 58 symmetry classes. We improve a bound on the degree of the generators for a Markov basis for $S_n$ and conjecture that this ideal is generated in degree 3.Open AccessMarkov bases for noncommutative Fourier analysis of ranked data
To calibrate Fourier analysis of $S_5$ ranking data by Markov chain Monte Carlo techniques, a set of moves (Markov basis) is needed. We calculate this basis, and use it to provide a new statistical analysis of two data sets. The calculation involves a large Gr\"obner basis computation (45825 generators), but reduction to a minimal basis and reduction by natural symmetries leads to a remarkably small basis (14 elements). Although the Gr\"obner basis calculation is infeasible for $S_6$, we exploit the symmetry of the problem to calculate a Markov basis for $S_6$ with 7,113,390 elements in 58 symmetry classes. We improve a bound on the degree of the generators for a Markov basis for $S_n$ and conjecture that this ideal is generated in degree 3. - Open Access
Phylogenetic Algebraic Geometry
Phylogenetic algebraic geometry is concerned with certain complex projective algebraic varieties derived from finite trees. Real positive points on these varieties represent probabilistic models of evolution. For small trees, we recover classical geometric objects, such as toric and determinantal varieties and their secant varieties, but larger trees lead to new and largely unexplored territory. This paper gives a self-contained introduction to this subject and offers numerous open problems for algebraic geometers.
Open AccessPhylogenetic Algebraic Geometry
Phylogenetic algebraic geometry is concerned with certain complex projective algebraic varieties derived from finite trees. Real positive points on these varieties represent probabilistic models of evolution. For small trees, we recover classical geometric objects, such as toric and determinantal varieties and their secant varieties, but larger trees lead to new and largely unexplored territory. This paper gives a self-contained introduction to this subject and offers numerous open problems for algebraic geometers.
- Open Access
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if the observed margins lie in the relative interior of the marginal cone. Using this description, we give an algorithm for determining if the MLE exists. If the tree width is bounded, the algorithm runs in polynomial time. We also perform a computational study of the case of three random variables under the no three-factor effect model.
Open AccessPolyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if the observed margins lie in the relative interior of the marginal cone. Using this description, we give an algorithm for determining if the MLE exists. If the tree width is bounded, the algorithm runs in polynomial time. We also perform a computational study of the case of three random variables under the no three-factor effect model.