Computational Algebraic Topology Research Articles

Multivariate central limit theorems for random clique complexes

AbstractMotivated by open problems in applied and computational algebraic topology, we establish multivariate normal approximation theorems for three random vectors which arise organically in the study of random clique complexes. These are: the vector of critical simplex counts attained by a lexicographical Morse matching, the vector of simplex counts in the link of a fixed simplex, and the vector of total simplex counts. The first of these random vectors forms a cornerstone of modern homology algorithms, while the second one provides a natural generalisation for the notion of vertex degree, and the third one may be viewed from the perspective of U-statistics. To obtain distributional approximations for these random vectors, we extend the notion of dissociated sums to a multivariate setting and prove a new central limit theorem for such sums using Stein’s method.

Algebra, Geometry and Topology of ERK Kinetics

The MEK/ERK signalling pathway is involved in cell division, cell specialisation, survival and cell death (Shaul and Seger in Biochim Biophys Acta (BBA)-Mol Cell Res 1773(8):1213–1226, 2007). Here we study a polynomial dynamical system describing the dynamics of MEK/ERK proposed by Yeung et al. (Curr Biol 2019, https://doi.org/10.1016/j.cub.2019.12.052) with their experimental setup, data and known biological information. The experimental dataset is a time-course of ERK measurements in different phosphorylation states following activation of either wild-type MEK or MEK mutations associated with cancer or developmental defects. We demonstrate how methods from computational algebraic geometry, differential algebra, Bayesian statistics and computational algebraic topology can inform the model reduction, identification and parameter inference of MEK variants, respectively. Throughout, we show how this algebraic viewpoint offers a rigorous and systematic analysis of such models.

Reconstructing linearly embedded graphs: A first step to stratified space learning

<p style='text-indent:20px;'>In this paper, we consider the simplest class of stratified spaces – linearly embedded graphs. We present an algorithm that learns the abstract structure of an embedded graph and models the specific embedding from a point cloud sampled from it. We use tools and inspiration from computational geometry, algebraic topology, and topological data analysis and prove the correctness of the identified abstract structure under assumptions on the embedding. The algorithm is implemented in the Julia package Skyler, which we used for the numerical simulations in this paper.</p>

Topological data analysis of task-based fMRI data from experiments on schizophrenia

We use methods from computational algebraic topology to study functional brain networks in which nodes represent brain regions and weighted edges encode the similarity of functional magnetic resonance imaging (fMRI) time series from each region. With these tools, which allow one to characterize topological invariants such as loops in high-dimensional data, we are able to gain understanding of low-dimensional structures in networks in a way that complements traditional approaches that are based on pairwise interactions. In the present paper, we use persistent homology to analyze networks that we construct from task-based fMRI data from schizophrenia patients, healthy controls, and healthy siblings of schizophrenia patients. We thereby explore the persistence of topological structures such as loops at different scales in these networks. We use persistence landscapes and persistence images to represent the output of our persistent-homology calculations, and we study the persistence landscapes and persistence images using k-means clustering and community detection. Based on our analysis of persistence landscapes, we find that the members of the sibling cohort have topological features (specifically, their one-dimensional loops) that are distinct from the other two cohorts. From the persistence images, we are able to distinguish all three subject groups and to determine the brain regions in the loops (with four or more edges) that allow us to make these distinctions.

Topological portraits of multiscale coordination dynamics

Living systems exhibit complex yet organized behavior on multiple spatiotemporal scales. To investigate the nature of multiscale coordination in living systems, one needs a meaningful and systematic way to quantify the complex dynamics, a challenge in both theoretical and empirical realms. The present work shows how integrating approaches from computational algebraic topology and dynamical systems may help us meet this challenge. In particular, we focus on the application of multiscale topological analysis to coordinated rhythmic processes. First, theoretical arguments are introduced as to why certain topological features and their scale-dependency are highly relevant to understanding complex collective dynamics. Second, we propose a method to capture such dynamically relevant topological information using persistent homology, which allows us to effectively construct a multiscale topological portrait of rhythmic coordination. Finally, the method is put to test in detecting transitions in real data from an experiment of rhythmic coordination in ensembles of interacting humans. The recurrence plots of topological portraits highlight collective transitions in coordination patterns that were elusive to more traditional methods. This sensitivity to collective transitions would be lost if the behavioral dynamics of individuals were treated as separate degrees of freedom instead of constituents of the topology that they collectively forge. Such multiscale topological portraits highlight collective aspects of coordination patterns that are irreducible to properties of individual parts. The present work demonstrates how the analysis of multiscale coordination dynamics can benefit from topological methods, thereby paving the way for further systematic quantification of complex, high-dimensional dynamics in living systems.

Computational Geometric and Algebraic Topology

A triangulation of a $3$-manifold can be shown to be homeomorphic to the $3$-sphere by describing a discrete Morse function on it with only two critical faces, that is, a sequence of elementary collapses from the triangulation with one tetrahedron removed down to a single vertex. Unfortunately, deciding whether such a sequence exist is believed to be very difficult in general. In this article we present a method, based on uniform spanning trees, to estimate how difficult it is to collapse a given $3$-sphere triangulation after removing a tetrahedron. In addition we show that out of all $3$-sphere triangulations with eight vertices or less, exactly $22$ admit a non-collapsing sequence onto a contractible non-collapsible $2$-complex. As a side product we classify all minimal triangulations of the dunce hat, and all contractible non-collapsible $2$-complexes with at most $18$ triangles. This is complemented by large scale experiments on the collapsing difficulty of $9$- and $10$-vertex spheres. Finally, we propose an easy-to-compute characterisation of $3$-sphere triangulations which experimentally exhibit a low proportion of collapsing sequences, leading to a heuristic to produce $3$-sphere triangulations with difficult combinatorial properties.

The Topological 'Shape' of Brexit

Persistent homology is a method from computational algebraic topology that can be used to study the ``shape'' of data. We illustrate two filtrations --- the weight rank clique filtration and the Vietoris--Rips (VR) filtration --- that are commonly used in persistent homology, and we apply these filtrations to a pair of data sets that are both related to the 2016 European Union ``Brexit'' referendum in the United Kingdom. These examples consider a topical situation and give useful illustrations of the strengths and weaknesses of these methods.

Computational Topology Based Quantification Of Hepatocytes Nuclei In Lipopolysaccharide-Induced Liver Injury In Mice

Introduction/ Background Automated high resolution scanning microscopes digitize large sets of histological samples and access the an anatomical features of cells and tissues from the mm range down to a resolution of .25mpp microns per pixel). The high quality of the scans allows for the collection of the quantitative morphotopological features of cells and tissues from different samples, which can be coupled to functional information through, e.g., concomitant immunostaining. The basis for robust and accurate quantification of structural and functional features is the segmentation of regions of interest (ROIs) which define different elements within the scans. Due to acquisition artifacts and the diversity and variance of possible tar- gets, the characterization and segmentation of ROIs in histological samples is difficult and challenging. In recent years, computational algebraic topology, a field of mathematics, has established a robust and versatile way to obtain qualitative information from data. The most fundamental qualitative description of an object is given by the study of its topology, how the object is connected, how many holes it has, and of what type. That allows characterizing data sets according to their structure, increasing our understanding of their properties. Aims We propose a method for the robust segmentation of hepatocyte nuclei based on the principles of persistent homology, a tool of algebraic topology. We show the application of our technique in histopathological, whole slide images obtained from liver sections of lipopolysaccharide (LPS)-treated mice. The robustness is achieved by the introduction of persistent homology to characterize the hepatocyte nuclei. Its stability proves the usefulness of persistent homology; variations in the properties of the ROIs induce small changes in the resulting characterization. By means of this representation for the hepatocyte nuclei, the resulting segmentation is less sensitive to acquisition artifacts and natural variations of the images across batches of slides. Methods The sample space of this study consists of 856 cropped images of 616x616 pixels each, obtained from three specimens. Each image was fragmented into connected components at different scales. Persistent homology is used to study the inclusion relations between connected components. The outcome of such process is a persistence diagram that provides a low-dimensional projection of the image structure. From that representation, it is possible to use conventional statistical methods for segmenting hepatocyte nuclei. After the segmentation, we assess the performance in comparison to a gold standard segmentation validated by experts. Results The computational topology approach proposed successfully detected hepatocyte cells under several natural variations. We evaluated on a per-pixel basis how the segmentation performs on: i) all nuclei in the images, ii) big round nuclei considered belonging to hepatocytes cells (accuracy 87.2%, recall 80.3%), and iii) nuclei regarded to non-parenchymal cells.

