From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs.
Ahmad Naser EddinJacopo BonoDavid AparícioHugo FerreiraJoão Tiago AscensãoPedro RibeiroPedro BizarroPublished in: CoRR (2023)
Keyphrases
- random walk
- directed graph
- nodes of a graph
- low latency
- graph embedding
- graph structure
- markov chain
- markov random walk
- web graph
- spectral methods
- average degree
- flow graph
- real time
- graph structures
- random walker
- undirected graph
- graph clustering
- bipartite graph
- link prediction
- edge weights
- graph laplacian
- link analysis
- high speed