Abstract
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in terms of the combinatorial notion of contiguity. We generalize the Simplicial Approximation Theorem to show that the contiguity complex approximates the homotopy type of the mapping space as we subdivide the domain. We describe algorithms for approximating the rate of growth of the components of the contiguity complex under subdivision of the domain; this procedure allows us to computationally distinguish spaces with isomorphic homology but different homotopy types.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.