The Persistent Homology of Cyclic Graphs
From MaRDI portal
Publication:5057657
DOI10.1142/S0218195922500042MaRDI QIDQ5057657FDOQ5057657
Authors: Henry Adams, Sophia Coldren, Sean Willmot 
Publication date: 19 December 2022
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.03374
Cites Work
- Barcodes of towers and a streaming algorithm for persistent homology
- SimBa: an efficient tool for approximating Rips-filtration persistence via simplicial batch collapse
- Title not available (Why is that?)
- The theory of multidimensional persistence
- Curvature Measures
- Towards persistence-based reconstruction in euclidean spaces
- Topology and data
- Computational topology. An introduction
- Title not available (Why is that?)
- Introduction to algorithms.
- Ripser: efficient computation of Vietoris-Rips persistence barcodes
- Computing persistent homology
- Topological persistence and simplification
- Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vietoris-Rips complexes of metric spaces near a closed Riemannian manifold
- On the local behavior of spaces of natural images
- An efficient algorithm for determining the convex hull of a finite planar set
- Hamilton-Jacobi equations and distance functions on Riemannian manifolds
- Sliding windows and persistence: an application of topological methods to signal analysis
- Persistence stability for geometric complexes
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Combinatorial algebraic topology
- Linear-time recognition of Helly circular-arc models and graphs
- Generalized persistence diagrams
- The Vietoris-Rips complexes of a circle
- Nerve complexes of circular arcs
- Random cyclic dynamical systems
- Clique complexes and graph powers
- Geometry-driven collapses for converting a Čech complex into a triangulation of a nicely triangulable shape
- Clear and compress: computing persistent homology in chunks
- Computing topological persistence for simplicial maps (extended abstract)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Elementary differential geometry
- A centrally symmetric version of the cyclic polytope
- Tubular neighborhoods in Euclidean spaces
- Convex hulls of finite sets of points in two and three dimensions
- Complexity of Delaunay triangulation for points on lower-dimensional polyhedra
- Hölder and locally Hölder continuous functions, and open sets of class \(C^k, C^{k,\lambda}\)
- 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
- Vietoris-Rips complexes of planar point sets
- Approximating persistent homology in Euclidean space through collapses
- On persistent homotopy, knotted complexes and the Alexander module
- 1-Dimensional intrinsic persistence of geodesic spaces
- Geometric and topological inference
- Metric thickenings, Borsuk-Ulam theorems, and orbitopes
- Multidimensional scaling on metric measure spaces
- A complete characterization of the one-dimensional intrinsic Čech persistence diagrams for metric graphs
- On homotopy types of Euclidean Rips complexes
- The reach, metric distortion, geodesic convexity and the variation of tangent spaces
- The persistent homotopy type distance
- Rips complexes as nerves and a functorial Dowker-nerve diagram
- On Vietoris-Rips complexes of ellipses
- Topological times series analysis
- Computing persistent homology of flag complexes via strong collapses
- Quantitative simplification of filtered simplicial complexes
- Algorithmic complexity of finding cross-cycles in flag complexes
Cited In (6)
- The persistent homology of cyclic graphs
- Persistent homology for hypergraphs and computational tools — A survey for users
- Čech-Delaunay gradient flow and homology inference for self-maps
- On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting
- \(p\)-cyclic persistent homology and Hofer distance
- Maximally persistent cycles in random geometric complexes
Uses Software
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)
