Methods › Graphs › Graph Embeddings › DeepWalk
DeepWalk
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.
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.
-
Node Embeddings via Neighbor Embeddings 31 Mar 2025 · 0 repositories · arXiv:2503.23822
-
A quantum annealing approach to graph node embedding 8 Mar 2025 · 0 repositories · arXiv:2503.06332
-
Heterogeneous Graph Pre-training Based Model for Secure and Efficient Prediction of Default Risk Propagation among Bond Issuers 4 Jan 2025 · 0 repositories · arXiv:2501.03268
-
Two Layer Walk: A Community-Aware Graph Embedding 17 Dec 2024 · 1 repository · arXiv:2412.12933
-
Convergence Guarantees for the DeepWalk Embedding on Block Models 26 Oct 2024 · 0 repositories · arXiv:2410.20248
-
Network Analytics for Anti-Money Laundering -- A Systematic Literature Review and Experimental Evaluation 29 May 2024 · 1 repository · arXiv:2405.19383
-
Robustness of graph embedding methods for community detection 1 May 2024 · 1 repository · arXiv:2405.00636
-
Hierarchical Information Enhancement Network for Cascade Prediction in Social Networks 22 Mar 2024 · 0 repositories · arXiv:2403.15257
-
Hyperdimensional Representation Learning for Node Classification and Link Prediction 26 Feb 2024 · 0 repositories · arXiv:2402.17073
-
Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs 23 Jan 2024 · 0 repositories · arXiv:2401.13054
-
Reproducibility study of the Fairness-enhanced Node Representation Learning 21 Sep 2023 · 0 repositories
-
Drug Interaction Vectors Neural Network: DrIVeNN 26 Aug 2023 · 0 repositories · arXiv:2308.13891
-
Generating Post-hoc Explanations for Skip-gram-based Node Embeddings by Identifying Important Nodes with Bridgeness 24 Apr 2023 · 0 repositories · arXiv:2304.12036
-
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations 30 Oct 2022 · 0 repositories · arXiv:2210.16963
-
EasyRec: An easy-to-use, extendable and efficient framework for building industrial recommendation systems 26 Sep 2022 · 2 repositories · arXiv:2209.12766
-
Large-Scale Privacy-Preserving Network Embedding against Private Link Inference Attacks 28 May 2022 · 0 repositories · arXiv:2205.14440
-
A Practical Two-stage Ranking Framework for Cross-market Recommendation 27 Apr 2022 · 1 repository · arXiv:2204.12682
-
GlobalWalk: Learning Global-aware Node Embeddings via Biased Sampling 22 Jan 2022 · 0 repositories · arXiv:2201.09882
-
Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling 20 Jan 2022 · 1 repository · arXiv:2201.08481
-
Contrastive Laplacian Eigenmaps 14 Jan 2022 · 1 repository · arXiv:2201.05493Syntology official (archive's flag): 2 ran · 2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result (of 2 harvested samples) · 2 pointer-only (licence)
-
Asymptotics of ℓ₂ Regularized Network Embeddings 5 Jan 2022 · 1 repository · arXiv:2201.01689
-
Learning Large-scale Network Embedding from Representative Subgraph 2 Dec 2021 · 0 repositories · arXiv:2112.01442
-
Generalizable Cross-Graph Embedding for GNN-based Congestion Prediction 10 Nov 2021 · 0 repositories · arXiv:2111.05941
-
Community detection using low-dimensional network embedding algorithms 4 Nov 2021 · 0 repositories · arXiv:2111.05267
-
GRAPE for Fast and Scalable Graph Processing and random walk-based Embedding 12 Oct 2021 · 2 repositories · arXiv:2110.06196
-
REFINE: Random RangE FInder for Network Embedding 24 Aug 2021 · 0 repositories · arXiv:2108.10703
-
NOTE: Solution for KDD-CUP 2021 WikiKG90M-LSC 5 Jul 2021 · 0 repositories · arXiv:2107.01892
-
Evaluating Modules in Graph Contrastive Learning 15 Jun 2021 · 1 repository · arXiv:2106.08171Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)
-
CrossWalk: Fairness-enhanced Node Representation Learning 6 May 2021 · 1 repository · arXiv:2105.02725Syntology official (archive's flag): 1 ran · 1 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; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)
-
Evaluating Document Representations for Content-based Legal Literature Recommendations 28 Apr 2021 · 1 repository · arXiv:2104.13841
-
Persistent Homology and Graphs Representation Learning 8 Mar 2021 · 0 repositories
-
Persistent Homology and Graphs Representation Learning 25 Feb 2021 · 0 repositories · arXiv:2102.12926
-
DeepWalking Backwards: From Embeddings Back to Graphs 17 Feb 2021 · 1 repository · arXiv:2102.08532Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples) · 4 pointer-only (licence)
-
Exact Recovery of Community Structures Using DeepWalk and Node2vec 18 Jan 2021 · 0 repositories · arXiv:2101.07354
-
Unifying Homophily and Heterophily Network Transformation via Motifs 21 Dec 2020 · 0 repositories · arXiv:2012.11400
-
InstantEmbedding: Efficient Local Node Representations 14 Oct 2020 · 0 repositories · arXiv:2010.06992
-
div2vec: Diversity-Emphasized Node Embedding 21 Sep 2020 · 0 repositories · arXiv:2009.09588
-
Force2Vec: Parallel force-directed graph embedding 17 Sep 2020 · 1 repository · arXiv:2009.10035
-
Accelerating Graph Sampling for Graph Machine Learning using GPUs 14 Sep 2020 · 0 repositories · arXiv:2009.06693
-
A Matrix Chernoff Bound for Markov Chains and Its Application to Co-occurrence Matrices 6 Aug 2020 · 0 repositories · arXiv:2008.02464
-
InfiniteWalk: Deep Network Embeddings as Laplacian Embeddings with a Nonlinearity 29 May 2020 · 1 repository · arXiv:2006.00094
-
Embedding Vector Differences Can Be Aligned With Uncertain Intensional Logic Differences 26 May 2020 · 1 repository · arXiv:2005.12535
-
Machine Learning on Graphs: A Model and Comprehensive Taxonomy 7 May 2020 · 1 repository · arXiv:2005.03675Syntology official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified (of 8 harvested samples)
-
Characterizing and Detecting Money Laundering Activities on the Bitcoin Network 27 Dec 2019 · 0 repositories · arXiv:1912.12060
-
MANELA: A Multi-Agent Algorithm for Learning Network Embeddings 1 Dec 2019 · 0 repositories · arXiv:1912.00303
-
Network Embedding: An Overview 26 Nov 2019 · 0 repositories · arXiv:1911.11726
-
Symbolic Graph Embedding using Frequent Pattern Mining 29 Oct 2019 · 1 repository · arXiv:1910.13314
-
Tutorial on NLP-Inspired Network Embedding 16 Oct 2019 · 0 repositories · arXiv:1910.07212
-
Distributed Training of Embeddings using Graph Analytics 8 Sep 2019 · 0 repositories · arXiv:1909.03359
-
Adversarial Training Methods for Network Embedding 30 Aug 2019 · 1 repository · arXiv:1908.11514
-
Fast and Accurate Network Embeddings via Very Sparse Random Projection 30 Aug 2019 · 2 repositories · arXiv:1908.11512Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)
-
Network Embedding: on Compression and Learning 5 Jul 2019 · 1 repository · arXiv:1907.02811
-
NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization 26 Jun 2019 · 1 repository · arXiv:1906.11156
-
Network Representation Learning: Consolidation and Renewed Bearing 2 May 2019 · 1 repository · arXiv:1905.00987
-
Data Poisoning Attack against Unsupervised Node Embedding Methods 30 Oct 2018 · 0 repositories · arXiv:1810.12881
-
Attention Models with Random Features for Multi-layered Graph Embeddings 2 Oct 2018 · 0 repositories · arXiv:1810.01405
-
Improved Deep Embeddings for Inferencing with Multi-Layered Networks 20 Sep 2018 · 0 repositories · arXiv:1811.12156
-
Sampled in Pairs and Driven by Text: A New Graph Embedding Framework 12 Sep 2018 · 0 repositories · arXiv:1809.04234
-
Learning Role-based Graph Embeddings 7 Feb 2018 · 2 repositories · arXiv:1802.02896
-
Inductive Representation Learning in Large Attributed Graphs 25 Oct 2017 · 0 repositories · arXiv:1710.09471
-
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec 9 Oct 2017 · 4 repositories · arXiv:1710.02971Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)
-
A Framework for Generalizing Graph-based Representation Learning Methods 14 Sep 2017 · 0 repositories · arXiv:1709.04596
-
NEXT: A Neural Network Framework for Next POI Recommendation 15 Apr 2017 · 0 repositories · arXiv:1704.04576
-
GraRep: Learning Graph Representations with Global Structural Information 17 Oct 2015 · 2 repositories
-
Network Representation Learning with Rich Text Information 24 Jun 2015 · 3 repositories
-
Comprehend DeepWalk as Matrix Factorization 2 Jan 2015 · 0 repositories · arXiv:1501.00358
-
DeepWalk: Online Learning of Social Representations 26 Mar 2014 · 14 repositories · arXiv:1403.6652Syntology 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)
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.
Usage over time archive 2025-07-28
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
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