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.
Papers archive 2025-07-28
30 shown of 67, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
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 ran 2 of 2 samples · 0 unverified · 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 ran 0 of 1 samples · 1 unverified
-
CrossWalk: Fairness-enhanced Node Representation Learning 6 May 2021 · 1 repository · arXiv:2105.02725Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)
-
Evaluating Document Representations for Content-based Legal Literature Recommendations 28 Apr 2021 · 1 repository · arXiv:2104.13841
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