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 601–700 of 1,811
Efficient Output-Sensitive Construction of Reeb Graphs
Doraiswamy, H., & Natarajan, V. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92182-0_50 · Cited by 15
Computational Topology Techniques for Characterizing Time-Series Data
Sanderson, N., Shugerman, E., Molnar, S., Meiss, J. D., & Bradley, E. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-68765-0_24 · Cited by 20
Xia, K., & Wei, G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.01735 · Cited by 22
Razmarashooli, A., Chua, Y. K., Barzegar, V., Salazar, D., Laflamme, S., Hu, C. K., Downey, A. R. J., Dodson, J. C., & Schrader, P. T. (2024) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2024.112048 · Cited by 14
Chulián, S., Stolz, B. J., Martínez-Rubio, Á., Goñi, C. B., Gutiérrez, J. F. R., Caballero‐Velázquez, T., Quintana, Á. M., Ramírez, M. R., Robleda, A. C., Soler, J. L. F., et al. (2023) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1011329 · Cited by 14
Persistent homology and topological statistics of hyperuniform point clouds
Salvalaglio, M., Skinner, D. J., Dunkel, J., et al. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023107 · Cited by 14
Persistent Homology: a Step-by-step Introduction for Newcomers
Fugacci, U., Scaramuccia, S., Iuricich, F., & Floriani, L. D. (2016) · PORTO@Iris · doi:10.2312/stag.20161358 · Cited by 21
On the geometrical properties of the coherent matching distance in 2D persistent homology
Cerri, A., Ethier, M., & Frosini, P. (2019) · Journal of Applied and Computational Topology · doi:10.1007/s41468-019-00041-y · Cited by 13
Topological Eulerian Synthesis of Slow Motion Periodic Videos
Tralie, C. J., & Berger, M. (2018) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2018.8451014 · Cited by 14
Assignments to sheaves of pseudometric spaces
Robinson, M. (2020) · Compositionality · doi:10.32408/compositionality-2-2 · Cited by 14
Topological data analysis for true step detection in periodic piecewise constant signals
Khasawneh, F. A., & Munch, E. (2018) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2018.0027 · Cited by 23
Evaluating Movement Quality Through Intrapersonal Synchronization
Giorgis, N. D., Puppo, E., Alborno, P., & Camurri, A. (2019) · IEEE Transactions on Human-Machine Systems · doi:10.1109/thms.2019.2912498 · Cited by 14
Persistence Enhanced Graph Neural Network
Zhao, Q., Ye, Z., Chen, C., & Wang, Y. (2020) · International Conference on Artificial Intelligence and Statistics · Cited by 28
Homological Algebra of Modules over Posets
Miller, E. (2025) · SIAM Journal on Applied Algebra and Geometry · doi:10.1137/22m1516361 · Cited by 15
From Trees to Barcodes and Back Again: Theoretical and Statistical Perspectives
Kanari, L., Garin, A., & Hess, K. P. (2020) · Algorithms · doi:10.3390/a13120335 · Cited by 14
Model comparison via simplicial complexes and persistent homology
Vittadello, S. T., & Stumpf, M. P. H. (2021) · Royal Society Open Science · doi:10.1098/rsos.211361 · Cited by 15
Relationship between local coordinates and thermal conductivity in amorphous carbon
Minamitani, E., Shiga, T., Kashiwagi, M., et al. (2022) · Journal of Vacuum Science & Technology A Vacuum Surfaces and Films · doi:10.1116/6.0001744 · Cited by 14
Kunii, S., Foggiatto, A. L., Mitsumata, C., et al. (2022) · Science and Technology of Advanced Materials Methods · doi:10.1080/27660400.2022.2149037 · Cited by 14
Definition, Extraction, and Validation of Pore Structures in Porous Materials
Homberg, U., Baum, D., Wiebel, A., et al. (2014) · Mathematics and visualization · doi:10.1007/978-3-319-04099-8_15 · Cited by 14
Comparing Graphs via Persistence Distortion
Dey, T. K., Shi, D., & Wang, Y. (2015) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.socg.2015.491 · Cited by 14
Parametrized homology via zigzag persistence
Carlsson, G., de Silva, V., Kališnik, S., & Morozov, D. (2019) · Algebraic & Geometric Topology · doi:10.2140/agt.2019.19.657 · Cited by 23
Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps
Bennett, J. C., Pascucci, V., & Joy, K. I. (2007) · doi:10.1109/pg.2007.42 · Cited by 14
Topological Data Analysis for Discourse Semantics?
Savle, K., Zadrozny, W., & Lee, M. (2019) · doi:10.18653/v1/w19-0605 · Cited by 14
Inequalities for the Curvature of Curves and Surfaces
Narcowich, C.-S., & Edelsbrunner, H. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0200-3 · Cited by 14
Fekete, T. (2009) · Minds and Machines · doi:10.1007/s11023-009-9166-2 · Cited by 14
Testing contractibility in planar rips complexes
Chambers, E. W., Erickson, J., & Worah, P. (2008) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1377676.1377721 · Cited by 12
Combinatorial Koszul Homology: Computations and ApplicationsPreprint
Sáenz‐de‐Cabezón, E. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0803.0421 · Cited by 14
Quantitative toxicity prediction using topology based multi-task deep neural networksPreprint
Wu, K., & Wei, G. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.04339 · Cited by 14
Feature-Based Methods in 3D Shape Analysis
Bronstein, A. M., Bronstein, M. M., & Ovsjanikov, M. (2012) · Springer eBooks · doi:10.1007/978-1-4471-4063-4_5 · Cited by 13
Structural Analysis of Multivariate Point Clouds Using Simplicial Chains
Rieck, B., & Leitte, H. (2014) · Computer Graphics Forum · doi:10.1111/cgf.12398 · Cited by 12
Extraction of Dominant Extremal Structures in Volumetric Data Using Separatrix Persistence
Günther, D., Seidel, H., & Weinkauf, T. (2012) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2012.03222.x · Cited by 13
Dey, T. K., & Wang, Y. (2011) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1998196.1998230 · Cited by 12
Oudot, S., & Sheehy, D. R. (2013) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2462356.2462371 · Cited by 15
Weighted-Persistent-Homology-based Machine Learning for RNA Flexibility Analysis
Pun, C. S., Yong, B. Y. S., & Xia, K. (2019) · PLoS ONE · doi:10.1371/journal.pone.0237747 · Cited by 13
Approximation by interval-decomposables and interval resolutions of persistence modules
Asashiba, H., Escolar, E. G., Nakashima, K., & Yoshiwaki, M. (2023) · Journal of Pure and Applied Algebra · doi:10.1016/j.jpaa.2023.107397 · Cited by 13
Efficient Computation of a Hierarchy of Discrete 3D Gradient Vector Fields
Günther, D., Reininghaus, J., Prohaska, S., et al. (2011) · Mathematics and visualization · doi:10.1007/978-3-642-23175-9_2 · Cited by 13
Weak Index Pairs and the Conley Index for Discrete Multivalued Dynamical Systems
Batko, B., & Mrożek, M. (2016) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/15m1046691 · Cited by 13
Topological Descriptors for 3D Surface Analysis
Zeppelzauer, M., Zieliński, B., Juda, M., et al. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-39441-1_8 · Cited by 13
Limit Theorems for Random Cubical Homology
Hiraoka, Y., & Tsunoda, K. (2018) · Discrete & Computational Geometry · doi:10.1007/s00454-018-0007-z · Cited by 13
Quantitative Simplification of Filtered Simplicial Complexes
Mémoli, F., & Okutan, O. B. (2019) · Discrete & Computational Geometry · doi:10.1007/s00454-019-00104-y · Cited by 12
Dugast, M., Bouleux, G., Mory, O., & Marcon, É. (2018) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2018.2882748 · Cited by 13
Computing Persistent Homology with Various Coefficient Fields in a Single Pass
Boissonnat, J., & Maria, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44777-2_16 · Cited by 11
Dong, Z., Hu, C., Zhou, C., & Lin, H. (2020) · Computers & Graphics · doi:10.1016/j.cag.2020.05.029 · Cited by 13
Asymptotic behavior of lifetime sums for random simplicial complex processes
Hino, M., & Kanazawa, S. (2019) · Institutional Repositories DataBase (IRDB) · Cited by 13
Alluvial connectivity in multi‐channel networks in rivers and estuaries
Sonke, W., Kleinhans, M. G., Speckmann, B., et al. (2021) · Earth Surface Processes and Landforms · doi:10.1002/esp.5261 · Cited by 13
Interpreting Feature Tracking Through the Lens of Robustness
Škraba, P., & Wang, B. (2014) · Mathematics and visualization · doi:10.1007/978-3-319-04099-8_2 · Cited by 13
Multidimensional persistent homology is stable
Cerri, A., Fabio, B. D., Ferri, M., Frosini, P., & Landi, C. (2009) · AMS Acta (University of Bologna) · doi:10.6092/unibo/amsacta/2603 · Cited by 14
Volumetric data analysis using Morse-Smale complexes
Natarajan, V., & Pascucci, V. (2006) · doi:10.1109/smi.2005.50 · Cited by 13
Persistent Homology for The Quantitative Prediction of Fullerene StabilityPreprint
Xia, K., Feng, X., Tong, Y., et al. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.2369 · Cited by 13
Activation Landscapes as a Topological Summary of Neural Network Performance
Wheeler, M., Bouza, J., & Bubenik, P. (2021) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata52589.2021.9671368 · Cited by 15
Arfi, B. (2023) · Quality & Quantity · doi:10.1007/s11135-023-01708-6 · Cited by 14
Computing persistent homology within Coq/SSReflect
Heras, J., Coquand, T., Mörtberg, A., & Siles, V. (2013) · ACM Transactions on Computational Logic · doi:10.1145/2528929 · Cited by 16
Computing a discrete Morse gradient from a watershed decomposition
Čomić, L., Floriani, L. D., Iuricich, F., et al. (2016) · Computers & Graphics · doi:10.1016/j.cag.2016.05.020 · Cited by 12
Hyppo-X: A Scalable Exploratory Framework for Analyzing Complex Phenomics Data
Kamruzzaman, M., Kalyanaraman, A., Krishnamoorthy, B., Hey, S., & Schnable, P. S. (2019) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2019.2947500 · Cited by 12
Fast computation of persistent homology representatives with involuted persistent homology
Čufar, M., & Virk, Ž. (2023) · Foundations of Data Science · doi:10.3934/fods.2023006 · Cited by 13
Persistent homology of Z2 gauge theories
Sehayek, D., & Melko, R. G. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.085111 · Cited by 19
Damping parameter estimation using topological signal processing
Myers, A., & Khasawneh, F. A. (2022) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2022.109042 · Cited by 12
Topological Analysis of Temporal Hypergraphs
Myers, A., Joslyn, C., Kay, B., Purvine, E., Roek, G., & Shapiro, M. R. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-32296-9_9 · Cited by 15
Heterogeneous Graph Convolutional Neural Network via Hodge-Laplacian for Brain Functional Data
Huang, J., Chung, M. K., & Qiu, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-34048-2_22 · Cited by 14
A New Approximation Algorithm for the Matching Distance in Multidimensional Persistence
Cerri, A., & Frosini, P. (2020) · Journal of Computational Mathematics · doi:10.4208/jcm.1809-m2018-0043 · Cited by 11
A Topological Characterization of Protein Structure
Krishnamoorthy, B., Provan, S., & Tropsha, A. (2008) · Springer optimization and its applications · doi:10.1007/978-0-387-69319-4_22 · Cited by 12
The Persistent Morse Complex Segmentation of a 3-Manifold
Edelsbrunner, H., & Harer, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10470-1_4 · Cited by 12
Platt, D. E., Basu, S., Zalloua, P., et al. (2016) · BMC Systems Biology · doi:10.1186/s12918-015-0251-2 · Cited by 12
Persistent Homology in Image Processing
Edelsbrunner, H. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38221-5_19 · Cited by 12
Homberg, U., Baum, D., Prohaska, S., et al. (2012) · Cited by 12
Exploring generalized shape analysis by topological representations
Zhou, Z., Huang, Y., Wang, L., & Tan, T. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2016.04.002 · Cited by 12
Aggregation models on hypergraphs
Alberici, D., Contucci, P., Mingione, E., et al. (2016) · Annals of Physics · doi:10.1016/j.aop.2016.12.001 · Cited by 12
Geometric Learning and Topological Inference With Biobotic Networks
Dirafzoon, A., Bozkurt, A. Y., & Lobaton, E. J. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2623093 · Cited by 12
Bremer, P., Maljovec, D., Saha, A., Wang, B., Gaffney, J., Spears, B. K., & Pascucci, V. (2015) · Computing and Visualization in Science · doi:10.1007/s00791-015-0241-3 · Cited by 11
Tuning the performance of a computational persistent homology package
Hylton, A., Henselman‐Petrusek, G., Sang, J., & Short, R. (2019) · Software Practice and Experience · doi:10.1002/spe.2678 · Cited by 12
Multi-Scale Topological Analysis of Asymmetric Tensor Fields on Surfaces
Khan, F., Roy, L., Zhang, E., et al. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2019.2934314 · Cited by 12
Homological scaffold via minimal homology bases
Guerra, M., Gregorio, A. D., Fugacci, U., Petri, G., & Vaccarino, F. (2021) · Scientific Reports · doi:10.1038/s41598-021-84486-1 · Cited by 12
Topological Data Analysis of Vascular Disease: A Theoretical Framework
Nicponski, J., & Jung, J.-H. (2020) · Frontiers in Applied Mathematics and Statistics · doi:10.3389/fams.2020.00034 · Cited by 12
Cochain level May–Steenrod operations
Kaufmann, R. M., & Medina-Mardones, A. M. (2021) · Forum Mathematicum · doi:10.1515/forum-2020-0296 · Cited by 12
A Survey on the High Performance Computation of Persistent Homology
Malott, N. O., Chen, S., & Wilsey, P. A. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3147070 · Cited by 12
Bendich, P. L., Edelsbrunner, H., Morozov, D., & Patel, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15775-2_1 · Cited by 13
Ascending and descending regions of a discrete Morse function
Jerše, G., & Kosta, N. M. (2008) · Computational Geometry · doi:10.1016/j.comgeo.2008.11.001 · Cited by 12
Structure of the Afferent Terminals in Terminal Ganglion of a Cricket and Persistent Homology
Brown, J. D., & Gedeon, T. (2012) · PLoS ONE · doi:10.1371/journal.pone.0037278 · Cited by 12
Enabling Advanced Visualization Tools in a Web-Based Simulation Monitoring System
Santos, E., Tierny, J., Khan, A., et al. (2009) · IEEE International Conference on eScience · doi:10.1109/e-science.2009.57 · Cited by 12
Persistent Homology for Learning Densities with Bounded Support
Pokorny, F. T., Ek, C. H., Hedvig, E., & Kragic, K. D. (2012) · Cited by 11
Computing homology and persistent homology using iterated Morse decompositionPreprint
Dłotko, P., & Wagner, H. (2012) · arXiv (Cornell University) · doi:10.4230/lipics.socg.2018.54 · Cited by 13
Zomorodian, A. J., & Carlsson, G. (2007) · IEEE International Conference on Shape Modeling and Applications · doi:10.1109/smi.2007.25 · Cited by 12
Sketches of a platypus: a survey of persistent homology and its algebraic foundations
Vejdemo‐Johansson, M. (2014) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/620/12371 · Cited by 14
Broderick, S., Dongol, R., Zhang, T., & Rajan, K. (2021) · Scientific Reports · doi:10.1038/s41598-021-90070-4 · Cited by 12
Wang, G., Zhou, P., Gao, H., et al. (2024) · Physics in Medicine and Biology · doi:10.1088/1361-6560/ad0b63 · Cited by 11
Topological Neuroscience: Linking Circuits to Function
Curto, C., & Sanderson, N. (2025) · Annual Review of Neuroscience · doi:10.1146/annurev-neuro-112723-034315 · Cited by 17
Blumberg, A. J., Gal, I., Mandell, M. A., & Pancia, M. (2012) · Cited by 9
Robustness for 2D Symmetric Tensor Field Topology
Wang, B., & Hotz, I. (2017) · Mathematics and visualization · doi:10.1007/978-3-319-61358-1_1 · Cited by 11
Visualization of Topological Defect in Labyrinth Magnetic Domain by Using Persistent Homology
Yamada, T., Suzuki, Y., Mitsumata, C., et al. (2019) · Vacuum and Surface Science · doi:10.1380/vss.62.153 · Cited by 11
Scale-variant topological information for characterizing the structure of complex networks
Tran, Q. H., Vo, V. T., & Hasegawa, Y. (2019) · Physical review. E · doi:10.1103/physreve.100.032308 · Cited by 11
Busch, P., & White, S. D. M. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa572 · Cited by 11
Computing a Stable Distance on Merge Trees
Bollen, B., Tennakoon, P., & Levine, J. A. (2022) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2022.3209395 · Cited by 11
Morphological Hierarchies: A Unifying Framework with New Trees
Passat, N., Forte, J. M., & Kenmochi⋆, Y. (2023) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-023-01154-x · Cited by 11
Persistent Homology over Directed Acyclic Graphs
Chambers, E. W., & Letscher, D. (2018) · Association for Women in Mathematics series · doi:10.1007/978-3-319-89593-2_2 · Cited by 14
Improving homology estimates with random walks
Bendich, P. L., Galkovskyi, T., & Harer, J. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/12/124002 · Cited by 12
3D region segmentation using topological persistence
Beksi, W. J., & Papanikolopoulos, N. P. (2016) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2016.7759183 · Cited by 11
HodgeRank With Information Maximization for Crowdsourced Pairwise Ranking Aggregation
Xu, Q., Xiong, J., Chen, X., et al. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11619 · Cited by 11
Use of Topological Data Analysis in Motor Intention Based Brain-Computer Interfaces
Altindış, F., Yılmaz, B., Borisenok, S., & İçöz, K. (2018) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco.2018.8553382 · Cited by 12
Robust Extraction and Simplification of 2D Symmetric Tensor Field Topology
Jankowai, J., Wang, B., & Hotz, I. (2019) · Computer Graphics Forum · doi:10.1111/cgf.13693 · Cited by 11
Akai, N., Hirayama, T., & Murase, H. (2021) · Neural Networks · doi:10.1016/j.neunet.2021.05.007 · Cited by 14
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
