SearcharxivSearch

arXiv subjects

Ulrike Tillmann

Publications and source records attributed to Ulrike Tillmann.

At least 19 recordsLinked to original sources

The fiber of multiparameter persistent homology for simplicial complexes

Vector-valued functions on finite simplicial complexes give rise to multiparameter sublevel set filtrations and corresponding persistent homology. We study the associated inverse problem for multiparameter persistent homology (MPH) of $n$-filters on a fixed finite simplicial complex. We endow both the space of filters and the moduli space of essentially finite persistence modules with stratifications, where strata are given by orbits of natural actions of order-isomorphisms of the unit $n$-cube. The MPH map is then shown to be equivariant and strongly stratified. Over each stratum in the image, the MPH map restricts to a trivial fiber bundle whose fiber is a polyhedral complex. We provide an upper bound on the dimension of the fibers in terms of multigraded Betti numbers, recovering as a special case the known one-parameter bound obtained by Leygonie and Tillmann (2022).

math.AT

Topology across Scales on Heterogeneous Cell Data

Multiplexed imaging allows multiple cell types to be simultaneously visualised in a single tissue sample, generating unprecedented amounts of spatially-resolved, biological data. In topological data analysis, persistent homology provides multiscale descriptors of ``shape" suitable for the analysis of such spatial data. Here we propose a novel visualisation of persistence homology (PH) and fine-tune vectorisations thereof (exploring the effect of different weightings for persistence images, a prominent vectorisation of PH). These approaches offer new biological interpretations and promising avenues for improving the analysis of complex spatial biological data especially in multiple cell type data. To illustrate our methods, we apply them to a lung data set from fatal cases of COVID-19 and a data set from lupus murine spleen.

q-bio.QM

A notion of homotopy for directed graphs and their flag complexes

Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a homotopy-like equivalence relation on digraph maps such that equivalent maps induce identical maps on the homology of the directed flag complex. Thus, we obtain an equivalence relation on digraphs such that equivalent digraphs have directed flag complexes with isomorphic homology. With the help of these relations, we can prove a generic stability theorem for the persistent homology of the directed flag complex of filtered digraphs. In particular, we show that the persistent homology of the directed flag complex of the shortest-path filtration of a weighted directed acyclic graph is stable to edge subdivision. In contrast, we also discuss some important instabilities that are not present in persistent path homology. We also derive similar equivalence relations for ordered simplicial complexes at large. Since such complexes can alternatively be viewed as simplicial sets, we verify that these two perspectives yield identical relations.

math.AT

Homology stability for asymptotic monopole moduli spaces

We prove homological stability for two different flavours of asymptotic monopole moduli spaces, namely moduli spaces of framed Dirac monopoles and moduli spaces of ideal monopoles. The former are Gibbons-Manton torus bundles over configuration spaces whereas the latter are obtained from them by replacing each circle factor of the fibre with a monopole moduli space by the Borel construction. They form boundary hypersurfaces in a partial compactification of the classical monopole moduli spaces. Our results follow from a general homological stability result for configuration spaces equipped with non-local data.

math.AT

Harder-Narasimhan Filtrations of Persistence Modules

The Harder-Narasimhan type of a quiver representation is a discrete invariant parameterised by a real-valued function (called a central charge) defined on the vertices of the quiver. In this paper, we investigate the strength and limitations of Harder-Narasimhan types for several families of quiver representations which arise in the study of persistence modules. We introduce the skyscraper invariant, which amalgamates the HN types along central charges supported at single vertices, and generalise the rank invariant from multiparameter persistence modules to arbitrary quiver representations. Our four main results are as follows: (1) we show that the skyscraper invariant is strictly finer than the rank invariant in full generality, (2) we characterise the set of complete central charges for zigzag (and hence, ordinary) persistence modules, (3) we extend the preceding characterisation to rectangle-decomposable multiparameter persistence modules of arbitrary dimension; and finally, (4) we show that although no single central charge is complete for nestfree ladder persistence modules, a finite set of central charges is complete.

math.RT

Multiscale topology classifies and quantifies cell types in subcellular spatial transcriptomics

Spatial transcriptomics has the potential to transform our understanding of RNA expression in tissues. Classical array-based technologies produce multiple-cell-scale measurements requiring deconvolution to recover single cell information. However, rapid advances in subcellular measurement of RNA expression at whole-transcriptome depth necessitate a fundamentally different approach. To integrate single-cell RNA-seq data with nanoscale spatial transcriptomics, we present a topological method for automatic cell type identification (TopACT). Unlike popular decomposition approaches to multicellular resolution data, TopACT is able to pinpoint the spatial locations of individual sparsely dispersed cells without prior knowledge of cell boundaries. Pairing TopACT with multiparameter persistent homology landscapes predicts immune cells forming a peripheral ring structure within kidney glomeruli in a murine model of lupus nephritis, which we experimentally validate with immunofluorescent imaging. The proposed topological data analysis unifies multiple biological scales, from subcellular gene expression to multicellular tissue organization.

