mlsanityData to 14 Oct 2026

On the Surprising Behaviour of node2vec

arXiv 2206.08252 ↗First posted 16 Jun 2022cs.LG stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Graph embedding techniques are a staple of modern graph learning research. When using embeddings for downstream tasks such as classification, information about their stability and robustness, i.e., their susceptibility to sources of noise, stochastic effects, or specific parameter choices, becomes increasingly important. As one of the most prominent graph embedding schemes, we focus on node2vec and analyse its embedding quality from multiple perspectives. Our findings indicate that embedding quality is unstable with respect to parameter choices, and we propose strategies to remedy this in practice.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 10 of its 24 references that are in the map. First posted on arXiv 16 Jun 2022.

Builds on

10 of 24 references.

References · 10

  1. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  2. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  3. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  4. 2021Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networkscited by 221
  5. 2021Weisfeiler and Lehman Go Cellular: CW Networkscited by 218
  6. 2017Graph Embedding Techniques, Applications, and Performance: A Surveycited by 188
  7. 2020word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Datacited by 38
  8. 2020The Effects of Randomness on the Stability of Node Embeddingscited by 15
  9. 2020k-simplex2vec: a simplicial extension of node2veccited by 13
  10. 2021Persistent Homology and Graphs Representation Learningcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 0; 2026: 1.

3 papers.