Reconstructing functions from random samples

DOI10.3934/JCD.2014.1.233MaRDI QIDQ2513916zbMATH OpenOpenAlexFDO

Authors Vidit Nanda, Steve Ferry, K. Mischaikow

Publication date 29 January 2015

Published in Journal of Computational Dynamics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.3390

zbMATH Keywords

homotopyhomologytopological inferencenonlinear maps

Mathematics Subject Classification ID

Simplicial sets and complexes in algebraic topology (55U10) Abstract complexes in algebraic topology (55U05) Chain complexes in algebraic topology (55U15)

Abstract: From a sufficiently large point sample lying on a compact Riemannian submanifold of Euclidean space, one can construct a simplicial complex which is homotopy-equivalent to that manifold with high confidence. We describe a corresponding result for a Lipschitz-continuous function between two such manifolds. That is, we outline the construction of a simplicial map which recovers the induced maps on homotopy and homology groups with high confidence using only finite sampled data from the domain and range, as well as knowledge of the image of every point sampled from the domain. We provide explicit bounds on the size of the point samples required for such reconstruction in terms of intrinsic properties of the domain, the co-domain and the function. This reconstruction is robust to certain types of bounded sampling and evaluation noise.

Recommendations

• Implicit manifold reconstruction
• Implicit manifold reconstruction
• Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
• Manifold reconstruction from point samples
• The topology of probability distributions on manifolds

Cites work

• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• scientific article; zbMATH DE number 1961543 (Why is no real title available?)
• scientific article; zbMATH DE number 3296014 (Why is no real title available?)
• A Vietoris Mapping Theorem for Homotopy
• Algorithms - ESA 2003
• Combinatorial algebraic topology
• Computational homology
• Computational topology. An introduction
• Discrete Morse theoretic algorithms for computing homology of complexes and maps
• Finding the homology of submanifolds with high confidence from random samples
• Nerves, fibers and homotopy groups
• On the imbedding of systems of compacta in simplicial complexes
• Three examples of applied and computational homology
• Topology and data

Cited in

(12)

• Implicit manifold reconstruction
• Implicit manifold reconstruction
• Reconstruction of Entire Functions From Irregularly Spaced Sample Points
• A unified view on the functorial nerve theorem and its variations
• Finding the homology of submanifolds with high confidence from random samples
• Sampling \(C^1\)-submanifolds of \(\mathbb{H}^n\)
• Čech-Delaunay gradient flow and homology inference for self-maps
• Local reconstruction of a function from a non-uniform sampled data
• Conley index approach to sampled dynamics
• Spacetimes as topological spaces, and the need to take methods of general topology more seriously
• Function recovery on manifolds using scattered data
• Recovering a function from a finite number of moments

Describes a project that uses

Uses Software

• Homology

This page was built for publication: Reconstructing functions from random samples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513916)