Sampling node pairs over large graphs.
Pinghui WangJunzhou ZhaoJohn C. S. LuiDon TowsleyXiaohong GuanPublished in: ICDE (2013)
Keyphrases
- directed graph
- graph structure
- finding the shortest path
- undirected graph
- pairwise
- uniform random
- graph matching
- graph theory
- graph structures
- shortest path
- parameter space
- small world networks
- sampling methods
- neural network
- random walk
- betweenness centrality
- edge weights
- markov chain monte carlo
- graph databases
- random graphs
- graph kernels
- graph model
- sampling strategy
- weighted graph
- sample size
- densely connected
- bipartite graph
- monte carlo