Related papers: Vietoris-Rips Complexes of Regular Polygons

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

The degree-Rips bifiltration is the most computable of the parameter-free, density-sensitive bifiltrations in topological data analysis. It is known that this construction is stable to small perturbations of the input data, but its…

For a metric space $(X, d)$ and a scale parameter $r \geq 0$, the Vietoris-Rips complex $\mathcal{VR}(X;r)$ is a simplicial complex on vertex set $X$, where a finite set $\sigma \subseteq X$ is a simplex if and only if diameter of $\sigma$…

We define bigraded persistent homology modules and bigraded barcodes of a finite pseudo-metric space X using the ordinary and double homology of the moment-angle complex associated with the Vietoris-Rips filtration of X. We prove a…

It was conjectured, twenty years ago, the following result that would generalize the so-called rank rigidity theorem for homogeneous Euclidean submanifolds: let M^n, n>=2, be a full and irreducible homogeneous submanifold of the sphere…

We bring in the techniques of independence complexes and the notion of total dominating sets of a graph to bear on the question of the connectivity of the Vietoris-Rips complexes $VR(Q_n; r)$ of an $n$-hypercube graph. We obtain a lower…

We develop persistent homology in the setting of filtrations of (Cech) closure spaces. Examples of filtrations of closure spaces include metric spaces, weighted graphs, weighted directed graphs, and filtrations of topological spaces. We use…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

We present a new, inductive construction of the Vietoris-Rips complex, in which we take advantage of a small amount of unexploited combinatorial structure in the $k$-skeleton of the complex in order to avoid unnecessary comparisons when…

The so called \v{C}ech and Vietoris-Rips simplicial filtrations are designed to capture information about the topological structure of metric datasets. These filtrations are two of the workhorses in the field of topological data analysis.…

We introduce weighted versions of the classical \v{C}ech and Vietoris-Rips complexes. We show that a version of the Vietoris-Rips Lemma holds for these weighted complexes and that they enjoy appropriate stability properties. We also give…

There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…

Persistent homology is a popular computational tool for analyzing the topology of point clouds, such as the presence of loops or voids. However, many real-world datasets with low intrinsic dimensionality reside in an ambient space of much…

We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…

We give a new, short proof of a result of Virk, that the Vietoris-Rips complex of the group $\mathbb{Z}^n$ with the standard word metric is contractible at large enough scales. This is inspired by a key observation in Virk's proof, but we…

In this paper we define, implement, and investigate a simplicial complex construction for computing persistent homology of Euclidean point cloud data, which we call the Delaunay-Rips complex (DR). Assigning the Vietoris-Rips weights to…

We prove a Kunneth theorem for the Vietoris-Rips homology and cohomology of a semi-uniform space. We then interpret this result for graphs, where we show that the Kunneth theorem holds for graphs with respect to the strong graph product. We…

Intersection homology is a topological invariant which detects finer information in a space than ordinary homology. Using ideas from classical simple homotopy theory, we construct local combinatorial transformations on simplicial complexes…

Given a finite set in a metric space, the topological analysis generalizes hierarchical clustering using a 1-parameter family of homology groups to quantify connectivity in all dimensions. The connectivity is compactly described by the…

For a closed Riemannian manifold $\mathcal{M}$ and a metric space $S$ with a small Gromov$\unicode{x2013}$Hausdorff distance to it, Latschev's theorem guarantees the existence of a sufficiently small scale $\beta>0$ at which the…