Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunIT

arXiv2211.13708MaRDI QIDQ6418386

Author name not available (Why is that?)

Publication date: 24 November 2022

Abstract: Topological data analysis (TDA) delivers invaluable and complementary information on the intrinsic properties of data inaccessible to conventional methods. However, high computational costs remain the primary roadblock hindering the successful application of TDA in real-world studies, particularly with machine learning on large complex networks. Indeed, most modern networks such as citation, blockchain, and online social networks often have hundreds of thousands of vertices, making the application of existing TDA methods infeasible. We develop two new, remarkably simple but effective algorithms to compute the exact persistence diagrams of large graphs to address this major TDA limitation. First, we prove that $(k+1)$-core of a graph $mathcalG$ suffices to compute its $k^{th}$ persistence diagram, $P{D}_k(mathcalG)$. Second, we introduce a pruning algorithm for graphs to compute their persistence diagrams by removing the dominated vertices. Our experiments on large networks show that our novel approach can achieve computational gains up to 95%. The developed framework provides the first bridge between the graph theory and TDA, with applications in machine learning of large complex networks. Our implementation is available at https://github.com/cakcora/PersistentHomologyWithCoralPrunit

Has companion code repository: https://github.com/cakcora/PersistentHomologyWithCoralPrunit

Mathematics Subject Classification ID

No records found.

This page was built for publication: Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunIT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418386)