Research map / Graph learning / Graph algorithms and clustering
Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunIT
Cuneyt Gurcan Akcora, Murat Kantarcioglu, Yulia Gel, Baris Coskunuzer
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Prune dominated vertices before persistence computation | PrunIT · Email-Enron | computation time (sec), step size 4: 7014 -> 1412 | Improved |
| Prune dominated vertices before persistence computation | PrunIT · Email-Enron | computation time (sec), step size 12: 2520 -> 513 | Improved |
| Prune dominated vertices before persistence computation | PrunIT · Email-Enron | simplex count (million), step size 4: 465.2 -> 270.2 | Improved |
| Prune dominated vertices before persistence computation | PrunIT · Email-Enron | simplex count (million), step size 12: 155.8 -> 90.7 | Improved |
| Apply PrunIT to the 1-hop ego networks | OGB-ARXIV · OGB-ARXIV 1-hop ego networks | 0-dimensional persistence computation time reduction: 37% | Improved |
| Apply PrunIT to the 1-hop ego networks | OGB-MAG · OGB-MAG 1-hop ego networks | 0-dimensional persistence computation time reduction: 23% | Improved |
| Use CoralTDA core reduction | CoralTDA · FACEBOOK and TWITTER | computation time reduction | Hurt |
| Use CoralTDA core reduction | CoralTDA · OHSU | computation time reduction: at most 25% | Improved |
| Use PrunIT dominated-vertex reduction | PrunIT · FIRSTMM and SYNNEW | vertex reduction: less than 10% | Hurt |
| Use PrunIT dominated-vertex reduction | PrunIT · Other graph-classification datasets | vertex reduction: at least 35% | Improved |
| Use CoralTDA to reduce the graph to the (k+1)-core | CoralTDA · Graph and node classification datasets, higher-dimensional persistence | vertex reduction: 25%-75% | Improved |
| Use CoralTDA to reduce the graph to the (k+1)-core | CoralTDA · 10 graph and node classification datasets, k=4 and k=5 | vertex reduction: 100% | Improved |
Closest papers by meaning
- Persistence weighted Gaussian kernel for topological data analysis (ICML 2016 · similarity 0.89)
- A Class of Topological Pseudodistances for Fast Comparison of Persistence Diagrams (AAAI 2024 · similarity 0.87)
- ToMAToMP: Robust and Multi-Parameter Topological Clustering (NeurIPS 2026 · similarity 0.87)
- Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis (AAAI 2024 · similarity 0.87)
- Incremental Topological Ordering and Cycle Detection with Predictions (ICML 2024 · similarity 0.87)
- TopER: Topological Embeddings in Graph Representation Learning (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
