A Feasible Graph Partition Framework for Random Walks Implemented by Parallel Computing in Big Graph.
Xiaoming LiuYadong ZhouXiaohong GuanPublished in: CoRR (2015)
Keyphrases
- random walk
- parallel computing
- directed graph
- flow graph
- nodes of a graph
- massively parallel
- weighted graph
- graph laplacian
- spectral methods
- web graph
- transition probability matrix
- graph model
- link prediction
- markov random walk
- shortest path
- probabilistic model
- average degree
- undirected graph
- transition probabilities
- reinforcement learning
- spanning tree
- shared memory
- message passing
- dynamic programming