Computational topology of equipartitions by hyperplanes

We compute a primary cohomological obstruction to the existence of an equipartition for $j$ mass distributions in $\mathbb{R}^d$ by two hyperplanes in the case $2d-3j = 1$. The central new result is that such an equipartition always exists if $d=6\cdot 2^k +2$ and $j=4\cdot 2^k+1$ which for $k=0$ reduces to the main result of the paper P. Mani-Levitska et al., Topology and combinatorics of partitions of masses by hyperplanes, Adv. Math. 207 (2006), 266-296. The theorem follows from a Borsuk-Ulam type result claiming the non-existence of a $\mathbb{D}_8$-equivariant map $f \colon S^{d}\times S^d\rightarrow S(W^{\oplus j})$ for an associated real $\mathbb{D}_8$-module $W$. This is an example of a genuine combinatorial geometric result which involves $\mathbb{Z}/4$-torsion in an essential way and cannot be obtained by the application of either Stiefel-Whitney classes or cohomological index theories with $\mathbb{Z}/2$ or $\mathbb{Z}$ coefficients. The method opens a possibility of developing an ``effective primary obstruction theory'' based on $G$-manifold complexes, with applications in geometric combinatorics, discrete and computational geometry, and computational algebraic topology.

A Certified Reduction Strategy for Homological Image Processing

