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
0 of 8 cited sources checked · 0 supported · 0 flagged
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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesA 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearA 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes
- 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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).
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Strength:hedged· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Load-bearingStrength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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).
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Strength:hedged· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✗ Based: failsProbably 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes? Based: unclearIt 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
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.
Induced homology maps are described as injective despite cycle deaths
MinorAn injective map from an earlier homology group cannot send one of its nonzero classes to zero. The paper also says that later negative simplices cancel classes created earlier, so the homology maps it describes cannot generally be injective.
“The p-persistent homology groups can also be defined using injective homomorphisms between ordinary homology groups.”
“Note that as we increase p, negative simplices cancel positive simplices earlier in the filtration.”
One reported average list length exceeds average persistence
MinorFor G's 2-cycles, Table 4 gives an average list length of 4.86, while Table 5 gives an average persistence of 4.47. Thus the stated comparison does not hold for that dataset and cycle dimension.
“Table 5 shows that the average persistence is considerably larger than the average number of collisions and list length.”
“| 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
Flagged first, then by citations
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 101–200 of 1,811
The topology of the cosmic web in terms of persistent Betti numbers
Pranav, P., Edelsbrunner, H., van de Weygaert, R., Vegter, G., Kerber, M., Jones, B. J. T., & Wintraecken, M. (2016) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stw2862 · Cited by 118
Perea, J. A., Deckard, A., Haase, S. B., & Harer, J. (2015) · BMC Bioinformatics · doi:10.1186/s12859-015-0645-6 · Cited by 116
Topological volume skeletonization and its application to transfer function design
Takahashi, S., Takeshima, Y., & Fujishiro, I. (2003) · Graphical Models · doi:10.1016/j.gmod.2003.08.002 · Cited by 118
Unsupervised Trajectory Segmentation for Surgical Gesture Recognition in Robotic Training
Despinoy, F., Bouget, D., Forestier, G., et al. (2015) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2015.2493100 · Cited by 116
Categorification of Persistent HomologyPreprint
Bubenik, P., Jonathan, & Scott, A. (2016) · Cited by 124
MolAxis: Efficient and accurate identification of channels in macromolecules
Yaffe, E., Fishelovitch, D., Wolfson, H. J., et al. (2008) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.22052 · Cited by 115
Persistence weighted Gaussian kernel for topological data analysisPreprint
Kusano, G., Fukumizu, K., & Hiraoka, Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.01741 · Cited by 120
Persistent homology for the quantitative prediction of fullerene stability
Xia, K., Feng, X., Tong, Y., & Wei, G. W. (2014) · Journal of Computational Chemistry · doi:10.1002/jcc.23816 · Cited by 96
Efficient Computation of Persistent Homology for Cubical Data
Wagner, H., Chen, C., & Vuçını, E. (2011) · Mathematics and visualization · doi:10.1007/978-3-642-23175-9_7 · Cited by 112
Persistence-based segmentation of deformable shapes
Škraba, P., Ovsjanikov, M., Chazal, F., & Guibas, L. J. (2010) · 2009 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops · doi:10.1109/cvprw.2010.5543285 · Cited by 115
Surface Reconstruction by Wrapping Finite Sets in Space
Edelsbrunner, H. (2003) · Algorithms and combinatorics · doi:10.1007/978-3-642-55566-4_17 · Cited by 111
Stable Topological Signatures for Points on 3D Shapes
Carrière, M., Oudot, S., & Ovsjanikov, M. (2015) · Computer Graphics Forum · doi:10.1111/cgf.12692 · Cited by 109
Distributed Computation of Persistent Homology
Bauer, U., Kerber, M., & Reininghaus, J. (2013) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973198.4 · Cited by 111
Extending Persistence Using Poincaré and Lefschetz Duality
Cohen‐Steiner, D., Edelsbrunner, H., & Harer, J. (2008) · Foundations of Computational Mathematics · doi:10.1007/s10208-008-9027-z · Cited by 124
Geometric and Topological Inference
Boissonnat, J., Chazal, F., & Yvinec, M. (2017) · HAL · Cited by 109
MathDL: mathematical deep learning for D3R Grand Challenge 4
Nguyen, D. D., Gao, K., Wang, M., & Wei, G. (2019) · Journal of Computer-Aided Molecular Design · doi:10.1007/s10822-019-00237-5 · Cited by 105
Patania, A., Vaccarino, F., & Petri, G. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0104-x · Cited by 106
Computing Topological Persistence for Simplicial Maps
Dey, T. K., Fan, F., & Wang, Y. (2014) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2582112.2582165 · Cited by 118
Urban Pulse: Capturing the Rhythm of Cities
Miranda, F., Doraiswamy, H., Lage, M., Zhao, K., Gonçalves, B., Wilson, L., Hsieh, M., & Silva, C. T. (2016) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2598585 · Cited by 106
Current and future directions in network biology
Žitnik, M., Li, M. M., Wells, A., Glass, K., Gysi, D. M., Krishnan, A., Murali, T. M., Predrag Radivojac, A., Roy, S., Baudot, A., et al. (2024) · Bioinformatics Advances · doi:10.1093/bioadv/vbae099 · Cited by 128
Topology-Based Kernels With Application to Inference Problems in Alzheimer's Disease
Pachauri, D., Chris Hinrichs, A., Chung, M. K., Johnson, S. C., & Singh, V. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2011.2147327 · Cited by 96
Persistent Homology for Path Planning in Uncertain Environments
Bhattacharya, S., Ghrist, R., & Kumar, V. (2015) · IEEE Transactions on Robotics · doi:10.1109/tro.2015.2412051 · Cited by 105
Persistent homology of complex networks for dynamic state detection
Myers, A., Munch, E., & Khasawneh, F. A. (2019) · Physical review. E · doi:10.1103/physreve.100.022314 · Cited by 105
Computing geometry-aware handle and tunnel loops in 3D models
Dey, T. K., Li, K., Sun, J. Z., et al. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360644 · Cited by 102
Cang, Z., & Wei, G. (2017) · Computer applications in the biosciences · doi:10.1093/bioinformatics/btx460 · Cited by 95
Oyama, A., Hiraoka, Y., Obayashi, I., Saikawa, Y., Furui, S., Shiraishi, K., Kumagai, S., Hayashi, T., & Kotoku, J. (2019) · Scientific Reports · doi:10.1038/s41598-019-45283-z · Cited by 100
Wu, K., Zhao, Z., Wang, R., & Wei, G. (2018) · Journal of Computational Chemistry · doi:10.1002/jcc.25213 · Cited by 101
Topological Landscapes: A Terrain Metaphor for Scientific Data
Weber, G. H., Bremer, P., & Pascucci, V. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70601 · Cited by 101
Majumdar, S., & Laha, A. K. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113868 · Cited by 99
Measuring Distance between Reeb Graphs
Bauer, U., Ge, X., & Wang, Y. (2014) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/2582112.2582169 · Cited by 115
Reeb spaces of piecewise linear mappings
Edelsbrunner, H., Harer, J., & Patel, A. (2008) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1377676.1377720 · Cited by 98
Topology-based Simplification for Feature Extraction from 3D Scalar Fields
Gyulassy, A. G., Natarajan, V., Pascucci, V., Bremer, P., & Bernd Hamann, A. (2006) · doi:10.1109/vis.2005.106 · Cited by 96
Persistent Cohomology and Circular Coordinates
de Silva, V., Morozov, D., & Vejdemo‐Johansson, M. (2011) · Discrete & Computational Geometry · doi:10.1007/s00454-011-9344-x · Cited by 98
Interactive Visualization of 2-D Persistence ModulesPreprint
Lesnick, M., & Wright, M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.00180 · Cited by 93
Categorification of Persistent Homology
Bubenik, P., & Scott, J. A. (2014) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9573-x · Cited by 139
On the stability of persistent entropy and new summary functions for topological data analysis
Atienza, N., González-Dı́az, R., & Soriano-Trigueros, M. (2020) · Pattern Recognition · doi:10.1016/j.patcog.2020.107509 · Cited by 93
Characterizing Molecular Interactions in Chemical Systems
Günther, D., Boto, R. A., Contreras‐García, J., et al. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2014.2346403 · Cited by 95
A topological approach for protein classification
Cang, Z., Mu, L., Wu, K., Opron, K., Xia, K., & Wei, G.-W. (2015) · Computational and Mathematical Biophysics · doi:10.1515/mlbmb-2015-0009 · Cited by 93
Using persistent homology and dynamical distances to analyze protein binding
Kovacev-Nikolic, V., Bubenik, P., Nikolić, D., & Heo, G. (2016) · Statistical Applications in Genetics and Molecular Biology · doi:10.1515/sagmb-2015-0057 · Cited by 116
Extreme Elevation on a 2-Manifold
Agarwal, P. K., Edelsbrunner, H., Harer, J., & Wang, Y. (2006) · Discrete & Computational Geometry · doi:10.1007/s00454-006-1265-8 · Cited by 90
Topological data analysis of single-trial electroencephalographic signals
Wang, Y., Ombao, H., & Chung, M. K. (2018) · The Annals of Applied Statistics · doi:10.1214/17-aoas1119 · Cited by 91
Coreduction Homology Algorithm
Mrożek, M., & Batko, B. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9073-y · Cited by 90
Persistent-Homology-Based Machine Learning and Its Applications -- A SurveyPreprint
Pun, C. S., Xia, K., & Lee, S. X. (2018) · SSRN Electronic Journal · doi:10.2139/ssrn.3275996 · Cited by 89
Zomorodian, A., & Carlsson, G. (2008) · Computational Geometry · doi:10.1016/j.comgeo.2008.02.003 · Cited by 89
Qiu, Y., & Wei, G. (2023) · Briefings in Bioinformatics · doi:10.1093/bib/bbad289 · Cited by 90
HodgeRank on Random Graphs for Subjective Video Quality Assessment
Xu, Q., Huang, Q., Jiang, T., et al. (2012) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2012.2190924 · Cited by 88
Multidimensional Size Functions for Shape Comparison
Biasotti, S., Cerri, A., Frosini, P., Giorgi, D., & Landi, C. (2008) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-008-0096-z · Cited by 86
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
Dey, T. K., Hirani, A. N., & Krishnamoorthy, B. (2011) · SIAM Journal on Computing · doi:10.1137/100800245 · Cited by 88
Topological phase transitions in functional brain networks
Santos, F. A. N., Raposo, E. P., Coutinho-Filho, M. D., Copelli, M., Stam, C. J., & Douw, L. (2019) · Physical review. E · doi:10.1103/physreve.100.032414 · Cited by 85
Persistent Homology Computation with a Twist
Chen, C., & Kerber, M. (2011) · Cited by 87
Linear-Size Approximations to the Vietoris–Rips Filtration
Sheehy, D. R. (2013) · Discrete & Computational Geometry · doi:10.1007/s00454-013-9513-1 · Cited by 102
Multidimensional persistence in biomolecular data
Xia, K., & Wei, G. (2015) · Journal of Computational Chemistry · doi:10.1002/jcc.23953 · Cited by 74
Functional summaries of persistence diagrams
Berry, E., Chen, Y., Cisewski-Kehe, J., & Fasy, B. T. (2020) · Journal of Applied and Computational Topology · doi:10.1007/s41468-020-00048-w · Cited by 87
Persistent homology analysis of phase transitions
Donato, I., Gori, M., Pettini, M., Petri, G., de Nigris, S., Franzosi, R., & Vaccarino, F. (2016) · Physical review. E · doi:10.1103/physreve.93.052138 · Cited by 81
Natural Pseudo-Distance and Optimal Matching between Reduced Size Functions
d’Amico, M., Frosini, P., & Landi, C. (2008) · Acta Applicandae Mathematicae · doi:10.1007/s10440-008-9332-1 · Cited by 84
Generating Discrete Morse Functions from Point Data
King, H., KNUDSON, K. P., & Mramor, N. (2005) · Experimental Mathematics · doi:10.1080/10586458.2005.10128941 · Cited by 83
Persistent Cohomology and Circular CoordinatesPreprint
de Silva, V., Morozov, D., & Vejdemo‐Johansson, M. (2009) · Cited by 83
Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web
van de Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B. J. T., Pranav, P., Park, C., Hellwing, W. A., Eldering, B., Kruithof, N., Bos, E. G. P., et al. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25249-5_3 · Cited by 84
A topological approach to simplification of three-dimensional scalar functions
Gyulassy, A. G., Natarajan, V., Pascucci, V., Bremer, P., & Bernd Hamann, A. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.57 · Cited by 81
Characterisation of the Idiotypic Immune Network Through Persistent Entropy
Rucco, M., Castiglione, F., Merelli, E., & Pettini, M. (2016) · Springer proceedings in complexity · doi:10.1007/978-3-319-29228-1_11 · Cited by 80
Yan, L., Masood, T. B., Sridharamurthy, R., Rasheed, F., Natarajan, V., Hotz, I., & Wang, B. (2021) · Computer Graphics Forum · doi:10.1111/cgf.14331 · Cited by 101
Morse complexes for shape segmentation and homological analysis: discrete models and algorithms
Floriani, L. D., Fugacci, U., Iuricich, F., & Magillo, P. (2015) · Computer Graphics Forum · doi:10.1111/cgf.12596 · Cited by 79
Felix: A Topology Based Framework for Visual Exploration of Cosmic Filaments
Shivashankar, N., Pranav, P., Natarajan, V., et al. (2015) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2015.2452919 · Cited by 81
Limit theorems for persistence diagrams
Hiraoka, Y., Shirai, T., & Trinh, K. D. (2018) · The Annals of Applied Probability · doi:10.1214/17-aap1371 · Cited by 81
Blumberg, A. J., Gal, I., Mandell, M. A., & Pancia, M. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9201-4 · Cited by 94
Topological methods for data modelling
Carlsson, G. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-00249-3 · Cited by 85
Clear and Compress: Computing Persistent Homology in Chunks
Bauer, U., Kerber, M., & Reininghaus, J. (2014) · Mathematics and visualization · doi:10.1007/978-3-319-04099-8_7 · Cited by 81
Persistent Homology in Sparse Regression and Its Application to Brain Morphometry
Chung, M. K., Hanson, J. L., Ye, J., Davidson, R. J., & Pollak, S. D. (2014) · Cited by 77
Automatic extraction of surface structures in digital shape reconstruction
Várady, T., Facello, M. A., & Terék, Z. (2007) · Computer-Aided Design · doi:10.1016/j.cad.2007.02.011 · Cited by 78
Persistence-sensitive simplification functions on 2-manifolds
Edelsbrunner, H., Morozov, D., & Pascucci, V. (2006) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1137856.1137878 · Cited by 75
Generalized persistence diagrams
Patel, A. (2018) · Journal of Applied and Computational Topology · doi:10.1007/s41468-018-0012-6 · Cited by 89
Topological Persistence for Relating Microstructure and Capillary Fluid Trapping in Sandstones
Herring, A. L., Robins, V., & Sheppard, A. P. (2018) · Water Resources Research · doi:10.1029/2018wr022780 · Cited by 76
Online crowdsourcing subjective image quality assessment
Xu, Q., Huang, Q., & Yao, Y. (2012) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/2393347.2393400 · Cited by 74
Persistent homology analysis of craze formation
Ichinomiya, T., Obayashi, I., & Hiraoka, Y. (2017) · Physical review. E · doi:10.1103/physreve.95.012504 · Cited by 75
Ismail, M. S., Noorani, M. S. M., Ismail, M., Razak, F. A., & Alias, M. A. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2020.106422 · Cited by 74
Robins, V., Saadatfar, M., Delgado‐Friedrichs, O., et al. (2015) · Water Resources Research · doi:10.1002/2015wr017937 · Cited by 75
Weighted persistent homology for biomolecular data analysis
Meng, Z., Anand, D. V., Lu, Y., Wu, J., & Xia, K. (2020) · Scientific Reports · doi:10.1038/s41598-019-55660-3 · Cited by 74
Günther, D., Reininghaus, J., Wagner, H., et al. (2012) · The Visual Computer · doi:10.1007/s00371-012-0726-8 · Cited by 73
CHEXVIS: a tool for molecular channel extraction and visualization
Masood, T. B., Sandhya, S., Chandra, N. R., & Natarajan, V. (2015) · BMC Bioinformatics · doi:10.1186/s12859-015-0545-9 · Cited by 73
Towards a computational theory of experience
Fekete, T., & Edelman, S. (2011) · Consciousness and Cognition · doi:10.1016/j.concog.2011.02.010 · Cited by 72
Volume-Optimal Cycle: Tightest Representative Cycle of a Generator in Persistent Homology
Obayashi, I. (2018) · SIAM Journal on Applied Algebra and Geometry · doi:10.1137/17m1159439 · Cited by 72
Topological feature engineering for machine learning based halide perovskite materials design
Anand, D. V., Xu, Q., Wee, J., Xia, K., & Sum, T. C. (2022) · npj Computational Materials · doi:10.1038/s41524-022-00883-8 · Cited by 72
Metrics for comparing neuronal tree shapes based on persistent homology
Li, Y., Wang, D., Ascoli, G. A., Mitra, P. P., & Wang, Y. (2017) · PLoS ONE · doi:10.1371/journal.pone.0182184 · Cited by 73
Inference of Ancestral Recombination Graphs through Topological Data Analysis
Cámara, P. G., Levine, A. J., & Rabadán, R. (2016) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1005071 · Cited by 71
Aggradation and carbonate accumulation of Holocene Norwegian cold‐water coral reefs
Titschack, J., Baum, D., Pol-Holz, R. H. D., Correa, M. L., Förster, N., Flögel, S., Hebbeln, D., & Freiwald, A. (2015) · Sedimentology · doi:10.1111/sed.12206 · Cited by 72
Persistent Homology in Sparse Regression and Its Application to Brain Morphometry
Chung, M. K., Hanson, J. L., Ye, J., Davidson, R. J., & Pollak, S. D. (2015) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2015.2416271 · Cited by 87
Parallel Computation of 3D Morse‐Smale Complexes
Shivashankar, N., & Natarajan, V. (2012) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2012.03089.x · Cited by 71
Separatrix Persistence: Extraction of Salient Edges on Surfaces Using Topological Methods
Weinkauf, T., & Günther, D. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01528.x · Cited by 70
Krishnapriyan, A. S., Montoya, J. H., Harańczyk, M., Hummelshøj, J. S., & Morozov, D. (2021) · Scientific Reports · doi:10.1038/s41598-021-88027-8 · Cited by 76
Chazal, F., & Lieutier, A. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064132 · Cited by 67
Manifold reconstruction in arbitrary dimensions using witness complexes
Boissonnat, J., Guibas, L. J., & Oudot, S. (2007) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1247069.1247106 · Cited by 68
Using Topological Analysis to Support Event-Guided Exploration in Urban Data
Doraiswamy, H., Júnior, N. R. F., Damoulas, T., Freire, J., & Silva, C. T. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2014.2346449 · Cited by 68
Simplicial complexes and complex systems
Salnikov, V., Cassese, D., & Lambiotte, R. (2019) · Apollo (University of Cambridge) · doi:10.17863/cam.56775 · Cited by 63
Exploring uses of persistent homology for statistical analysis of landmark-based shape data
Gamble, J., & Heo, G. (2010) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2010.04.016 · Cited by 68
Parallel Computation of 2D Morse-Smale Complexes
Shivashankar, N., Senthilnathan, M., & Natarajan, V. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.284 · Cited by 68
Inferring Local Homology from Sampled Stratified Spaces
Bendich, P. L., Cohen‐Steiner, D., Edelsbrunner, H., Harer, J., & Morozov, D. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.45 · Cited by 68
Topological data analysis of task-based fMRI data from experiments on schizophrenia
Stolz, B. J., Emerson, T., Nahkuri, S., Porter, M. A., & Harrington, H. A. (2021) · Journal of Physics Complexity · doi:10.1088/2632-072x/abb4c6 · Cited by 70
Optimal topological simplification of discrete functions on surfaces
Bauer, U., Lange, C., & Wardetzky, M. (2012) · Cited by 67
Robins, V., & Turner, K. (2016) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2016.03.007 · Cited by 68
Exact topological inference of the resting-state brain networks in twins
Chung, M. K., Lee, H., DiChristofano, A., Ombao, H., & Solo, V. (2019) · Network Neuroscience · doi:10.1162/netn_a_00091 · Cited by 64
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
