scholarly journals Topological trajectory classification with filtrations of simplicial complexes and persistent homology

2015 ◽  
Vol 35 (1-3) ◽  
pp. 204-223 ◽  
Author(s):  
Florian T. Pokorny ◽  
Majd Hawasly ◽  
Subramanian Ramamoorthy
Author(s):  
S. V. Lejhter ◽  
S. N. Chukanov

An algorithm for determining the spectrum of eigenvalues of the Laplace matrix for simplicial complexes has been developed in the paper. The spectrum of eigenvalues of the Laplace matrix is used as features in the data structure for image analysis. Similarly to the method of persistent homology, the filtering of embedded simplicial complexes is formed, approximating the image of the object, but the topological features at each stage of filtration is the spectrum of eigenvalues of the Laplace matrix of simplicial complexes. The spectrum of eigenvalues of the Laplace matrix allows to determine the Betti numbers and Euler characteristics of the image. Based on the method of finding the spectrum of eigenvalues of the Laplace matrix, an algorithm is formed that allows you to obtain topological features of images of objects and quantitative estimates of the results of image comparison. Software has been developed that implements this algorithm on computer hardware. The method of determining the spectrum of eigenvalues of the Laplace matrix has the following advantages: the method does not require a bijective correspondence between the elements of the structures of objects; the method is invariant with respect to the Euclidean transformations of the forms of objects. Determining the spectrum of eigenvalues of the Laplace matrix for simplicial complexes allows you to expand the number of features for machine learning, which allows you to increase the diversity of information obtained by the methods of computational topology, while maintaining topological invariants. When comparing the shapes of objects, a modified Wasserstein distance can be constructed based on the eigenvalues of the Laplace matrix of the compared shapes. Using the definition of the spectrum of eigenvalues of the Laplace matrix to compare the shapes of objects can improve the accuracy of determining the distance between images.


2009 ◽  
Vol 19 (07) ◽  
pp. 2307-2319 ◽  
Author(s):  
KENNETH A. BROWN ◽  
KEVIN P. KNUDSON

We study the structure of point clouds obtained as time delay embeddings of human speech signals by approximating the data sets with certain simplicial complexes and analyzing their persistent homology. Results for several different sounds are presented in embedding dimensions 3 and 4. The first Betti number allows a coarse classification of sounds into three groups: vowels, nasals and noise.


Author(s):  
Dejan Govc ◽  
Ran Levi ◽  
Jason P. Smith

AbstractComplete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as “tournaplexes”, whose simplices are tournaments. In particular, given a digraph $${\mathcal {G}}$$ G , we associate with it a “flag tournaplex” which is a tournaplex containing the directed flag complex of $${\mathcal {G}}$$ G , but also the geometric realisation of cliques that are not directed. We define several types of filtrations on tournaplexes, and exploiting persistent homology, we observe that flag tournaplexes provide finer means of distinguishing graph dynamics than the directed flag complex. We then demonstrate the power of these ideas by applying them to graph data arising from the Blue Brain Project’s digital reconstruction of a rat’s neocortex.


Algorithms ◽  
2020 ◽  
Vol 13 (7) ◽  
pp. 172
Author(s):  
Kevin P. Knudson

We define the notion of an approximate triangulation for a manifold M embedded in Euclidean space. The basic idea is to build a nested family of simplicial complexes whose vertices lie in M and use persistent homology to find a complex in the family whose homology agrees with that of M. Our key examples are various Grassmann manifolds G k ( R n ) .


2021 ◽  
Vol 8 (10) ◽  
Author(s):  
Sean T. Vittadello ◽  
Michael P. H. Stumpf

In many scientific and technological contexts, we have only a poor understanding of the structure and details of appropriate mathematical models. We often, therefore, need to compare different models. With available data we can use formal statistical model selection to compare and contrast the ability of different mathematical models to describe such data. There is, however, a lack of rigorous methods to compare different models a priori . Here, we develop and illustrate two such approaches that allow us to compare model structures in a systematic way by representing models as simplicial complexes. Using well-developed concepts from simplicial algebraic topology, we define a distance between models based on their simplicial representations. Employing persistent homology with a flat filtration provides for alternative representations of the models as persistence intervals, which represent model structure, from which the model distances are also obtained. We then expand on this measure of model distance to study the concept of model equivalence to determine the conceptual similarity of models. We apply our methodology for model comparison to demonstrate an equivalence between a positional-information model and a Turing-pattern model from developmental biology, constituting a novel observation for two classes of models that were previously regarded as unrelated.


2019 ◽  
Author(s):  
Michelle Feng ◽  
Mason A. Porter

A crucial step in the analysis of persistent homology is the transformation of data into an appropriate topological object (in our case, a simplicial complex). Modern packages for persistent homology often construct Vietoris–Rips or other distance-based simplicial complexes on point clouds because they are relatively easy to compute. We investigate alternative methods of constructing these complexes and the effects of making associated choices during simplicial-complex construction on the output of persistent-homology algorithms. We present two new methods for constructing simplicial complexes from two-dimensional geospatial data (such as maps). We apply these methods to a California precinct-level voting data set, demonstrating that our new constructions can capture geometric characteristics that are missed by distance-based constructions. Our new constructions can thus yield more interpretable persistence modules and barcodes for geospatial data. In particular, they are able to distinguish short-persistence features that occur only for a narrow range of distance scales (e.g., voting behaviors in densely populated cities) from short-persistence noise by incorporating information about other spatial relationships between precincts.


Author(s):  
Clément Maria ◽  
Jean-Daniel Boissonnat ◽  
Marc Glisse ◽  
Mariette Yvinec

Author(s):  
Ran Levi ◽  
Dejan Govc ◽  
Jason Smith

Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as ``tournaplexes'', whose simplices are tournaments. In particular, given a digraph G, we associate with it a ``flag tournaplex'' which is a tournaplex containing the directed flag complex of G, but also the geometric realisation of cliques that are not directed. We define several types of filtrations on tournaplexes, and exploiting persistent homology, we observe that flag tournaplexes provide finer means of distinguishing graph dynamics than the directed flag complex. We then demonstrate the power of these ideas by applying them to graph data arising from the Blue Brain Project's digital reconstruction of a rat's neocortex.


10.37236/1245 ◽  
1996 ◽  
Vol 3 (1) ◽  
Author(s):  
Art M. Duval

Björner and Wachs generalized the definition of shellability by dropping the assumption of purity; they also introduced the $h$-triangle, a doubly-indexed generalization of the $h$-vector which is combinatorially significant for nonpure shellable complexes. Stanley subsequently defined a nonpure simplicial complex to be sequentially Cohen-Macaulay if it satisfies algebraic conditions that generalize the Cohen-Macaulay conditions for pure complexes, so that a nonpure shellable complex is sequentially Cohen-Macaulay. We show that algebraic shifting preserves the $h$-triangle of a simplicial complex $K$ if and only if $K$ is sequentially Cohen-Macaulay. This generalizes a result of Kalai's for the pure case. Immediate consequences include that nonpure shellable complexes and sequentially Cohen-Macaulay complexes have the same set of possible $h$-triangles.


Sign in / Sign up

Export Citation Format

Share Document