Papers › Fast Sequence Based Embedding with Diffusion Graphs
Fast Sequence Based Embedding with Diffusion Graphs
Benedek Rozemberczki, Rik Sarkar
A graph embedding is a representation of the vertices of a graph in a low dimensional space, which approximately preserves proper-ties such as distances between nodes. Vertex sequence based embedding procedures use features extracted from linear sequences of vertices to create embeddings using a neural network. In this paper, we propose diffusion graphs as a method to rapidly generate vertex sequences for network embedding. Its computational efficiency is superior to previous methods due to simpler sequence generation, and it produces more ac-curate results. In experiments, we found that the performance relative to other methods improves with increasing edge density in the graph.In a community detection task, clustering nodes in the embedding space produces better results compared to other sequence based embedding methods.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
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