Login / Signup
From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs.
Jacopo Bono
Ahmad Naser Eddin
David Aparício
Hugo Ferreira
João Tiago Ascensão
Pedro Ribeiro
Pedro Bizarro
Published in:
ICAIF (2023)
Keyphrases
</>
weighted graph
random walk
graph structure
edge weights
directed graph
graph laplacian
nodes of a graph
graph clustering
low latency
markov chain
spectral methods
real time
graph structures
web graph
laplace beltrami
average degree