Residual2Vec: Debiasing graph embedding with random graphs
Not on the map. Why?
Abstract (arXiv)
Graph embedding maps a graph into a convenient vector-space representation for graph analysis and machine learning applications. Many graph embedding methods hinge on a sampling of context nodes based on random walks. However, random walks can be a biased sampler due to the structural properties of graphs. Most notably, random walks are biased by the degree of each node, where a node is sampled proportionally to its degree. The implication of such biases has not been clear, particularly in the context of graph representation learning. Here, we investigate the impact of the random walks' bias on graph embedding and propose residual2vec, a general graph embedding method that can debias various structural biases in graphs by using random graphs. We demonstrate that this debiasing not only improves link prediction and clustering performance but also allows us to explicitly model salient structural properties in graph embedding.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 24 of its 77 references that are in the map. First posted on arXiv 14 Oct 2021.
Builds on
24 of 77 references.
References · 24
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2016Man is to Computer Programmer as Woman is to Homemaker? Debiasing Word Embeddingscited by 1,304
- 2017A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applicationscited by 260
- 2017Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2veccited by 197
- 2015Censoring Representations with an Adversarycited by 191
- 2013Consistency of spectral clustering in stochastic block modelscited by 128
- 2019Compositional Fairness Constraints for Graph Embeddingscited by 126
12 more
- 2019DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classificationcited by 59
- 2019Understanding Undesirable Word Embedding Associationscited by 59
- 2018Towards Understanding Linear Word Analogiescited by 57
- 2016Random walks and diffusion on networkscited by 28
- 2014Notes on Noise Contrastive Estimation and Negative Samplingcited by 26
- 2021Frequency-based Distortions in Contextualized Word Embeddingscited by 19
- 2016Configuring Random Graph Models with Fixed Degree Sequencescited by 15
- 2016Variational Perspective on Local Graph Clusteringcited by 14
- 2014Identification of core-periphery structure in networkscited by 11
- 2017Learning Edge Representations via Low-Rank Asymmetric Projectionscited by 7
- 2019Statistical guarantees for local graph clusteringcited by 6
- 2017LASAGNE: Locality And Structure Aware Graph Node Embeddingcited by 3
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 3; 2024: 3; 2025: 3; 2026: 1.
11 papers.
- 2023On Generalized Degree Fairness in Graph Neural Networkscited by 28
- 2023Toward Degree Bias in Embedding-Based Knowledge Graph Completioncited by 17
- 2023A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directionscited by 15
- 2021Implications of Topological Imbalance for Representation Learning on Biomedical Knowledge Graphscited by 11
- 2024A Survey of Few-Shot Learning on Graphs: from Meta-Learning to Pre-Training and Prompt Learningcited by 5
- 2024Robustness of shallow graph embedding methods for community detectioncited by 3
- 2024MS-IMAP -- A Multi-Scale Graph Embedding Approach for Interpretable Manifold Learningcited by 1
- 2025Learning Graph Node Embeddings by Smooth Pair Samplingcited by 0
- 2025FairACE: Achieving Degree Fairness in Graph Neural Networks via Contrastive and Adversarial Group-Balanced Trainingcited by 0
- 2025Mitigating Degree Bias in Graph Representation Learning with Learnable Structural Augmentation and Structural Self-Attentioncited by 0
- 2026Fairness-Aware Network Embeddings: Methods, Applications, and Challengescited by 0
- 2026Fairness-Aware Network Embeddings: Methods, Applications, and Challenges19 Aug 2026
- 2025Mitigating Degree Bias in Graph Representation Learning with Learnable Structural Augmentation and Structural Self-Attention21 Apr 2025
- 2025FairACE: Achieving Degree Fairness in Graph Neural Networks via Contrastive and Adversarial Group-Balanced Training12 Apr 2025
- 2025Learning Graph Node Embeddings by Smooth Pair Sampling22 Jan 2025
- 2024MS-IMAP -- A Multi-Scale Graph Embedding Approach for Interpretable Manifold Learning4 Jun 2024
- 2024Robustness of shallow graph embedding methods for community detection1 May 2024
- 2024A Survey of Few-Shot Learning on Graphs: from Meta-Learning to Pre-Training and Prompt Learning2 Feb 2024
- 2023A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and Future Directions26 Aug 2023
- 2023Toward Degree Bias in Embedding-Based Knowledge Graph Completion10 Feb 2023
- 2023On Generalized Degree Fairness in Graph Neural Networks8 Feb 2023
- 2021Implications of Topological Imbalance for Representation Learning on Biomedical Knowledge Graphs13 Dec 2021