The analysis of digital images using homological procedures is an outstanding topic in the area of Computational Algebraic Topology. In this article, we describe a certified reduction strategy to deal with digital images, but one preserving their homological properties. We stress both the advantages of our approach (mainly, the formalization of the mathematics allowing us to verify the correctness of algorithms) and some limitations (related to the performance of the running systems inside proof assistants). The drawbacks are overcome using techniques that provide an integration of computation and deduction. Our driving application is a problem in bioinformatics, where the accuracy and reliability of computations are specially requested.

On the Role of Formalization in Computational Mathematics

In this paper, we will report on the developments carried out in Isabelle/HOL, ACL2 and Coq/SSReflect on Computational Algebraic Topology, in the frame of the ForMath European project. The aim is to illustrate, trough concrete examples, the role of formalization technologies in Computational Mathematics in general.

Polynomial-Time Homology for Simplicial Eilenberg–MacLane Spaces

In an earlier paper of Čadek, Vokřínek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological spaces, under suitable restriction on the spaces. We aim at showing that, if the dimensions of the considered spaces are bounded by a constant, then the computations can be done in polynomial time. In this paper we make a significant technical step towards this goal: we show that the Eilenberg–MacLane space $K(\mathbb{Z},1)$ , represented as a simplicial group, can be equipped with polynomial-time homology (this is a polynomial-time version of effective homology considered in previous works of the third author and co-workers). To this end, we construct a suitable discrete vector field, in the sense of Forman’s discrete Morse theory, on $K(\mathbb{Z},1)$ . The construction is purely combinatorial and it can be understood as a certain procedure for reducing finite sequences of integers, without any reference to topology. The Eilenberg–MacLane spaces are the basic building blocks in a Postnikov system, which is a “layered” representation of a topological space suitable for homotopy-theoretic computations. Employing the result of this paper together with other results on polynomial-time homology, in another paper we obtain, for every fixed k, a polynomial-time algorithm for computing the kth homotopy group π k (X) of a given simply connected space X, as well as the first k stages of a Postnikov system for X, and also a polynomial-time version of the algorithm of Čadek et al. mentioned above.

Visualization of Bottleneck Distances for Persistence Diagram

Persistence homology (a type of methodology in computational algebraic topology) can be used to capture the topological characteristics of functional data. To visualize the characteristics, a persistence diagram is adopted by plotting baseline and the pairs that consist of local minimum and local maximum. We use the bottleneck distance to measure the topological distance between two different functions; in addition, this distance can be applied to multidimensional scaling(MDS) that visualizes the imaginary position based on the distance between functions. In this study, we use handwriting data (which has functional forms) to get persistence diagram and check differences between the observations by using bottleneck distance and the MDS.

