Sciweavers

729 search results - page 1 / 146
» Computing persistent homology
Sort
View
COMPGEOM
2004
ACM
14 years 4 months ago
Computing persistent homology
We show that the persistent homology of a filtered ddimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analy...
Afra Zomorodian, Gunnar Carlsson
ESA
2010
Springer
248views Algorithms» more  ESA 2010»
13 years 12 months ago
The Robustness of Level Sets
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozo...
FOCM
2011
96views more  FOCM 2011»
13 years 2 months ago
Persistent Intersection Homology
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...
Paul Bendich, John Harer
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 11 months ago
Optimal topological simplification of discrete functions on surfaces
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Ulrich Bauer, Carsten Lange, Max Wardetzky
COMPGEOM
2009
ACM
14 years 5 months ago
Zigzag persistent homology and real-valued functions
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
Gunnar Carlsson, Vin de Silva, Dmitriy Morozov