The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index; none of the 8 sources its claims cite is checked for support yet.
Topological Persistence and Simplification
Open accessOverview
AI snapshot
Written from the paper’s full text.
TL;DR
This paper formalizes topological persistence in a filtration, using the lifetime of homology classes to distinguish features from noise, and gives algorithms to compute persistence and simplify filtrations. It demonstrates the approach on alpha-complex filtrations of molecular and surface data, including separation of a tunnel in Gramicidin A from shorter-lived cycles.
Key findings
- Persistence is defined for Betti numbers and non-bounding cycles by factoring a cycle group at one filtration stage by the boundary group at a later stage; cycles with short lifetimes are treated as topological noise, while longer-lived ones are features.
- The pairing algorithm matches positive \(k\)-simplices with negative \((k+1)\)-simplices; index-based persistence is \(j-i-1\), and the worst-case running time is \(O(m^3)\), with union-find acceleration for \(k=0\) and \(k=2\) giving amortized \(O(A^{-1}(m))\) per operation.
- On five datasets, total persistence timings ranged from 0.06 s for Gramicidin A to 19.93 s for the Buddha dataset with union-find, versus 30.52 s without it; average collision counts and list lengths were small, and conflicts were rare (basic conflicts 0–1, recursive conflicts 0–212 across datasets).
- For Gramicidin A, removing 1-cycles with persistence below 2688 isolated the molecular tunnel from other topological attributes.
Methods
- The work studies finite simplicial complexes in \(\mathbb{R}^3\), especially alpha complexes of Delaunay triangulations, ordered by an age filter induced by growing weighted balls.
- Persistence is formulated algebraically as \(H^{\ell,p}_k = Z^\ell_k / (B^{\ell+p}_k \cap Z^\ell_k)\), and an abstract pairing algorithm uses a hash table and cycle search to pair simplex births with deaths; simplification is performed by reordering simplices via migration, with conflict resolution or diminution.
- Experiments implemented the algorithms with alpha-shapes software on five datasets: three weighted molecular structures and two unweighted macroscopic surfaces; timings were collected on a 266 MHz Pentium II with 128 MB RAM under Solaris 8.
Limitations
- Stated: the detailed analysis of the 1-cycle computation is left open, and the authors ask for a different, more efficient algorithm; worst-case cubic behavior contrasts with observed near-linear timing, and conflicts, though rare, require handling.
- Stated: conflict resolution by subdivision may not correspond to the alpha-complex growth model, while conflict diminution changes when cycles affect Betti numbers.
- Evident from the text: the experimental evidence covers only five datasets and a prototype implementation; time-based persistence is not developed further, and the setting is restricted to \(\mathbb{R}^3\) complexes with \(\mathbb{Z}_2\) coefficients.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
41 Own interpretation · 29 No basis given · 10 Own result · 4 Sources not found · 4 No full text of the sources
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The primary topological feature of this data is a tunnel that runs through the molecule, as shown in Fig. 17.”
§ Discrete & Computational Geometry > Feature Detection.
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The image of the homomorphism is isomorphic to the p-persistent homology group of K ℓ , im η ℓ, p k H ℓ, p k .”
§ Discrete & Computational Geometry > Algebraic Formulation.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Then Z ℓ k ∩ B ℓ+ p-1 k = Z ℓ k ∩ B ℓ+ p k , and hence β ℓ, p k = β ℓ, p-1 k”
§ Discrete & Computational Geometry > Abstract Algorithm.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“After accelerating with union-find, the slowest portion of the algorithm is adding 1-cycles.”
§ Discrete & Computational Geometry > Timings.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In other words, increasing p by one shortens the persistence of all nonbounding cycles by one.”
§ Discrete & Computational Geometry > Algebraic Formulation.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“k-Triangle Lemma.The number of k-triangles containing (ℓ, p) in the index-persistence plane is β ℓ, p k .”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“While there is considerable topological noise at p = 0, a simplification process which eliminates 1cycles of persistence less than 2688 succeeds in separating the tunnel from the remaining topological attributes detected by measuring homology.”
§ Discrete & Computational Geometry > Feature Detection.
plaindirectSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption: The Gramicidin A dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We will see in Section 3 that there exists a pairing between positive k-simplices and negative (k + 1)-simplices.”
§ Discrete & Computational Geometry > Incremental Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“If follows that β ℓ, p k = β ℓ, p-1 k -1.”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaindirectn = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Monotonicity Lemma.β ℓ, p k ≤ β ℓ , p k whenever p ≤ p and ℓ ≤ ℓ ≤ ℓ + ( pp ).”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 16
- It may state two separate claims as one. 24
- The quote only partly states this claim. 1
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The persistence of that k-cycle is one short of the difference between indices, ji -1.”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We can write each tunnel as a sum of tunnels in a basis, and β 1 is the size of the basis.”
§ Discrete & Computational Geometry > Homology Groups.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“As before, β 2 is the size of a basis of voids, which is equal to the number of voids.”
§ Discrete & Computational Geometry > Homology Groups.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All Betti numbers are non-negative so pos k ≥ neg k+1 for all ℓ.”
§ Discrete & Computational Geometry > Incremental Algorithm.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“All we guarantee is that d is homologous to the sum of cycles represented by the simplices in the list, and that the list contains the youngest simplex in (d), which is σ i as above.”
§ Discrete & Computational Geometry > Data Structure.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Basic and recursive conflicts exist in practice, but are rather rare, as shown in Section 6.”
§ Discrete & Computational Geometry > Conflict Lemma. All conflicts have type (1, 2).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For each simplex σ ∈ D, there is a unique birth time α(σ ) defined such that σ ∈ K (α) iff α ≥ α(σ ).”
§ Discrete & Computational Geometry > Age Filters.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The pairs (su, suv) and (tw, stu) in Fig. 6 constitute a conflict of type (1,2) and show that conflicts do occur, although our experiments in Section 6 suggest that they are rather rare.”
§ Discrete & Computational Geometry > Conflicts.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The results suggest a possible linear dependence of the running time on the size of the data, which is substantially faster than the cubic dependence proved in Section 4.”
§ Discrete & Computational Geometry > Timings.
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Tables 3 and 4 provide evidence that this might indeed be the case.”
§ Discrete & Computational Geometry > Statistics.
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Furthermore, if σ ∈ K , then all faces of σ are simplices in K .”
§ Discrete & Computational Geometry > Figure 1 illustrates a two-dimensional example of this construction.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The incremental algorithm in Section 2 asserts that β ℓ k is the number of k-intervals that contain index ℓ on the axis.”
§ Discrete & Computational Geometry > Abstract Algorithm.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We do not show statistics for 0-cycles in Table 4 as every 0-cycle is represented by a list of length 2.”
§ Discrete & Computational Geometry > Statistics.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Any two simplices in K are either disjoint or they intersect in a common face, which is a simplex of smaller dimension.”
§ Discrete & Computational Geometry > Figure 1 illustrates a two-dimensional example of this construction.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- The authors state this as an assumption: The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As substantiated in Table 2, this improvement subsumes adding 0-and 2-cycles in the marking process, shrinking the time for these to steps to essentially nothing.”
§ Discrete & Computational Geometry > Timings.
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
§ Discrete & Computational Geometry > Statistics.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The total algorithm runs in time at most O( p 2 i ), which is at most O(m 3 ).”
§ Discrete & Computational Geometry > Collision Lemma.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our motivation for formulating persistent homology in (3) was to eliminate cycles with low persistence.”
§ Discrete & Computational Geometry > Lazy Migration.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“There are 4 2 = 6 possible types of conflicts, each identified by the pair (dim σ i , dim σ h ) of the dimensions of the main participants.”
§ Discrete & Computational Geometry > Conflicts.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The sequence of iso-surfaces obtained by increasing α represents a growth process similar to that represented by a filtration.”
§ Discrete & Computational Geometry > Approach and Results.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As cx is not a face of abx, we have removed the conflict and preserved the Betti numbers of a refined filtration.”
§ Discrete & Computational Geometry > Conflict Resolution.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“By complementarity and duality, there are no conflicts of types (1, 3) and (2, 3).”
§ Discrete & Computational Geometry > Conflict Lemma. All conflicts have type (1, 2).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We can explain the apparently linear running time documented in Table 2 by showing that the average number of collisions and the average list length are both constant.”
§ Discrete & Computational Geometry > Statistics.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The cycle search continues until it finds a collision-free cycle homologous to d, and the Collision Lemma implies that that cycle has the correct youngest positive simplex.”
§ Discrete & Computational Geometry > Collision Lemma.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A single collision takes time at most O( p i ), and the entire search for σ i takes time at most O( p 2 i ).”
§ Discrete & Computational Geometry > Collision Lemma.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Finally, we note that Robins has independently formulated an alternate but equivalent definition of persistence [10].”
§ Discrete & Computational Geometry > Algebraic Formulation.
What the sources say
- Not matchedcites [10] 10. V. Robins. Computing topology at multiple resolutions: foundations and applications to fractals and dynamics. Ph.D. thesis, Department of Applied Mathematics, University of Colorado, June 2000.
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
- Not matched
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The ordering of the new simplices specified by subdivision in Fig. 13 might not have a corresponding set of weighted balls that would generate the filtration under the growth model.”
§ Discrete & Computational Geometry > Conflict Resolution.
hedged- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
- Rests on an assumption: In alpha complex filtrations, simplices are ordered according to a particular growth model.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Recall that the number of collisions and the length of lists is bounded from above by the persistence of cycles.”
§ Discrete & Computational Geometry > Statistics.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Specifically, simplices in a filter correspond to critical points of a density function.”
§ Discrete & Computational Geometry > Approach and Results.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Hence, i contains fewer than (k + 2) p i k-simplices, and similarly g contains fewer than (k + 2) p g < (k + 2) p i k-simplices.”
§ Discrete & Computational Geometry > Collision Lemma.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For k = 0, each set is the vertex set of a connected component.Each set has exactly one yet unpaired vertex, namely the oldest one in the component.”
§ Discrete & Computational Geometry > Collision Lemma.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As a consequence of the formulation, the lifetime of every cycle is reduced regardless of its persistence, leading to the creation of k-triangles.”
§ Discrete & Computational Geometry > Lazy Migration.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
It may state two separate claims as one.
In the paper
“The problem of topological simplification was also approached by El-Sana and Varshney [5] using alpha shape inspired ideas of geometric growth.”
§ Discrete & Computational Geometry > Approach and Results.
What the sources say
- Not checked — no full text of the sourcecites [5] 5. J. El-Sana and A. Varshney. Topology simplification for polygonal virtual environments. IEEE Trans. Visual. Comput. Graphics, 4:133-144, 1998. source
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We cannot achieve the same acceleration for 1-cycles using this method, however, as there can be multiple unpaired positive edges at any time.”
§ Discrete & Computational Geometry > Collision Lemma.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The number of collisions is at most the number of positive k-simplices strictly between σ i and σ j , which is less than p i .”
§ Discrete & Computational Geometry > Collision Lemma.
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We interpret these intervals as k-intervals of a simplified version of the original filtration.”
§ Discrete & Computational Geometry > 5. Simplification
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We may resolve a conflict by subdivision.Here, we achieve the correct Betti numbers for a refined complex and its corresponding filtrations.”
§ Discrete & Computational Geometry > Conflict Resolution.
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“At the time we move it, the face is already collocated with its matching negative simplex, and the two cancel each other's contributions.”
§ Discrete & Computational Geometry > 5. Simplification
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“A collision happens at T[g] only if σ g already forms a pair, which implies its k-interval [g, h) is contained inside [i, j).”
§ Discrete & Computational Geometry > Collision Lemma.
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The authors state this as an assumption.
The point set is in general position, so at most four (three in R^2) Voronoi regions can have a non-empty common intersection.
“We assume general position, where at most four (three in R 2 ) Voronoi regions can have a non-empty common intersection.”
The paper relies on this without support.
Complexes embedded in three-dimensional Euclidean space have no torsion.
“There is no torsion in complexes embedded in three-dimensional Euclidean space, so the homology groups are vector spaces.”
The paper relies on this without support.
In alpha complex filtrations, simplices are ordered according to a particular growth model.
“For example, in alpha complex filtrations, simplices are ordered according to a particular growth model.”
The paper relies on this without support.
The five data sets used in the experiments are representative of their respective classes of molecular structures and macroscopic shapes.
“We have applied the software to a variety of datasets and show the results for five representative sets in this section.”
The paper relies on this without support.
The Gramicidin A dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.
“This dataset contains the time-averaged molecular dynamics structure of Gramicidin A, a peptide that forms a channel for ion and water movement across lipid membranes.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In other words, the authors prove constructively that persistent homology groups of subcomplexes of S 3 , if computed over Z 2 coefficients, have a simple description in terms of a set of intervals.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Surprisingly, the authors show that these intervals allowed the correct computation of the rank of persistent homology groups.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“The authors also provide an algorithm that worked only for spaces that were subcomplexes of S 3 over Z 2 coefficients.”
From Computing Persistent Homology (2005) · cites this paper as [11]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Therefore, the P -intervals discussed here are precisely the so-called k -intervals utilized in [11] to describe persistent Z 2-homology.”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“Lemma 3.1. Let T be the set of triangles defined by P -intervals for the k-dimensional persistence module . The rank β l , p k of H l , p k is the number of triangles in T containing the point ( l , p ) .”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“This algorithm is a generalized version of the pairing algorithm shown in [11].”
From Computing Persistent Homology (2005) · cites this paper as [11]
The cited source says what the claim attributes to it.
In the citing paper
“Then im η i , p k ≃ H i , p k [11], [18].”
From Computing Persistent Homology (2005) · cites this paper as [11]
In the citing paper
“As a result, persistent homology can capture topological structures continuously over a range of spatial scales.”
From Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks (2018) · cites this paper as [17]
In the citing paper
“Unlike commonly used computational homology which results in truly metric free representations, persistent homology embeds geometric information in topological invariants, e.g., Betti numbers, so that 'birth' and 'death' of isolated components, rings, and cavities can be monitored at all geometric scales by topological measurements.”
From Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks (2018) · cites this paper as [17]
In the citing paper
“Persistent homology22–25—a new branch of algebraic topology—is able to bridge geometry and topology, leading to a new efficient approach for the simplification of biological structural complexity26–31; however, it neglects critical chemical/biological information when it is directly applied to complex biomolecular structures.”
From A topology-based network tree for the prediction of protein–protein binding affinity changes following mutation (2020) · cites this paper as [23]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Discrete & Computational Geometry > Algebraic Formulation.
“The p-persistent homology groups can also be defined using injective homomorphisms between ordinary homology groups.”
§ Discrete & Computational Geometry > Algebraic Formulation.
“Note that as we increase p, negative simplices cancel positive simplices earlier in the filtration.”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Discrete & Computational Geometry > Statistics.
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
§ Discrete & Computational Geometry > 7. Future Directions
“| G | 10 | 2.47 | 2.22 | 111 | 4.86 | 2.08 |”
Citations
Cites
Rayward-Smith, V. J., Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1991) · Journal of the Operational Research Society · doi:10.2307/2583667 · Cited by 16,958
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Level Set Methods: An Overview and Some Recent Results
Osher, S., & Fedkiw, R. P. (2001) · Journal of Computational Physics · doi:10.1006/jcph.2000.6636 · Cited by 2,327
Elements of Algebraic Topology
Munkres, J. R. (2018) · CRC Press eBooks · doi:10.1201/9780429493911 · Cited by 2,113
ELEMENTS OF ALGEBRAIC TOPOLOGY
Kuratowski, K. (1972) · Elsevier eBooks · doi:10.1016/b978-0-08-016160-0.50028-2 · Cited by 1,290
A User's Guide to Spectral Sequences
McCleary, J. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626289 · Cited by 838
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
Grossman, P. A. (1995) · doi:10.1007/978-1-349-13908-8_1 · Cited by 676
An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Delfinado, C. J. A., & Edelsbrunner, H. (1995) · Computer Aided Geometric Design · doi:10.1016/0167-8396(95)00016-y · Cited by 183
Topology simplification for polygonal virtual environments
El-Sana, J., & Varshney, A. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.694955 · Cited by 58
Research works printed but not linked: 2
- [8]8. J. Milnor. Morse Theory. Princeton University Press, Princeton, New Jersey, 1963.
- [11]11. J. A. Sethian. Level Set Methods. Cambridge University Press, Cambridge, 1996. Received March 19, 2001, and in revised form October 4, 2001. Online publication October 29, 2002.
Cited by
Sorted by citations
Items 201–300 of 1,811
Topological deep learning: a review of an emerging paradigm
Zia, A., Khamis, A., Nichols, J. D., Tayab, U. B., Hayder, Z., Rolland, V., Stone, E. A., & Petersson, L. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10710-9 · Cited by 74
T opo MS: Comprehensive topological exploration for molecular and condensed‐matter systems
Bhatia, H., Gyulassy, A. G., Lordi, V., et al. (2018) · Journal of Computational Chemistry · doi:10.1002/jcc.25181 · Cited by 65
Non-empirical identification of trigger sites in heterogeneous processes using persistent homology
Kimura, M., Obayashi, I., Takeichi, Y., Murao, R., & Hiraoka, Y. (2018) · Scientific Reports · doi:10.1038/s41598-018-21867-z · Cited by 64
Translated Poisson Mixture Model for Stratification Learning
Haro, G., Randall, G., & Sapiro, G. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-008-0144-6 · Cited by 65
AN ALGEBRAIC TOPOLOGICAL METHOD FOR FEATURE IDENTIFICATION
Carlsson, E., Carlsson, G., & de Silva, V. (2006) · International Journal of Computational Geometry & Applications · doi:10.1142/s021819590600204x · Cited by 65
Omicron BA.2 (B.1.1.529.2): high potential to becoming the next dominating variantPreprint
Chen, J., & Wei, G. (2022) · Research Square · doi:10.21203/rs.3.rs-1362445/v1 · Cited by 69
Pike, J. A., Khan, A. O., Pallini, C., Thomas, S. G., Mund, M., Ries, J., Poulter, N. S., & Styles, I. B. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz788 · Cited by 61
Applications of Topological Data Analysis in Oncology
Bukkuri, A., Andor, N., & Darcy, I. K. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.659037 · Cited by 74
Persistent Betti numbers for a noise tolerant shape-based approach to image retrieval
Frosini, P., & Landi, C. (2012) · Pattern Recognition Letters · doi:10.1016/j.patrec.2012.10.015 · Cited by 54
Geometrical and topological approaches to Big Data
Snåšel, V., Nowaková, J., Xhafa, F., & Barolli, L. (2016) · Future Generation Computer Systems · doi:10.1016/j.future.2016.06.005 · Cited by 64
A multi-resolution data structure for two-dimensional Morse-Smale functions
Bremer, P., Edelsbrunner, H., Hamann, B., et al. (2003) · doi:10.1109/visual.2003.1250365 · Cited by 62
Liu, X., Feng, H., Wu, J., & Xia, K. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab127 · Cited by 65
Clique Community Persistence: A Topological Visual Analysis Approach for Complex Networks
Rieck, B., Fugacci, U., Lukasczyk, J., & Leitte, H. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2017.2744321 · Cited by 61
Finding cosmic voids and filament loops using topological data analysis
Xu, X., Cisewski-Kehe, J., Green, S. B., & Nagai, D. (2019) · Astronomy and Computing · doi:10.1016/j.ascom.2019.02.003 · Cited by 61
T-ReX: a graph-based filament detection method
Bonnaire, T., Aghanim, N., Decelle, A., et al. (2020) · Astronomy and Astrophysics · doi:10.1051/0004-6361/201936859 · Cited by 60
Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic TopologyPreprint
Rieck, B., Togninalli, M., Bock, C., Moor, M., Horn, M., Gumbsch, T., & Borgwardt, K. M. (2018) · arXiv (Cornell University) · doi:10.3929/ethz-b-000327207 · Cited by 66
Persistence Curves: A canonical framework for summarizing persistence diagrams
Chung, Y.-M., & Lawson, A. (2022) · Advances in Computational Mathematics · doi:10.1007/s10444-021-09893-4 · Cited by 65
Object-oriented persistent homology
Wang, B., & Wei, G. (2015) · Journal of Computational Physics · doi:10.1016/j.jcp.2015.10.036 · Cited by 50
The Persistence Landscape and Some of Its Properties
Bubenik, P. (2020) · Abel symposia · doi:10.1007/978-3-030-43408-3_4 · Cited by 62
Stability and Computation of Topological Invariants of Solids in ${\Bbb R}^n$
Chazal, F., & Lieutier, A. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-007-1309-8 · Cited by 55
Hypergraph-based persistent cohomology (HPC) for molecular representations in drug design
Liu, X., Wang, X., Wu, J., & Xia, K. (2020) · Briefings in Bioinformatics · doi:10.1093/bib/bbaa411 · Cited by 60
Promises and pitfalls of topological data analysis for brain connectivity analysis
Caputi, L., Pidnebesna, A., & Hlinka, J. (2021) · NeuroImage · doi:10.1016/j.neuroimage.2021.118245 · Cited by 62
Computing Multidimensional Persistence
Carlsson, G., Singh, G., & Zomorodian, A. J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10631-6_74 · Cited by 65
Visualization of High-Dimensional Point Clouds Using Their Density Distribution's Topology
Oesterling, P., Heine, C., Jänicke, H., Scheuermann, G., & Heyer, G. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.27 · Cited by 57
A functorial Dowker theorem and persistent homology of asymmetric networks
Chowdhury, S., & Mémoli, F. (2018) · Journal of Applied and Computational Topology · doi:10.1007/s41468-018-0020-6 · Cited by 75
Local and global comparison of continuous functions
Edelsbrunner, H., Harer, J., Natarajan, V., et al. (2005) · IEEE Visualization · doi:10.1109/visual.2004.68 · Cited by 58
Comparison of Pattern Detection Methods in Microarray Time Series of the Segmentation Clock
Dequéant, M., Ahnert, S. E., Edelsbrunner, H., Fink, T., Glynn, E. F., Hattem, G. L., Kudlicki, A. S., Mileyko, Y., Morton, J., Mushegian, A. R., et al. (2008) · PLoS ONE · doi:10.1371/journal.pone.0002856 · Cited by 53
Branching and Circular Features in High Dimensional Data
Wang, B., Summa, B., Pascucci, V., & Vejdemo‐Johansson, M. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.177 · Cited by 47
Topological data analysis for the string landscape
Cole, A., & Shiu, G. (2019) · Journal of High Energy Physics · doi:10.1007/jhep03(2019)054 · Cited by 60
Wee, J., & Xia, K. (2021) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.0c01415 · Cited by 60
Subsampling Methods for Persistent HomologyPreprint
Chazal, F., Fasy, B. T., Lecci, F., Michel, B., Rinaldo, A., & Wasserman, L. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.1901 · Cited by 70
Schweidtmann, A. M., Weber, J. M., Wende, C., Netze, L., & Mitsos, A. (2021) · Optimization and Engineering · doi:10.1007/s11081-021-09608-0 · Cited by 62
Diffusion-geometric maximally stable component detection in deformable shapes
Litman, R., Bronstein, A. M., & Bronstein, M. M. (2011) · Computers & Graphics · doi:10.1016/j.cag.2011.03.011 · Cited by 55
Generalized Topological Simplification of Scalar Fields on Surfaces
Tierny, J., & Pascucci, V. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.228 · Cited by 56
Reeb Graphs: Approximation and Persistence
Dey, T. K., & Wang, Y. (2012) · Discrete & Computational Geometry · doi:10.1007/s00454-012-9463-z · Cited by 51
Topological methods for genomics: Present and future directions
Cámara, P. G. (2016) · Current Opinion in Systems Biology · doi:10.1016/j.coisb.2016.12.007 · Cited by 55
Wee, J., & Xia, K. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab136 · Cited by 57
Efficient map reconstruction and augmentation via topological methods
Wang, S., Wang, Y., & Li, Y. (2015) · ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL GIS) · doi:10.1145/2820783.2820833 · Cited by 55
Searching the landscape of flux vacua with genetic algorithms
Cole, A., Schachner, A., & Shiu, G. (2019) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.17863/cam.79204 · Cited by 59
Structure and Stability of the One-Dimensional Mapper
Carrière, M., & Oudot, S. (2017) · HAL · Cited by 54
Li, X., Hu, C., & Liang, J. (2003) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.10442 · Cited by 55
Evasion paths in mobile sensor networks
Adams, H., & Carlsson, G. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914548051 · Cited by 49
PHAT – Persistent Homology Algorithms Toolbox
Bauer, U., Kerber, M., Reininghaus, J., et al. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44199-2_24 · Cited by 54
Topology-based Simplification for Feature Extraction from 3D Scalar Fields
Gyulassy, A. G., Natarajan, V., Pascucci, V., Bremer, P., & Bernd Hamann, A. (2006) · Visualization · doi:10.1109/visual.2005.1532839 · Cited by 53
Detailed reconstruction of 3D plant root shape
Zheng, Y., Gu, S., Edelsbrunner, H., et al. (2011) · International Conference on Computer Vision · doi:10.1109/iccv.2011.6126475 · Cited by 53
Global Feature Tracking and Similarity Estimation in Time‐Dependent Scalar Fields
Saikia, H., & Weinkauf, T. (2017) · Computer Graphics Forum · doi:10.1111/cgf.13163 · Cited by 53
Learning metrics for persistence-based summaries and applications for graph classificationPreprint
Zhao, Q., & Wang, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.12189 · Cited by 59
Simulating the diversity of shapes of the Lyman-α line
Blaizot, J., Garel, T., Verhamme, A., et al. (2023) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stad1523 · Cited by 52
Persistent homology of attractors for action recognition
Venkataraman, V., Ramamurthy, K. N., & Turaga, P. K. (2016) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2016.7533141 · Cited by 53
Lung Topology Characteristics in patients with Chronic Obstructive Pulmonary Disease
Guillamon, F. B., Pirashvili, M., Conway, J. H., Bennett, M. J., Djukanović, R., & Brodzki, J. (2018) · Scientific Reports · doi:10.1038/s41598-018-23424-0 · Cited by 54
One-dimensional reduction of multidimensional persistent homology
Cagliari, F., Fabio, B. D., & Ferri, M. (2010) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-10-10312-8 · Cited by 52
A weak characterisation of the Delaunay triangulation
de Silva, V. (2008) · Geometriae Dedicata · doi:10.1007/s10711-008-9261-1 · Cited by 50
Approximating loops in a shortest homology basis from point data
Dey, T. K., Sun, J. Z., & Wang, Y. (2010) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1810959.1810989 · Cited by 46
Heat-mapping: A robust approach toward perceptually consistent mesh segmentation
Fang, Y., Sun, M., Kim, M., et al. (2011) · doi:10.1109/cvpr.2011.5995695 · Cited by 51
A Structural Average of Labeled Merge Trees for Uncertainty Visualization
Yan, L., Wang, Y., Munch, E., Gasparovic, E., & Wang, B. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2019.2934242 · Cited by 50
Natarajan, V., Wang, Y., Bremer, P., et al. (2006) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2006.02.003 · Cited by 51
Persistence-based clustering in riemannian manifolds
Chazal, F., Guibas, L. J., Oudot, S., & Škraba, P. (2011) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1998196.1998212 · Cited by 48
Topological Data Analysis Generates High-Resolution, Genome-wide Maps of Human Recombination
Cámara, P. G., Rosenbloom, D. I. S., Emmett, K., Levine, A. J., & Rabadán, R. (2016) · Cell Systems · doi:10.1016/j.cels.2016.05.008 · Cited by 50
Measuring and computing natural generators for homology groups
Chen, C., & Freedman, D. (2009) · Computational Geometry · doi:10.1016/j.comgeo.2009.06.004 · Cited by 47
Topological Analysis of Variance and the Maxillary Complex
Heo, G., Gamble, J., & Kim, P. T. (2012) · Journal of the American Statistical Association · doi:10.1080/01621459.2011.641430 · Cited by 49
Convergence Rates for Persistence Diagram Estimation in Topological Data Analysis
Chazal, F., Glisse, M., Labruère, C., & Michel, B. (2014) · HAL · doi:10.5555/2789272.2912112 · Cited by 71
Selinger, C., Tisoncik-Go, J., Menachery, V. D., Agnihothram, S., Law, G. L., Chang, J., Kelly, S. M., Sova, P., Baric, R. S., & Katze, M. G. (2014) · BMC Genomics · doi:10.1186/1471-2164-15-1161 · Cited by 47
Topological portraits of multiscale coordination dynamics
Zhang, M., Kalies, W. D., Kelso, J. A. S., & Tognoli, E. (2020) · Journal of Neuroscience Methods · doi:10.1016/j.jneumeth.2020.108672 · Cited by 49
Evolutionary de Rham-Hodge method
Chen, J., Zhao, R., Tong, Y., & Wei, G. (2020) · Discrete and Continuous Dynamical Systems - B · doi:10.3934/dcdsb.2020257 · Cited by 52
Time series classification via topological data analysis
Karan, A., & Kaygun, A. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115326 · Cited by 59
Feature Tracking Using Reeb Graphs
Weber, G. H., Bremer, P., Day, M., et al. (2010) · Mathematics and visualization · doi:10.1007/978-3-642-15014-2_20 · Cited by 49
A new algorithm for computing the 2-dimensional matching distance between size functions
Biasotti, S., Cerri, A., Frosini, P., & Giorgi, D. (2011) · Pattern Recognition Letters · doi:10.1016/j.patrec.2011.07.014 · Cited by 47
Task-based augmented merge trees with Fibonacci heaps
Gueunet, C., Pierre, F., Jomier, J., et al. (2017) · IEEE Symposium on Large Data Analysis and Visualization · doi:10.1109/ldav.2017.8231846 · Cited by 49
Shared-Memory Parallel Computation of Morse-Smale Complexes with Improved Accuracy
Gyulassy, A. G., Bremer, P., & Pascucci, V. (2018) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2864848 · Cited by 49
Optimal Topological Simplification of Discrete Functions on Surfaces
Bauer, U., Lange, C., & Wardetzky, M. (2011) · Discrete & Computational Geometry · doi:10.1007/s00454-011-9350-z · Cited by 49
Testing Expansion in Bounded-Degree Graphs
Czumaj, A., & Sohler, C. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.33 · Cited by 48
Sabinina, V. J., Hossain, M. J., Hèriché, J.-K., Hoess, P., Nijmeijer, B., Mosalaganti, S., Kueblbeck, M., Callegari, A., Szymborska, A., Beck, M., et al. (2021) · Molecular Biology of the Cell · doi:10.1091/mbc.e20-11-0728 · Cited by 46
Continuous Indexing of Fibrosis (CIF): improving the assessment and classification of MPN patients
Ryou, H., Sirinukunwattana, K., Aberdeen, A., Grindstaff, G., Stolz, B. J., Byrne, H. M., Harrington, H. A., Sousos, N., Godfrey, A. L., Harrison, C. N., et al. (2022) · Leukemia · doi:10.1038/s41375-022-01773-0 · Cited by 52
Jacobi Fiber Surfaces for Bivariate Reeb Space Computation
Tierny, J., & Carr, H. A. (2016) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2599017 · Cited by 48
Contour forests: Fast multi-threaded augmented contour trees
Gueunet, C., Pierre, F., Jomier, J., & Tierny, J. (2016) · IEEE Symposium on Large Data Analysis and Visualization · doi:10.1109/ldav.2016.7874333 · Cited by 46
Feldbrugge, J., van Engelen, M., van de Weygaert, R., et al. (2019) · Journal of Cosmology and Astroparticle Physics · doi:10.1088/1475-7516/2019/09/052 · Cited by 48
Edelsbrunner, H. (2011) · Cited by 48
Mandatory Critical Points of 2D Uncertain Scalar Fields
Günther, D., Salmon, J., & Tierny, J. (2014) · Computer Graphics Forum · doi:10.1111/cgf.12359 · Cited by 47
Bell, N., & Hirani, A. N. (2012) · ACM Transactions on Mathematical Software · doi:10.1145/2382585.2382588 · Cited by 46
Autonomous reconstruction of unknown indoor scenes guided by time-varying tensor fields
Xu, K., Zheng, L., Yan, Z., et al. (2017) · ACM Transactions on Graphics · doi:10.1145/3130800.3130812 · Cited by 47
The persistence of large scale structures. Part I. Primordial non-Gaussianity
Biagetti, M., Cole, A., & Shiu, G. (2021) · Journal of Cosmology and Astroparticle Physics · doi:10.1088/1475-7516/2021/04/061 · Cited by 45
Chirigati, F., Doraiswamy, H., Damoulas, T., et al. (2016) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/2882903.2915245 · Cited by 47
Fair morse functions for extracting the topological structure of a surface mesh
Ni, X., Garland, M., & Hart, J. C. (2004) · ACM SIGGRAPH Conference Papers (SIGGRAPH) · doi:10.1145/1186562.1015769 · Cited by 47
Structural changes during glass formation extracted by computational homology with machine learning
Hirata, A., Wada, T., Obayashi, I., et al. (2020) · Communications Materials · doi:10.1038/s43246-020-00100-3 · Cited by 46
Tracking the time evolution of soft matter systems via topological structural heterogeneity
Solis, I. M., Orlova, T., Bednarska, K., et al. (2022) · Communications Materials · doi:10.1038/s43246-021-00223-1 · Cited by 46
Wee, J., & Xia, K. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac024 · Cited by 48
Analysis of scalar fields over point cloud data
Chazal, F., Guibas, L. J., Oudot, S., & Škraba, P. (2009) · doi:10.5555/1496770.1496881 · Cited by 46
Pokorny, F. T., Hawasly, M., & Ramamoorthy, S. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364915586713 · Cited by 46
An Exploration Framework to Identify and Track Movement of Cloud Systems
Doraiswamy, H., Natarajan, V., & Nanjundiah, R. S. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.131 · Cited by 44
Persistence Modules on Commutative Ladders of Finite Type
Escolar, E. G., & Hiraoka, Y. (2015) · Discrete & Computational Geometry · doi:10.1007/s00454-015-9746-2 · Cited by 52
Topology‐based Smoothing of 2D Scalar Fields with C 1 ‐Continuity
Weinkauf, T., Gingold, Y. I., & Sorkine, O. (2010) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01702.x · Cited by 46
Zomorodian, A. J. (2009) · Chapman & Hall/CRC applied algorithms and data structures series · doi:10.1201/9781584888215-c3 · Cited by 46
Reconstruction Using Witness Complexes
Guibas, L. J., & Oudot, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9094-6 · Cited by 49
Homology algorithm based on acyclic subspace
Mrożek, M., Pilarczyk, P., & Żelazna, N. (2007) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2007.08.044 · Cited by 46
Size functions for comparing 3D models
Biasotti, S., Giorgi, D., Spagnuolo, M., & Falcidieno, B. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.02.003 · Cited by 46
Multiresolution persistent homology for excessively large biomolecular datasets
Xia, K., Zhao, Z., & Wei, G. (2015) · The Journal of Chemical Physics · doi:10.1063/1.4931733 · Cited by 38
Persistent topology for cryo‐EM data analysis
Xia, K., & Wei, G. (2015) · International Journal for Numerical Methods in Biomedical Engineering · doi:10.1002/cnm.2719 · Cited by 36
Tropical Coordinates on the Space of Persistence Barcodes
Kališnik, S. (2018) · Foundations of Computational Mathematics · doi:10.1007/s10208-018-9379-y · Cited by 69
Bounds on spectral norms and barcodes
Kislev, A., & Shelukhin, E. (2021) · Geometry & Topology · doi:10.2140/gt.2021.25.3257 · Cited by 42
Metadata
- Authors
- Edelsbrunner, Letscher, & Zomorodian
- Affiliations
- Duke University (US)
- Oklahoma State University (US)
- University of Illinois Urbana-Champaign (US)
- Venue
- Discrete & Computational Geometry
- Published
- 2002-11
- Volume
- 28
- Issue
- 4
- Pages
- 511-533
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W3013843370
- Cited by
- 1,779
- References
- 12
- Citations by year
- 2026: 130 · 2025: 152 · 2024: 125 · 2023: 94 · 2022: 91 · 2021: 139 · 2020: 106 · 2019: 131 · 2018: 101 · 2017: 72 · 2016: 89 · 2015: 70 · 2014: 74 · 2013: 47 · 2012: 63
- FWCI
- 13.65
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Discrete & Computational Geometry (publishedVersion)
- Funders
- National Science Foundation (9712088)
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Digital Image Processing Techniques
- Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
- Keywords
- topological persistence, topological simplification, simplicial complexes, filtration, computational topology
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
