Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.
Lijie ChenGillat KolDmitry ParamonovRaghuvansh R. SaxenaZhao SongHuacheng YuPublished in: ICALP (2021)
Keyphrases
- random walk
- directed graph
- dynamic programming
- undirected graph
- k means
- np hard
- computational complexity
- graph structure
- machine learning
- similarity measure
- maximum flow
- worst case
- random walker
- data clustering
- tree structure
- clustering method
- markov chain
- search space
- optimal solution
- reinforcement learning
- learning algorithm