q-bio.QM

Harder-Narasimhan Filtrations and Zigzag Persistence

We introduce a sheaf-theoretic stability condition for finite acyclic quivers. Our main result establishes that for representations of affine type $\widetilde{\mathbb{A}}$ quivers, there is a precise relationship between the associated Harder-Narasimhan filtration and the barcode of the periodic zigzag persistence module obtained by unwinding the underlying quiver.

math.RT

Grounded persistent path homology: a stable, topological descriptor for weighted digraphs

Weighted digraphs are used to model a variety of natural systems and can exhibit interesting structure across a range of scales. In order to understand and compare these systems, we require stable, interpretable, multiscale descriptors. To this end, we propose grounded persistent path homology (GrPPH) - a new, functorial, topological descriptor that describes the structure of an edge-weighted digraph via a persistence barcode. We show there is a choice of circuit basis for the graph which yields geometrically interpretable representatives for the features in the barcode. Moreover, we show the barcode is stable, in bottleneck distance, to both numerical and structural perturbations. GrPPH arises from a flexible framework, parametrised by a choice of digraph chain complex and a choice of filtration; for completeness, we also investigate replacing the path homology complex, used in GrPPH, by the directed flag complex.

math.AT

The Space of Barcode Bases for Persistence Modules

The barcode of a persistence module serves as a complete combinatorial invariant of its isomorphism class. Barcodes are typically extracted by performing changes of basis on a persistence module until the constituent matrices have a special form. Here we describe a new algorithm for computing barcodes which also keeps track of, and outputs, such a change of basis. Our main result is an explicit characterisation of the group of transformations that sends one barcode basis to another. Armed with knowledge of the entire space of barcode bases, we are able to show that any map of persistence modules can be represented via a partial matching between bars provided that neither source nor target admits nested bars in its barcode. We also generalise the algorithm and results described above to work for zizag modules.

math.AT

The Fiber of Persistent Homology for simplicial complexes

We study the inverse problem for persistent homology: For a fixed simplicial complex $K$, we analyse the fiber of the continuous map $\mathrm{PH}$ on the space of filters that assigns to a filter $f: K \to \mathbb R$ the total barcode of its associated sublevel set filtration of $K$. We find that $\mathrm{PH}$ is best understood as a map of stratified spaces. Over each stratum of the barcode space, the map $\mathrm{PH}$ restricts to a (trivial) fiber bundle with fiber a polyhedral complex. Amongst other we derive a bound for the dimension of the fiber depending on the number of distinct endpoints in the barcode. Furthermore, taking the inverse image $\mathrm{PH}^{-1}$ can be extended to a monodromy functor on the (entrance path) category of barcodes. We demonstrate our theory on the example of the simplicial triangle giving a complete description of all fibers and monodromy maps. This example is rich enough to have a Möbius band as one of its fibers.

math.AT

Homology of homologous knotted proteins

Quantification and classification of protein structures, such as knotted proteins, often requires noise-free and complete data. Here we develop a mathematical pipeline that systematically analyzes protein structures. We showcase this geometric framework on proteins forming open-ended trefoil knots, and we demonstrate that the mathematical tool, persistent homology, faithfully represents their structural homology. This topological pipeline identifies important geometric features of protein entanglement and clusters the space of trefoil proteins according to their depth. Persistence landscapes quantify the topological difference between a family of knotted and unknotted proteins in the same structural homology class. This difference is localized and interpreted geometrically with recent advancements in systematic computation of homology generators. The topological and geometric quantification we find is robust to noisy input data, which demonstrates the potential of this approach in contexts where standard knot theoretic tools fail.

math.AT

Point-pushing actions for manifolds with boundary

Given a manifold $M$ and a point in its interior, the point-pushing map describes a diffeomorphism that pushes the point along a closed path. This defines a homomorphism from the fundamental group of $M$ to the group of isotopy classes of diffeomorphisms of $M$ that fix the basepoint. This map is well-studied in dimension $d = 2$ and is part of the Birman exact sequence. Here we study, for any $d \geqslant 3$ and $k \geqslant 1$, the map from the $k$-th braid group of $M$ to the group of homotopy classes of homotopy equivalences of the $k$-punctured manifold $M \smallsetminus z$, and analyse its injectivity. Equivalently, we describe the monodromy of the universal bundle that associates to a configuration $z$ of size $k$ in $M$ its complement, the space $M \smallsetminus z$. Furthermore, motivated by our work on the homology of configuration-mapping spaces, we describe the action of the braid group of $M$ on the fibres of configuration-mapping spaces.

math.AT

A Framework for Differential Calculus on Persistence Barcodes

