Persistent Homology and Graphs Representation Learning
Not on the map. Why?
Abstract (arXiv)
This article aims to study the topological invariant properties encoded in node graph representational embeddings by utilizing tools available in persistent homology. Specifically, given a node embedding representation algorithm, we consider the case when these embeddings are real-valued. By viewing these embeddings as scalar functions on a domain of interest, we can utilize the tools available in persistent homology to study the topological information encoded in these representations. Our construction effectively defines a unique persistence-based graph descriptor, on both the graph and node levels, for every node representation algorithm. To demonstrate the effectiveness of the proposed method, we study the topological descriptors induced by DeepWalk, Node2Vec and Diff2Vec.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 15 of its 44 references that are in the map. First posted on arXiv 25 Feb 2021.
Builds on
15 of 44 references.
References · 15
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2017Representation Learning on Graphs: Methods and Applicationscited by 456
- 2017Network Representation Learning: A Surveycited by 101
- 2019Graph Representation Learning: A Surveycited by 75
- 2020Cell Complex Neural Networkscited by 66
- 2016Beyond Deep Residual Learning for Image Restoration: Persistent Homology-Guided Manifold Simplificationcited by 22
- 2018Functional Summaries of Persistence Diagramscited by 19
- 2020Fast Sequence-Based Embedding with Diffusion Graphscited by 14
- 2021TDA-Net: Fusion of Persistent Homology and Deep Learning Features for COVID-19 Detection in Chest X-Ray Imagescited by 12
- 2017Visual Detection of Structural Changes in Time-Varying Graphs Using Persistent Homologycited by 8
Built on by
Citing papers per year: 2022: 3; 2023: 0; 2024: 1; 2025: 1.
5 papers.
- 2024Demystifying Higher-Order Graph Neural Networkscited by 4
- 2022On the Surprising Behaviour of node2veccited by 2
- 2022Reliable Malware Analysis and Detection using Topology Data Analysiscited by 1
- 2022Alleviating neighbor bias: augmenting graph self-supervise learning with structural equivalent positive samplescited by 1
- 2025Positional Encoding meets Persistent Homology on Graphscited by 1
- 2025Positional Encoding meets Persistent Homology on Graphs6 Jun 2025
- 2024Demystifying Higher-Order Graph Neural Networks18 Jun 2024
- 2022Alleviating neighbor bias: augmenting graph self-supervise learning with structural equivalent positive samples8 Dec 2022
- 2022Reliable Malware Analysis and Detection using Topology Data Analysis3 Nov 2022
- 2022On the Surprising Behaviour of node2vec16 Jun 2022