arXiv subjects

Evgeniya Lagoda

Publications and source records attributed to Evgeniya Lagoda.

6 recordsLinked to original sources

arXiv2025

Persistent Homology for Labeled Datasets: Gromov-Hausdorff Stability and Generalized Landscapes

Techniques from metric geometry have become fundamental tools in modern mathematical data science, providing principled methods for comparing datasets modeled as finite metric spaces. Two of the central tools in this area are the Gromov-Hausdorff distance and persistent homology, both of which yield isometry-invariant notions of distance between datasets. However, these frameworks do not account for categorical labels, which are intrinsic to many real-world datasets, such as labeled images, pre-clustered data, and semantically segmented shapes. In this paper, we introduce a general framework for labeled metric spaces and develop new notions of Gromov-Hausdorff distance and persistent homology which are adapted to this setting. Our main result shows that our persistent homology construction is stable with respect to our novel notion of Gromov-Hausdorff distance, extending a classic result in topological data analysis. To facilitate computation, we also introduce a labeled version of persistence landscapes and show that the landscape map is Lipschitz.

math.AT↗

arXiv2025

Gromov-Hausdorff distances, Borsuk-Ulam theorems, and Vietoris-Rips complexes

We explore emerging relationships between the Gromov--Hausdorff distance, Borsuk--Ulam theorems, and Vietoris--Rips simplicial complexes. The Gromov--Hausdorff distance between two metric spaces $X$ and~$Y$ can be lower bounded by the distortion of (possibly discontinuous) functions between them. The more these functions must distort the metrics, the larger the Gromov--Hausdorff distance must be. Topology has few tools to obstruct the existence of discontinuous functions. However, an arbitrary function $f\colon X\to Y$ induces a continuous map between their Vietoris--Rips simplicial complexes, where the allowable choices of scale parameters depend on how much the function $f$ distorts distances. We can then use equivariant topology to obstruct the existence of certain continuous maps between Vietoris--Rips complexes. With these ideas we bound how discontinuous an odd map between spheres $S^k\to S^n$ with $k>n$ must be, generalizing a result by Dubins and Schwarz (1981), which is the case $k=n+1$. As an application, we recover or improve upon all of the lower bounds from Lim, M{é}moli, and Smith (2022) on the Gromov--Hausdorff distances between spheres of different dimensions. We also provide new upper bounds on the Gromov--Hausdorff distance between spheres of adjacent dimensions.

math.MG↗

arXiv2024

Persistent equivariant cohomology

This article has two goals. First, we hope to give an accessible introduction to persistent equivariant cohomology. Given a topological group $G$ acting on a filtered space, persistent Borel equivariant cohomology measures not only the shape of the filtration, but also attributes of the group action on the filtration, including in particular its fixed points. Second, we give an explicit description of the persistent equivariant cohomology of the circle action on the Vietoris-Rips metric thickenings of the circle, using the Serre spectral sequence and the Gysin homomorphism. Indeed, if $\frac{2πk}{2k+1} \le r < \frac{2π(k+1)}{2k+3}$, then $H^*_{S^1}(\mathrm{VR}^\mathrm{m}(S^1;r))\cong \mathbb{Z}[u]/(1\cdot3\cdot5\cdot\ldots \cdot (2k+1)\, u^{k+1})$ where $\mathrm{deg}(u)=2$.

math.AT↗

arXiv2024

Steenrod operations on polyhedral products

We describe the action of the mod $2$ Steenrod algebra on the cohomology of various polyhedral products and related spaces. We carry this out for Davis-Januszkiewicz spaces and their generalizations, for moment-angle complexes as well as for certain polyhedral joins. By studying the combinatorics of underlying simplicial complexes, we deduce some consequences for the lowest cohomological dimension in which non-trivial Steenrod operations can appear. We present a version of cochain-level formulas for Steenrod operations on simplicial complexes. We explain the idea of "propagating" such formulas from a simplicial complex $K$ to polyhedral joins over $K$ and we give examples of this process. We tie the propagation of the Steenrod algebra actions on polyhedral joins to those on moment-angle complexes. Although these are cases where one can understand the Steenrod action via a stable homotopy decomposition, we anticipate applying this method to cases where there is no such decomposition.

math.AT↗

arXiv2024

Book crossing numbers of the complete graph and small local convex crossing numbers

A $ k $-page book drawing of a graph $ G $ is a drawing of $ G $ on $ k $ halfplanes with common boundary $ l $, a line, where the vertices are on $ l $ and the edges cannot cross $ l $. The $ k $-page book crossing number of the graph $ G $, denoted by $ ν_k(G) $, is the minimum number of edge-crossings over all $ k $-page book drawings of $ G $. Let $G=K_n$ be the complete graph on $n$ vertices. We improve the lower bounds on $ ν_k(K_n) $ for all $ k\geq 14 $ and determine $ ν_k(K_n) $ whenever $ 2 < n/k \leq 3 $. Our proofs rely on bounding the number of edges in convex graphs with small local crossing numbers. In particular, we determine the maximum number of edges that a convex graph with local crossing number at most $ \ell $ can have for $ \ell\leq 4 $.

math.CO↗

arXiv2024

Understanding High-Order Network Structure using Permissible Walks on Attributed Hypergraphs

Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevance is how to leverage information carried in hypergraph attributions when doing walk-based techniques. In this work, we focus on a new generalization of a walk in a network that recovers previous approaches and allows for a description of permissible walks in hypergraphs. Permissible walk graphs are constructed by intersecting the attributed $s$-line graph of a hypergraph with a relation respecting graph. The attribution of the hypergraph's line graph commonly carries over information from categorical and temporal attributions of the original hypergraph. To demonstrate this approach on a temporally attributed example, we apply our framework to a Reddit data set composed of hyperedges as threads and authors as nodes where post times are tracked.

cs.SI↗