Login / Signup
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.
Lijie Chen
Gillat Kol
Dmitry Paramonov
Raghuvansh Saxena
Zhao Song
Huacheng Yu
Published in:
CoRR (2021)
Keyphrases
</>
directed graph
random walk
undirected graph
k means
transition probability matrix
dynamic programming
maximum flow
computational complexity
graph structure
data streams
np hard
learning algorithm
optimal solution
markov chain
hyper graph
tree structure
search space
similarity measure