Inverse Problems · 2011 · 11 citations · 14 references
Natural SciencesMathematicsComputational GeometryStatisticsTopologyComputational TopologyGraph TheoryHomology TheoryRandom WalksTopological ModelingHomologyPersistence MetricsPersistent HomologyTopological AnalysisTopological Feature ExtractionTopological FeaturesTopological HomologyTopological Persistence Diagrams
This experimental paper makes the case for a new approach to the use of persistent homology in the study of shape and feature in datasets. By introducing ideas from diffusion geometry and random walks, we discover that homological features can be enhanced and more effectively extracted from spaces that are sampled densely and evenly, and with a small amount of noise. This study paves the way for a more theoretical analysis of how random walk metrics affect persistence diagrams, and provides evidence that combining topological data analysis with techniques inspired by diffusion geometry holds great promise for new analyses of a wide variety of datasets.
14
Algorithm 457: finding all cliques of an undirected graph
Coen Bron, Joep Kerbosch · Communications of the ACM · 1973 · 2.5K citations · Full text
Ronald R. Coifman, Stéphane Lafon · Applied and Computational Harmonic Analysis · 2006 · 2.3K citations
Topological Persistence and Simplification
Edelsbrunner, Letscher, Zomorodian · Discrete & Computational Geometry · 2002 · 1.8K citations · Full text