Methods › Graphs › Graph Embeddings › node2vec

node2vec

104 papers tagged archive 2025-07-28

Introduced by Aditya Grover et al. in node2vec: Scalable Feature Learning for Networks

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

node2vec is a framework for learning graph embeddings for nodes in graphs. Node2vec maximizes a likelihood objective over mappings which preserve neighbourhood distances in higher dimensional spaces. From an algorithm design perspective, node2vec exploits the freedom to define neighbourhoods for nodes and provide an explanation for the effect of the choice of neighborhood on the learned representations.

For each node, node2vec simulates biased random walks based on an efficient network-aware search strategy and the nodes appearing in the random walk define neighbourhoods. The search strategy accounts for the relative influence nodes exert in a network. It also generalizes prior work alluding to naive search strategies by providing flexibility in exploring neighborhoods.

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 20 in the graph, strongest link: official). This answer is about arXiv:1607.00653, the paper the archive credits with this method.

Origin paper of this answer, arXiv:1607.00653 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified (of 25 harvested samples) · 3 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 104 · with a code link: 35 · where Syntology ran a sample: 9 (7 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (9 of 104 tagged: 7 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 104, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 86 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Link Prediction26
Representation Learning26
Graph Embedding19
Network Embedding19
Node Classification17
Community Detection8
Graph Representation Learning8
BIG-bench Machine Learning7
Clustering7
Recommendation Systems7
General Classification6
Prediction6
Knowledge Graphs4
Word Embeddings4
Anomaly Detection3
Attribute3
Decoder3
Graph Learning3
Graph Neural Network3
Self-Supervised Learning3

Usage over time archive 2025-07-28

Papers per year tagged with node2vec: 2016 to 2025, peak 19 19 0 2016: 1 paper 2016 2017: 4 papers 2017 2018: 6 papers 2018 2019: 17 papers 2019 2020: 19 papers 2020 2021: 18 papers 2021 2022: 9 papers 2022 2023: 14 papers 2023 2024: 12 papers 2024 2025: 4 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (104 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Graph Embeddings

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections