Source author record

Anna Seigal

Anna Seigal appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

9works
11topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

9 published item(s)

preprint2026arXiv

Causal discovery under mean independence and linearity

Causal discovery methods such as LiNGAM identify causal structure from observational data by assuming mutually independent disturbances. This assumption is fragile: shared volatility, common scale effects, or other forms of dependence can cause the methods to recover the wrong causal order, even with infinite data. We introduce the Linear Mean-Independent Acyclic Model (LiMIAM), which replaces full independence with weaker one-sided mean-independence restrictions on the disturbances. Under finite-order consequences of these restrictions, source nodes are generically identifiable, and hence a compatible causal order can be recovered recursively. Our proof is constructive and leads to DirectLiMIAM, a sequential residual-based algorithm for causal discovery under dependent noise. In simulations with mean-independent but dependent disturbances, DirectLiMIAM outperforms LiNGAM methods. A large-scale empirical application to the oil market highlights the implausibility of the independence assumption and the ability of DirectLiMIAM to recover a realistic causal ordering, from policy to production and from prices to inflation.

preprint2022arXiv

Symmetries in Directed Gaussian Graphical Models

We define Gaussian graphical models on directed acyclic graphs with coloured vertices and edges, calling them RDAG (restricted directed acyclic graph) models. If two vertices or edges have the same colour, their parameters in the model must be the same. We present an algorithm to find the maximum likelihood estimate (MLE) in an RDAG model, and characterise when the MLE exists, via linear independence conditions. We relate properties of a graph, and its colouring, to the number of samples needed for the MLE to exist and to be unique. We also characterise when an RDAG model is equal to an associated undirected graphical model and study connections to groups and invariant theory. We provide examples and simulations to study the benefits of RDAGs over uncoloured DAGs.

preprint2021arXiv

The Maximum Likelihood Degree of Linear Spaces of Symmetric Matrices

We study multivariate Gaussian models that are described by linear conditions on the concentration matrix. We compute the maximum likelihood (ML) degrees of these models. That is, we count the critical points of the likelihood function over a linear space of symmetric matrices. We obtain new formulae for the ML degree, one via Schubert calculus, and another using Segre classes from intersection theory. We settle the case of codimension one models, and characterize the degenerate case when the ML degree is zero.

preprint2020arXiv

Ranks and Singularities of Cubic Surfaces

We explore the connection between the rank of a polynomial and the singularities of its vanishing locus. We first describe the singularity of generic polynomials of fixed rank. We then focus on cubic surfaces. Cubic surfaces with isolated singularities are known to fall into 22 singularity types. We compute the rank of a cubic surface of each singularity type. This enables us to find the possible singular loci of a cubic surface of fixed rank. Finally, we study connections to the Hessian discriminant. We show that a cubic surface with singularities that are not ordinary double points lies on the Hessian discriminant, and that the Hessian discriminant is the closure of the rank six cubic surfaces.

preprint2016arXiv

Applied Algebra and Geometry: A SIAGA of Seven Pictures

The cover of the SIAM Journal on Applied Algebra and Geometry shows seven pictures. We describe these pictures and discuss the topics they represent. About the Author: Anna Seigal is a graduate student at UC Berkeley working in applied algebra. Her interests lie in tensors and applications to biological systems. She has a particular penchant for writing about mathematics in terms of pictures and also blogs on this subject at https://picturethismaths.wordpress.com/.

preprint2016arXiv

Does Antibiotic Resistance Evolve in Hospitals?

Nosocomial outbreaks of bacteria are well-documented. Based on these incidents, and the heavy usage of antibiotics in hospitals, it has been assumed that antibiotic resistance evolves in hospital environments. To test this assumption, we studied resistance phenotypes of bacteria collected from patient isolates at a community hospital over a 2.5-year period. A graphical model analysis shows no association between resistance and patient information other than time of arrival. This allows us to focus on time course data. We introduce a Hospital Transmission Model, based on negative binomial delay. Our main contribution is a statistical hypothesis test called the Nosocomial Evolution of Resistance Detector (NERD). It calculates the significance of resistance trends occurring in a hospital. It can inform hospital staff about the effects of various practices and interventions, can help detect clonal outbreaks, and is available as an R-package. We applied the NERD method to each of the 16 antibiotics in the study via 16 hypothesis tests. For 13 of the antibiotics, we found that the hospital environment had no significant effect upon the evolution of resistance; the hospital is merely a piece of the larger picture. The p-values obtained for the other three antibiotics (Cefepime, Ceftazidime and Gentamicin) indicate that particular care should be taken in hospital practices with these antibiotics. One of the three, Ceftazidime, was significant after accounting for multiple hypotheses, indicating a trend of decreased resistance for this drug.

preprint2016arXiv

Gram Determinants of Real Binary Tensors

A binary tensor consists of $2^n$ entries arranged into hypercube format $2 \times 2 \times \cdots \times 2$. There are $n$ ways to flatten such a tensor into a matrix of size $2 \times 2^{n-1}$. For each flattening, $M$, we take the determinant of its Gram matrix, ${\rm det }(M M^T)$. We consider the map that sends a tensor to its $n$-tuple of Gram determinants. We propose a semi-algebraic characterization of the image of this map. This offers an answer to a question raised by Hackbusch and Uschmajew concerning the higher-order singular values of tensors.