The Persistent Homology of Cyclic Graphs
From MaRDI portal
Publication:5057657
Cites work
- 1-Dimensional intrinsic persistence of geodesic spaces
- A centrally symmetric version of the cyclic polytope
- A complete characterization of the one-dimensional intrinsic Čech persistence diagrams for metric graphs
- Algorithmic complexity of finding cross-cycles in flag complexes
- An efficient algorithm for determining the convex hull of a finite planar set
- Approximating persistent homology in Euclidean space through collapses
- Barcodes of towers and a streaming algorithm for persistent homology
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Clear and compress: computing persistent homology in chunks
- Clique complexes and graph powers
- Combinatorial algebraic topology
- Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
- Computational topology. An introduction
- Computing persistent homology
- Computing persistent homology of flag complexes via strong collapses
- Computing topological persistence for simplicial maps (extended abstract)
- Convex hulls of finite sets of points in two and three dimensions
- Curvature Measures
- Elementary differential geometry
- Generalized persistence diagrams
- Geometric and topological inference
- Geometry-driven collapses for converting a Čech complex into a triangulation of a nicely triangulable shape
- Hamilton-Jacobi equations and distance functions on Riemannian manifolds
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 3673370 (Why is no real title available?)
- scientific article; zbMATH DE number 1344784 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- Hölder and locally Hölder continuous functions, and open sets of class \(C^k, C^{k,\lambda}\)
- Introduction to algorithms.
- Linear-time recognition of Helly circular-arc models and graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Metric thickenings, Borsuk-Ulam theorems, and orbitopes
- Multidimensional scaling on metric measure spaces
- Nerve complexes of circular arcs
- On homotopy types of Euclidean Rips complexes
- On persistent homotopy, knotted complexes and the Alexander module
- On the local behavior of spaces of natural images
- On Vietoris-Rips complexes of ellipses
- Persistence stability for geometric complexes
- Quantitative simplification of filtered simplicial complexes
- Random cyclic dynamical systems
- Regularity of optimal transport and cut locus: from nonsmooth analysis to geometry to smooth analysis
- Regularity properties of the distance functions to conjugate and cut loci for viscosity solutions of Hamilton-Jacobi equations and applications in Riemannian geometry
- Rips complexes as nerves and a functorial Dowker-nerve diagram
- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch collapse
- Sliding windows and persistence: an application of topological methods to signal analysis
- The persistent homotopy type distance
- The reach, metric distortion, geodesic convexity and the variation of tangent spaces
- The theory of multidimensional persistence
- The Vietoris-Rips complexes of a circle
- Topological persistence and simplification
- Topological times series analysis
- Topology and data
- Towards persistence-based reconstruction in euclidean spaces
- Tubular neighborhoods in Euclidean spaces
- Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
- Vietoris-Rips complexes of metric spaces near a closed Riemannian manifold
- Vietoris-Rips complexes of planar point sets
Cited in
(6)- Maximally persistent cycles in random geometric complexes
- Čech-Delaunay gradient flow and homology inference for self-maps
- \(p\)-cyclic persistent homology and Hofer distance
- On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting
- Persistent homology for hypergraphs and computational tools — A survey for users
- The persistent homology of cyclic graphs
This page was built for publication: The Persistent Homology of Cyclic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057657)
