SearcharxivSearch

arXiv subjects

Samantha Moore

Publications and source records attributed to Samantha Moore.

4 recordsLinked to original sources

Bigraded Betti numbers and Generalized Persistence Diagrams

Commutative diagrams of vector spaces and linear maps over $\mathbb{Z}^2$ are objects of interest in topological data analysis (TDA) where this type of diagrams are called 2-parameter persistence modules. Given that quiver representation theory tells us that such diagrams are of wild type, studying informative invariants of a 2-parameter persistence module $M$ is of central importance in TDA. One of such invariants is the generalized rank invariant, recently introduced by Kim and Mémoli. Via the Möbius inversion of the generalized rank invariant of $M$, we obtain a collection of connected subsets $I\subset\mathbb{Z}^2$ with signed multiplicities. This collection generalizes the well known notion of persistence barcode of a persistence module over $\mathbb{R}$ from TDA. In this paper we show that the bigraded Betti numbers of $M$, a classical algebraic invariant of $M$, are obtained by counting the corner points of these subsets $I$s. Along the way, we verify that an invariant of 2-parameter persistence modules called the interval decomposable approximation (introduced by Asashiba et al.) also encodes the bigraded Betti numbers in a similar fashion. We also show that the aforementioned results are optimal in the sense that they cannot be extended to $d$-parameter persistence modules for $d \geq 3$.

math.AT

Core motifs predict dynamic attractors in combinatorial threshold-linear networks

Combinatorial threshold-linear networks (CTLNs) are a special class of inhibition-dominated TLNs defined from directed graphs. Like more general TLNs, they display a wide variety of nonlinear dynamics including multistability, limit cycles, quasiperiodic attractors, and chaos. In prior work, we have developed a detailed mathematical theory relating stable and unstable fixed points of CTLNs to graph-theoretic properties of the underlying network. Here we find that a special type of fixed points, corresponding to core motifs, are predictive of both static and dynamic attractors. Moreover, the attractors can be found by choosing initial conditions that are small perturbations of these fixed points. This motivates us to hypothesize that dynamic attractors of a network correspond to unstable fixed points supported on core motifs. We tested this hypothesis on a large family of directed graphs of size $n=5$, and found remarkable agreement. Furthermore, we discovered that core motifs with similar embeddings give rise to nearly identical attractors. This allowed us to classify attractors based on structurally-defined graph families. Our results suggest that graphical properties of the connectivity can be used to predict a network's complex repertoire of nonlinear dynamics.

q-bio.NC

A Combinatorial Formula for the Bigraded Betti Numbers

It has been shown that $1$-parameter persistence modules have a very simple classification, namely there is a discrete invariant called a barcode that completely characterizes $1$-parameter persistence modules up to isomorphism. In contrast, Carlsson and Zomorodian showed that $n$-parameter persistence modules have no such "nice" classification when $n>1$; every discrete invariant is incomplete. Despite their incompleteness, discrete invariants can still provide insight into the properties of multiparameter persistence modules. A well-studied discrete invariant for $2$-parameter persistence modules is the bigraded Betti numbers. Through commutative algebra techniques, it is known that the bigraded Betti numbers of a $2$-parameter persistence module $M$ can be recovered from the barcodes of certain zigzag modules within $M$ via a simple combinatorial formula. We present an alternate proof of this formula that relies only on basic linear algebra.

math.AT

Hyperplane Restrictions of Indecomposable $n$-Dimensional Persistence Modules

Understanding the structure of indecomposable $n$-dimensional persistence modules is a difficult problem, yet is foundational for studying multipersistence. To this end, Buchet and Escolar showed that any finitely presented rectangular $(n-1)$-dimensional persistence module with finite support is a hyperplane restriction of an $n$-dimensional persistence module. We extend this result to the following: If $M$ is any finitely presented $(n-1)$-dimensional persistence module with finite support, then there exists an indecomposable $n$-dimensional persistence module $M'$ such that $M$ is the restriction of $M'$ to a hyperplane. We also show that any finite zigzag persistence module is the restriction of some indecomposable $3$-dimensional persistence module to a path.

math.AT