Methods › Graphs › Graph Embeddings › DeepWalk

DeepWalk

67 papers tagged archive 2025-07-28

Introduced by Bryan Perozzi et al. in DeepWalk: Online Learning of Social Representations

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

DeepWalk learns embeddings (social representations) of a graph's vertices, by modeling a stream of short random walks. Social representations are latent features of the vertices that capture neighborhood similarity and community membership. These latent representations encode social relations in a continuous vector space with a relatively small number of dimensions. It generalizes neural language models to process a special language composed of a set of randomly-generated walks.

The goal is to learn a latent representation, not only a probability distribution of node co-occurrences, and so as to introduce a mapping function Φ:v ∈V ↦ℝ^(|V|×d). This mapping Φ represents the latent social representation associated with each vertex v in the graph. In practice, Φ is represented by a |V| ×d matrix of free parameters.

PaperSource

In Syntology harvested code stored, below machine verification (unverified_code; harvested), served level V1; retrieve with get_harvested_code_for_paper(arxiv_id='1403.6652'). Repositories: 14 listed of 14 in the graph, strongest link: mentioned on GitHub. The lookup matched a paper by its title, arXiv:1403.6652, not a method entry. This answer is about arXiv:1403.6652, the paper the archive credits with this method.

Origin paper of this answer, arXiv:1403.6652 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 3 harvested samples) · 1 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.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 67 · with a code link: 28 · where Syntology ran a sample: 8 (6 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 (8 of 67 tagged: 6 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 67 of 67, 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 57 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
Representation Learning24
Network Embedding19
Node Classification17
Link Prediction16
Graph Embedding12
Graph Representation Learning8
Community Detection5
Recommendation Systems5
BIG-bench Machine Learning4
Clustering4
General Classification4
Graph Neural Network4
Attribute3
Contrastive Learning3
Anomaly Detection2
Classification2
Dimensionality Reduction2
Feature Engineering2
Graph Learning2
Graph Sampling2

Usage over time archive 2025-07-28

Papers per year tagged with DeepWalk: 2014 to 2025, peak 13 13 0 2014: 1 paper 2014 2015: 3 papers 2015 2016: 0 papers 2016 2017: 4 papers 2017 2018: 5 papers 2018 2019: 11 papers 2019 2020: 9 papers 2020 2021: 13 papers 2021 2022: 8 papers 2022 2023: 3 papers 2023 2024: 7 papers 2024 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (67 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