Offset filtration: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Khmccabe (talk | contribs)
added categories
Khmccabe (talk | contribs)
added properties section
Line 11: Line 11:


== Properties ==
== Properties ==
A standard application of the [[nerve theorem]] shows that the union of balls has the same [[homotopy type]] as its nerve, since closed balls are [[Convex set|convex]] and the intersection of convex sets is convex.<ref>{{Cite journal |last=Edelsbrunner |first=Herbert |date=1993 |title=The union of balls and its dual shape |url=http://portal.acm.org/citation.cfm?doid=160985.161139 |journal=Proceedings of the ninth annual symposium on Computational geometry - SCG '93 |language=en |location=San Diego, California, United States |publisher=ACM Press |pages=218–231 |doi=10.1145/160985.161139 |isbn=978-0-89791-582-3}}</ref> The nerve of the union of balls is also known as the [[Čech complex]]<ref>{{Cite journal |last=Kim |first=Jisu |last2=Shin |first2=Jaehyeok |last3=Chazal |first3=Frédéric |last4=Rinaldo |first4=Alessandro |last5=Wasserman |first5=Larry |date=2020-05-12 |title=Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex |url=http://arxiv.org/abs/1903.06955 |journal=arXiv:1903.06955 [cs, math] |doi=10.48550/arxiv.1903.06955}}</ref>, which is a subcomplex of the [[Vietoris–Rips complex|Vietoris-Rips complex.]]<ref>{{Cite book |last=Edelsbrunner |first=Herbert |url=https://www.worldcat.org/oclc/427757156 |title=Computational topology : an introduction |date=2010 |publisher=American Mathematical Society |others=J. Harer |isbn=978-0-8218-4925-5 |location=Providence, R.I. |pages=61 |oclc=427757156}}</ref> Therefore the offset filtration is [[Weak equivalence (homotopy theory)|weakly equivalent]] to the Čech filtration (defined as the nerve of each offset across all scale parameters), so their [[Homology (mathematics)|homology groups]] are [[Isomorphism|isomorphic]].<ref>{{Cite journal |last=Chazal |first=Frédéric |last2=Michel |first2=Bertrand |date=2021 |title=An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists |url=https://www.frontiersin.org/articles/10.3389/frai.2021.667963 |journal=Frontiers in Artificial Intelligence |volume=4 |doi=10.3389/frai.2021.667963 |issn=2624-8212 |pmc=PMC8511823 |pmid=34661095}}</ref> Although the Vietoris-Rips filtration is not identical to the Čech filtration in general, it is an approximation in a sense. In particular, for a set <math>X \subset \mathbb R^d</math> we have a chain of inclusions <math>\operatorname{Rips}_\varepsilon(X) \subset \operatorname{Cech}_{\varepsilon^\prime}(X) \subset \operatorname{Rips}_{\varepsilon^\prime}(X)</math> between the Rips and Čech complexes on <math>X</math> whenever <math>\varepsilon^\prime / \varepsilon \geq \sqrt{2d/d+1}</math>.<ref>{{Cite journal |last=de Silva |first=Vin |last2=Ghrist |first2=Robert |date=2007-04-25 |title=Coverage in sensor networks via persistent homology |url=http://www.msp.org/agt/2007/7-1/p16.xhtml |journal=Algebraic & Geometric Topology |language=en |volume=7 |issue=1 |pages=339–358 |doi=10.2140/agt.2007.7.339 |issn=1472-2739}}</ref> In general metric spaces, we have that <math>\operatorname{Cech}_\varepsilon(X) \subset \operatorname{Rips}_{2\varepsilon}(X) \subset \operatorname{Cech}_{2\varepsilon}(X)</math> for all <math>\varepsilon >0</math><ref>{{Cite journal |last=Anai |first=Hirokazu |last2=Chazal |first2=Frédéric |last3=Glisse |first3=Marc |last4=Ike |first4=Yuichi |last5=Inakoshi |first5=Hiroya |last6=Tinarrage |first6=Raphaël |last7=Umeda |first7=Yuhei |date=2020-05-26 |title=DTM-based Filtrations |url=http://arxiv.org/abs/1811.04757 |journal=arXiv:1811.04757 [cs, math] |doi=10.48550/arxiv.1811.04757}}</ref>, implying that the Rips and Cech filtrations are 2-interleaved with respect to the interleaving distance as introduced by Chazal et al. in 2009.<ref>{{Cite journal |last=Chazal |first=Frédéric |last2=Cohen-Steiner |first2=David |last3=Glisse |first3=Marc |last4=Guibas |first4=Leonidas J. |last5=Oudot |first5=Steve Y. |date=2009-06-08 |title=Proximity of persistence modules and their diagrams |url=https://dl.acm.org/doi/10.1145/1542362.1542407 |journal=Proceedings of the twenty-fifth annual symposium on Computational geometry |language=en |location=Aarhus Denmark |publisher=ACM |pages=237–246 |doi=10.1145/1542362.1542407 |isbn=978-1-60558-501-7}}</ref>

{{Empty section|date=February 2023}}


==References==
==References==

Revision as of 18:33, 25 February 2023

The offset filtration (also called the "union-of-balls"[1] or "union-of-disks"[2] filtration) is a growing sequence of metric balls used to detect the size and scale of topological features of a data set. The offset filtration commonly arises in persistent homology and the field of topological data analysis. Utilizing a union of balls to approximate the shape of geometric objects was first suggested by Frosini in 1992 in the context of submanifolds of Euclidean space.[3] The construction was independently explored by Robins in 1998, and expanded to considering the collection of offsets indexed over a series of increasing scale parameters (i.e., a growing sequence of balls), in order to observe the stability of topological features with respect to attractors.[4] Homological persistence as introduced in these papers by Frosini and Robins was subsequently formalized by Edelsbrunner et al. in their seminal 2002 paper Topological Persistence and Simplification.[5] Since then, the offset filtration has become a primary example in the study of computational topology and data analysis.

Definition

Let be a finite set in a metric space , and for any let be the closed ball of radius centered at . Then the union is known as the offset of with respect to the parameter (or simply the -offset of ).

By considering the collection of offsets over all we get a family of spaces where whenever . So is a family of nested topological spaces indexed over , which defines a filtration known as the offset filtration on .[6]

Note that it is also possible to view the offset filtration as a functor from the poset category of non-negative real numbers to the category of topological spaces and continuous maps.[7][8] There are some advantages to the categorical viewpoint, as explored by Bubenik and others.[9]

Properties

A standard application of the nerve theorem shows that the union of balls has the same homotopy type as its nerve, since closed balls are convex and the intersection of convex sets is convex.[10] The nerve of the union of balls is also known as the Čech complex[11], which is a subcomplex of the Vietoris-Rips complex.[12] Therefore the offset filtration is weakly equivalent to the Čech filtration (defined as the nerve of each offset across all scale parameters), so their homology groups are isomorphic.[13] Although the Vietoris-Rips filtration is not identical to the Čech filtration in general, it is an approximation in a sense. In particular, for a set we have a chain of inclusions between the Rips and Čech complexes on whenever .[14] In general metric spaces, we have that for all [15], implying that the Rips and Cech filtrations are 2-interleaved with respect to the interleaving distance as introduced by Chazal et al. in 2009.[16]

References

  1. ^ Adams, Henry; Moy, Michael (2021). "Topology Applied to Machine Learning: From Global to Local". Frontiers in Artificial Intelligence. 4: 2. doi:10.3389/frai.2021.668302. ISSN 2624-8212. PMC 8160457. PMID 34056580.{{cite journal}}: CS1 maint: unflagged free DOI (link)
  2. ^ Edelsbrunner, Herbert (2014). A short course in computational geometry and topology. Cham. p. 35. ISBN 978-3-319-05957-0. OCLC 879343648.{{cite book}}: CS1 maint: location missing publisher (link)
  3. ^ Frosini, Patrizio (1992-02-01). Casasent, David P. (ed.). "Measuring shapes by size functions". Boston, MA: 122–133. doi:10.1117/12.57059. {{cite journal}}: Cite journal requires |journal= (help)
  4. ^ Robins, Vanessa (1999-01-01). "Towards computing homology from approximations" (PDF). Topology Proceedings. 24: 503–532.
  5. ^ Edelsbrunner; Letscher; Zomorodian (2002). "Topological Persistence and Simplification". Discrete & Computational Geometry. 28 (4): 511–533. doi:10.1007/s00454-002-2885-2. ISSN 0179-5376.
  6. ^ Halperin, Dan; Kerber, Michael; Shaharabani, Doron (2015), Bansal, Nikhil; Finocchi, Irene (eds.), "The Offset Filtration of Convex Objects", Algorithms - ESA 2015, vol. 9294, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 705–716, doi:10.1007/978-3-662-48350-3_59, ISBN 978-3-662-48349-7, retrieved 2023-02-25
  7. ^ Bauer, Ulrich; Kerber, Michael; Roll, Fabian; Rolle, Alexander (2023-02-16). "A Unified View on the Functorial Nerve Theorem and its Variations". arXiv:2203.03571 [math]: 8. doi:10.48550/arxiv.2203.03571.
  8. ^ Blumberg, Andrew J.; Lesnick, Michael (2022-10-17). "Stability of 2-Parameter Persistent Homology". Foundations of Computational Mathematics. doi:10.1007/s10208-022-09576-6. ISSN 1615-3375.
  9. ^ Bubenik, Peter; Scott, Jonathan A. (2014). "Categorification of Persistent Homology". Discrete & Computational Geometry. 51 (3): 600–627. doi:10.1007/s00454-014-9573-x. ISSN 0179-5376.
  10. ^ Edelsbrunner, Herbert (1993). "The union of balls and its dual shape". Proceedings of the ninth annual symposium on Computational geometry - SCG '93. San Diego, California, United States: ACM Press: 218–231. doi:10.1145/160985.161139. ISBN 978-0-89791-582-3.
  11. ^ Kim, Jisu; Shin, Jaehyeok; Chazal, Frédéric; Rinaldo, Alessandro; Wasserman, Larry (2020-05-12). "Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex". arXiv:1903.06955 [cs, math]. doi:10.48550/arxiv.1903.06955.
  12. ^ Edelsbrunner, Herbert (2010). Computational topology : an introduction. J. Harer. Providence, R.I.: American Mathematical Society. p. 61. ISBN 978-0-8218-4925-5. OCLC 427757156.
  13. ^ Chazal, Frédéric; Michel, Bertrand (2021). "An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists". Frontiers in Artificial Intelligence. 4. doi:10.3389/frai.2021.667963. ISSN 2624-8212. PMC 8511823. PMID 34661095.{{cite journal}}: CS1 maint: PMC format (link) CS1 maint: unflagged free DOI (link)
  14. ^ de Silva, Vin; Ghrist, Robert (2007-04-25). "Coverage in sensor networks via persistent homology". Algebraic & Geometric Topology. 7 (1): 339–358. doi:10.2140/agt.2007.7.339. ISSN 1472-2739.
  15. ^ Anai, Hirokazu; Chazal, Frédéric; Glisse, Marc; Ike, Yuichi; Inakoshi, Hiroya; Tinarrage, Raphaël; Umeda, Yuhei (2020-05-26). "DTM-based Filtrations". arXiv:1811.04757 [cs, math]. doi:10.48550/arxiv.1811.04757.
  16. ^ Chazal, Frédéric; Cohen-Steiner, David; Glisse, Marc; Guibas, Leonidas J.; Oudot, Steve Y. (2009-06-08). "Proximity of persistence modules and their diagrams". Proceedings of the twenty-fifth annual symposium on Computational geometry. Aarhus Denmark: ACM: 237–246. doi:10.1145/1542362.1542407. ISBN 978-1-60558-501-7.