Algebraic statistics: Problems in phylogenetics and wasserstein distance optimization

Simple item page
dc.contributor.advisorGross, Elizabeth
dc.contributor.authorNometa, Ikenna
dc.contributor.departmentMathematics
dc.date.accessioned2025-09-30T22:32:25Z
dc.date.available2025-09-30T22:32:25Z
dc.date.issued2025
dc.description.degreePh.D.
dc.identifier.urihttps://hdl.handle.net/10125/111298
dc.subjectMathematics
dc.subjectApplied mathematics
dc.subjectAlgebraic Phylogenetics
dc.subjectAlgebraic Statistics
dc.subjectBrownian motion tree model
dc.subjectML-Degree
dc.subjectPolar degrees
dc.subjectWasserstein distance
dc.titleAlgebraic statistics: Problems in phylogenetics and wasserstein distance optimization
dc.typeThesis
dcterms.abstractAlgebraic statistics is an emerging field of applied mathematics at the intersectionof algebraic geometry, commutative algebra, and statistics, driven by the observation that polynomial equations govern many statistical models and inference problems. This dissertation contributes to the theoretical foundations of algebraic statistics by addressing three problems of contemporary interest: the structure of phylogenetic invariants for network-based models, the algebraic complexity of maximum likelihood estimation in Brownian motion tree models, and the computation of Wasserstein distance to statistical models. The first contribution characterizes the phylogenetic invariants of group-based Cavender-Farris-Neyman (CFN) models on level-1 phylogenetic networks. Building on recent work that reduces the study of invariants of arbitrary level-1 networks to that of sunlet networks, we show that the CFN model on a sunlet network admits a parameterization that factors through the space of skew-symmetric matrices. In this formulation, the associated phylogenetic variety is cut out by specific sub-Pfaffians, leading to an explicit description of the generators of their defining ideal. Second, we focus on the maximum likelihood degree (ML-degree) of Brownian motion tree models, which are Gaussian graphical models encoding trait evolution. We show that the ML-degree is invariant under root choice and derive a closed-form expression for the ML-degree in the case of star trees. Finally, we examine the algebraic complexity of computing the Wasserstein distance to statistical models, utilizing recent geometric formulations that lead to the computation of polar degrees of projective varieties. Restricting to small toric models, we compute the polar degrees of rational normal scrolls and some graphical models. Together, these results deepen our understanding of the polynomial structure and algebraic complexity of statistical models central to phylogenetics and optimization, offering new tools and directions for research in algebraic statistics.
dcterms.extent188 pages
dcterms.languageen
dcterms.publisherUniversity of Hawai'i at Manoa
dcterms.rightsAll UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.
dcterms.typeText
local.identifier.alturihttps://www.proquest.com/LegacyDocView/DISSNUM/32165607

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Nometa_hawii_0085A_12706.pdf
Size:
880.65 KB
Format:
Adobe Portable Document Format
Download

Collections

Ph.D. - Mathematics