We define notions of differentiability for maps from and to the space of persistence barcodes. Inspired by the theory of diffeological spaces, the proposed framework uses lifts to the space of ordered barcodes, from which derivatives can be computed. The two derived notions of differentiability (respectively from and to the space of barcodes) combine together naturally to produce a chain rule that enables the use of gradient descent for objective functions factoring through the space of barcodes. We illustrate the versatility of this framework by showing how it can be used to analyze the smoothness of various parametrized families of filtrations arising in topological data analysis.

math.AT

Configuration-mapping spaces and homology stability

For a given bundle $ξ\colon E \to M$ over a manifold, configuration-section spaces on $ξ$ parametrise finite subsets $z \subseteq M$ equipped with a section of $ξ$ defined on $M \smallsetminus z$, with prescribed "charge" in a neighbourhood of the points $z$. These spaces may be interpreted physically as spaces of fields that are permitted to be singular at finitely many points, with constrained behaviour near the singularities. As a special case, they include the Hurwitz spaces, which parametrise branched covering spaces of the $2$-disc with specified deck transformation group. We prove that configuration-section spaces are homologically stable (with integral coefficients) whenever the underlying manifold $M$ is connected and has non-empty boundary and the charge is "small" in a certain sense. This has a partial intersection with the work on Hurwitz spaces of Ellenberg, Venkatesh and Westerland.

math.AT

Topological Methods for Characterising Spatial Networks: A Case Study in Tumour Vasculature

Understanding how the spatial structure of blood vessel networks relates to their function in healthy and abnormal biological tissues could improve diagnosis and treatment for diseases such as cancer. New imaging techniques can generate multiple, high-resolution images of the same tissue region, and show how vessel networks evolve during disease onset and treatment. Such experimental advances have created an exciting opportunity for discovering new links between vessel structure and disease through the development of mathematical tools that can analyse these rich datasets. Here we explain how topological data analysis (TDA) can be used to study vessel network structures. TDA is a growing field in the mathematical and computational sciences, that consists of algorithmic methods for identifying global and multi-scale structures in high-dimensional data sets that may be noisy and incomplete. TDA has identified the effect of ageing on vessel networks in the brain and more recently proposed to study blood flow and stenosis. Here we present preliminary work which shows how TDA of spatial network structure can be used to characterise tumour vasculature.

q-bio.QM

Stratifying multiparameter persistent homology

A fundamental tool in topological data analysis is persistent homology, which allows extraction of information from complex datasets in a robust way. Persistent homology assigns a module over a principal ideal domain to a one-parameter family of spaces obtained from the data. In applications data often depend on several parameters, and in this case one is interested in studying the persistent homology of a multiparameter family of spaces associated to the data. While the theory of persistent homology for one-parameter families is well-understood, the situation for multiparameter families is more delicate. Following Carlsson and Zomorodian we recast the problem in the setting of multigraded algebra, and we propose multigraded Hilbert series, multigraded associated primes and local cohomology as invariants for studying multiparameter persistent homology. Multigraded associated primes provide a stratification of the region where a multigraded module does not vanish, while multigraded Hilbert series and local cohomology give a measure of the size of components of the module supported on different strata. These invariants generalize in a suitable sense the invariant for the one-parameter case.

math.AT

Random Čech Complexes on Manifolds with Boundary

Let $M$ be a compact, unit volume, Riemannian manifold with boundary. In this paper we study the homology of a random Čech-complex generated by a homogeneous Poisson process in $M$. Our main results are two asymptotic threshold formulas, an upper threshold above which the Čech complex recovers the $k$-th homology of $M$ with high probability, and a lower threshold below which it almost certainly does not. These thresholds are close together in the sense that they have the same leading term. Here $k$ is positive and strictly less than the dimension $d$ of the manifold. This extends work of Bobrowski and Weinberger in [BW17] and Bobrowski and Oliveira [BO19] who establish similar formulas when $M$ is a torus and, more generally, is closed and has no boundary. We note that the cases with and without boundary lead to different answers: The corresponding common leading terms for the upper and lower thresholds differ being $\log (n) $ when $M$ is closed and $(2-2/d)\log (n)$ when $M$ has boundary; here $n$ is the expected number of sample points. Our analysis identifies a special type of homological cycle, which we call a $Θ$-like-cycle, which occur close to the boundary and establish that the first order term of the lower threshold is $(2-2/d)\log (n)$.

math.PR

Inverting operations in operads

We construct a localization for operads with respect to one-ary operations based on the Dwyer-Kan hammock localization. For an operad O and a sub-monoid of one-ary operations W we associate an operad LO and a canonical map O to LO which takes elements in W to homotopy invertible operations. Furthermore, we give a functor from the category of O-algebras to the category of LO-algebras satisfying an appropriate universal property.

math.CT