P systems and computational algebraic topology

Membrane Computing is a paradigm inspired from biological cellular communication. Membrane computing devices are called P systems. In this paper we calculate some algebraic-topological information of 2D and 3D images in a general and parallel manner using P systems. First, we present a new way to obtain the homology groups of 2D digital images in time logarithmic with respect to the input data involving an improvement with respect to the algorithms development by S. Peltier et al. Second, we obtain an edge-segmentation of 2D and 3D digital images in constant time with respect to the input data.

Learning Theory and Approximation

Learning Theory and Approximation

Computational Algebraic Topology

Computational Algebraic Topology

Barcodes: The persistent topology of data

This article surveys recent work of Carlsson and collaborators on applications of computational algebraic topology to problems of feature detection and shape recognition in high-dimensional data. The primary mathematical tool considered is a homology theory for point-cloud data sets — persistent homology — and a novel representation of this algebraic characterization — barcodes. We sketch an application of these techniques to the classification of natural images. 1. The shape of data When a topologist is asked, “How do you visualize a four-dimensional object?” the appropriate response is a Socratic rejoinder: “How do you visualize a threedimensional object?” We do not see in three spatial dimensions directly, but rather via sequences of planar projections integrated in a manner that is sensed if not comprehended. We spend a significant portion of our first year of life learning how to infer three-dimensional spatial data from paired planar projections. Years of practice have tuned a remarkable ability to extract global structure from representations in a strictly lower dimension. The inference of global structure occurs on much finer scales as well, with regards to converting discrete data into continuous images. Dot-matrix printers, scrolling LED tickers, televisions, and computer displays all communicate images via arrays of discrete points which are integrated into coherent, global objects. This also is a skill we have practiced from childhood. No adult does a dot-to-dot puzzle with anything approaching anticipation. 1.1. Topological data analysis. Problems of data analysis share many features with these two fundamental integration tasks: (1) how does one infer high dimensional structure from low dimensional representations; and (2) how does one assemble discrete points into global structure. The principal themes of this survey of the work of Carlsson, de Silva, Edelsbrunner, Harer, Zomorodian, and others are the following: (1) It is beneficial to replace a set of data points with a family of simplicial complexes, indexed by a proximity parameter. This converts the data set into global topological objects. (2) It is beneficial to view these topological complexes through the lens of algebraic topology — specifically, via a novel theory of persistent homology adapted to parameterized families. (3) It is beneficial to encode the persistent homology of a data set in the form of a parameterized version of a Betti number: a barcode. The author gratefully acknowledges the support of DARPA # HR0011-07-1-0002. The work reviewed in this article is funded by the DARPA program TDA: Topological Data Analysis.

Algebraic Topology-Based Image Deformation: A Unified Model

In this paper, a new method for image deformation is presented. It is based upon decomposition of the deformation problem into basic physical laws. Unlike other methods that solve a differential or an energetic formulation of the physical laws involved, we encode the basic laws using computational algebraic topology. Conservative laws are translated into exact global values and constitutive laws are judiciously approximated. In order to illustrate the effectiveness of our model, we deal with both small- and large-scale deformation, utilizing elasticity theory and the viscous fluid model, respectively. The proposed approach is validated through a series of tests on optical flow estimation and image registration.

Evolution of pattern complexity in the Cahn–Hilliard theory of phase separation

Phase separation processes in compound materials can produce intriguing and complicated patterns. Yet, characterizing the geometry of these patterns quantitatively can be quite challenging. In this paper we propose the use of computational algebraic topology to obtain such a characterization. Our method is illustrated for the complex microstructures observed during spinodal decomposition and early coarsening in both the deterministic Cahn–Hilliard theory, as well as in the stochastic Cahn–Hilliard–Cook model. While both models produce microstructures that are qualitatively similar to the ones observed experimentally, our topological characterization points to significant differences. One particular aspect of our method is its ability to quantify boundary effects in finite size systems.