Node Proximity Is All You Need: Unified Structural and Positional Node and Graph Embedding
Not on the map. Why?
Abstract (arXiv)
While most network embedding techniques model the relative positions of nodes in a network, recently there has been significant interest in structural embeddings that model node role equivalences, irrespective of their distances to any specific nodes. We present PhUSION, a proximity-based unified framework for computing structural and positional node embeddings, which leverages well-established methods for calculating node proximity scores. Clarifying a point of contention in the literature, we show which step of PhUSION produces the different kinds of embeddings and what steps can be used by both. Moreover, by aggregating the PhUSION node embeddings, we obtain graph-level features that model information lost by previous graph feature learning and kernel methods. In a comprehensive empirical study with over 10 datasets, 4 tasks, and 35 methods, we systematically reveal successful design choices for node and graph-level machine learning with embeddings.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 11 of its 28 references that are in the map. First posted on arXiv 26 Feb 2021.
Builds on
11 of 28 references.
References · 11
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
- 2017struc2vec: Learning Node Representations from Structural Identitycited by 214
- 2017Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2veccited by 197
- 2017Graph Embedding Techniques, Applications, and Performance: A Surveycited by 188
- 2020Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Modelscited by 116
- 2017Learning Structural Node Embeddings Via Diffusion Waveletscited by 97
- 2018NetLSD: Hearing the Shape of a Graphcited by 51
- 2018REGAL: Representation Learning-based Graph Alignmentcited by 40
- 2018RetGK: Graph Kernels based on Return Probabilities of Random Walkscited by 32
- 2020InfiniteWalk: Deep Network Embeddings as Laplacian Embeddings with a Nonlinearitycited by 19
- 2013DELTACON: A Principled Massive-Graph Similarity Functioncited by 17
Built on by
Citing papers per year: 2022: 3; 2023: 2; 2024: 2; 2025: 1; 2026: 1.
9 papers.
- 2022Geodesic Graph Neural Network for Efficient Graph Representation Learningcited by 19
- 2023Causal Lifting and Link Predictioncited by 5
- 2024Generating Human Understandable Explanations for Node Embeddingscited by 2
- 2025Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregationcited by 2
- 2022Digraphwave: Scalable Extraction of Structural Node Embeddings via Diffusion on Directed Graphscited by 1
- 2023Fisher Information Embedding for Node and Graph Learningcited by 1
- 2024Augmenting Textual Generation via Topology Aware Retrievalcited by 1
- 2022Associative Learning for Network Embeddingcited by 0
- 2026Topology-induced Operators Reveal Complementary Graph Representations without Trainingcited by 0
- 2026Topology-induced Operators Reveal Complementary Graph Representations without Training8 Sep 2026
- 2025Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation27 May 2025
- 2024Generating Human Understandable Explanations for Node Embeddings11 Jun 2024
- 2024Augmenting Textual Generation via Topology Aware Retrieval27 May 2024
- 2023Fisher Information Embedding for Node and Graph Learning12 May 2023
- 2023Causal Lifting and Link Prediction2 Feb 2023
- 2022Geodesic Graph Neural Network for Efficient Graph Representation Learning6 Oct 2022
- 2022Associative Learning for Network Embedding30 Aug 2022
- 2022Digraphwave: Scalable Extraction of Structural Node Embeddings via Diffusion on Directed Graphs20 Jul 2022