4 Search Results for "Adams, Henry"


Document
Strange Random Topology of the Circle

Authors: Uzu Lim

Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)


Abstract
A paradigm in topological data analysis asserts that persistent homology should be computed to recover the homology of a data manifold. But could there be more to persistent homology? In this paper I bound probabilities that a random m Čech complex built on a circle attains high-dimensional topology. This builds on the known result that any nerve complex of circular arcs has the homotopy type of a bouquet of spheres. We observe a phase transition going from one 1-sphere, bouquet of 2-spheres, one 3-sphere, bouquet of 4-spheres, and so on. Furthermore, the even-dimensional Betti numbers become arbitrarily large over shrinking intervals. Our main tool is an exact computation of the expected Euler characteristic, combined with constraints on homotopy types. The systematic behaviour we observe cannot be regarded as a "topological noise", and calls for deeper investigations from the TDA community.

Cite as

Uzu Lim. Strange Random Topology of the Circle. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 70:1-70:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)


Copy BibTex To Clipboard

@InProceedings{lim:LIPIcs.SoCG.2024.70,
  author =	{Lim, Uzu},
  title =	{{Strange Random Topology of the Circle}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{70:1--70:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.70},
  URN =		{urn:nbn:de:0030-drops-200150},
  doi =		{10.4230/LIPIcs.SoCG.2024.70},
  annote =	{Keywords: Topological data analysis, persistent homology, stochastic topology}
}
Document
Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data

Authors: Sushovan Majhi

Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)


Abstract
For a closed Riemannian manifold ℳ and a metric space S with a small Gromov-Hausdorff distance to it, Latschev’s theorem guarantees the existence of a sufficiently small scale β > 0 at which the Vietoris-Rips complex of S is homotopy equivalent to ℳ. Despite being regarded as a stepping stone to the topological reconstruction of Riemannian manifolds from a noisy data, the result is only a qualitative guarantee. Until now, it had been elusive how to quantitatively choose such a proximity scale β in order to provide sampling conditions for S to be homotopy equivalent to ℳ. In this paper, we prove a stronger and pragmatic version of Latschev’s theorem, facilitating a simple description of β using the sectional curvatures and convexity radius of ℳ as the sampling parameters. Our study also delves into the topological recovery of a closed Euclidean submanifold from the Vietoris-Rips complexes of a Hausdorff close Euclidean subset. As already known for Čech complexes, we show that Vietoris-Rips complexes also provide topologically faithful reconstruction guarantees for submanifolds.

Cite as

Sushovan Majhi. Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 73:1-73:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)


Copy BibTex To Clipboard

@InProceedings{majhi:LIPIcs.SoCG.2024.73,
  author =	{Majhi, Sushovan},
  title =	{{Demystifying Latschev’s Theorem: Manifold Reconstruction from Noisy Data}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{73:1--73:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.73},
  URN =		{urn:nbn:de:0030-drops-200188},
  doi =		{10.4230/LIPIcs.SoCG.2024.73},
  annote =	{Keywords: Vietoris-Rips complex, submanifold reconstruction, manifold reconstruction, Latschev’s theorem, homotopy Equivalence}
}
Document
Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex

Authors: Jisu Kim, Jaehyeok Shin, Frédéric Chazal, Alessandro Rinaldo, and Larry Wasserman

Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)


Abstract
We derive conditions under which the reconstruction of a target space is topologically correct via the Čech complex or the Vietoris-Rips complex obtained from possibly noisy point cloud data. We provide two novel theoretical results. First, we describe sufficient conditions under which any non-empty intersection of finitely many Euclidean balls intersected with a positive reach set is contractible, so that the Nerve theorem applies for the restricted Čech complex. Second, we demonstrate the homotopy equivalence of a positive μ-reach set and its offsets. Applying these results to the restricted Čech complex and using the interleaving relations with the Čech complex (or the Vietoris-Rips complex), we formulate conditions guaranteeing that the target space is homotopy equivalent to the Čech complex (or the Vietoris-Rips complex), in terms of the μ-reach. Our results sharpen existing results.

Cite as

Jisu Kim, Jaehyeok Shin, Frédéric Chazal, Alessandro Rinaldo, and Larry Wasserman. Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 54:1-54:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)


Copy BibTex To Clipboard

@InProceedings{kim_et_al:LIPIcs.SoCG.2020.54,
  author =	{Kim, Jisu and Shin, Jaehyeok and Chazal, Fr\'{e}d\'{e}ric and Rinaldo, Alessandro and Wasserman, Larry},
  title =	{{Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex}},
  booktitle =	{36th International Symposium on Computational Geometry (SoCG 2020)},
  pages =	{54:1--54:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-143-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{164},
  editor =	{Cabello, Sergio and Chen, Danny Z.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.54},
  URN =		{urn:nbn:de:0030-drops-122129},
  doi =		{10.4230/LIPIcs.SoCG.2020.54},
  annote =	{Keywords: Computational topology, Homotopy reconstruction, Homotopy Equivalence, Vietoris-Rips complex, \v{C}ech complex, Reach, \mu-reach, Nerve Theorem, Offset, Double offset, Consistency}
}
Document
Vietoris-Rips and Cech Complexes of Metric Gluings

Authors: Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, and Lori Ziegelmeier

Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)


Abstract
We study Vietoris-Rips and Cech complexes of metric wedge sums and metric gluings. We show that the Vietoris-Rips (resp. Cech) complex of a wedge sum, equipped with a natural metric, is homotopy equivalent to the wedge sum of the Vietoris-Rips (resp. Cech) complexes. We also provide generalizations for certain metric gluings, i.e. when two metric spaces are glued together along a common isometric subset. As our main example, we deduce the homotopy type of the Vietoris-Rips complex of two metric graphs glued together along a sufficiently short path. As a result, we can describe the persistent homology, in all homological dimensions, of the Vietoris-Rips complexes of a wide class of metric graphs.

Cite as

Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, and Lori Ziegelmeier. Vietoris-Rips and Cech Complexes of Metric Gluings. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@InProceedings{adamaszek_et_al:LIPIcs.SoCG.2018.3,
  author =	{Adamaszek, Michal and Adams, Henry and Gasparovic, Ellen and Gommel, Maria and Purvine, Emilie and Sazdanovic, Radmila and Wang, Bei and Wang, Yusu and Ziegelmeier, Lori},
  title =	{{Vietoris-Rips and Cech Complexes of Metric Gluings}},
  booktitle =	{34th International Symposium on Computational Geometry (SoCG 2018)},
  pages =	{3:1--3:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-066-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{99},
  editor =	{Speckmann, Bettina and T\'{o}th, Csaba D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.3},
  URN =		{urn:nbn:de:0030-drops-87162},
  doi =		{10.4230/LIPIcs.SoCG.2018.3},
  annote =	{Keywords: Vietoris-Rips and Cech complexes, metric space gluings and wedge sums, metric graphs, persistent homology}
}
  • Refine by Author
  • 1 Adamaszek, Michal
  • 1 Adams, Henry
  • 1 Chazal, Frédéric
  • 1 Gasparovic, Ellen
  • 1 Gommel, Maria
  • Show More...

  • Refine by Classification
  • 3 Mathematics of computing → Algebraic topology
  • 1 Theory of computation → Computational geometry

  • Refine by Keyword
  • 2 Vietoris-Rips complex
  • 2 persistent homology
  • 1 Computational topology
  • 1 Consistency
  • 1 Double offset
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 2 2024
  • 1 2018
  • 1 2020