Random walk on node cliques for high-quality samples to estimate large graphs with high accuracies and low costs.
Lingling ZhangFang WangHong JiangDan FengYanwen XieZhiwei ZhangGuoren WangPublished in: Knowl. Inf. Syst. (2022)
Keyphrases
- random walk
- directed graph
- graph structure
- high quality
- nodes of a graph
- spectral methods
- markov chain
- transition probabilities
- average degree
- weighted graph
- undirected graph
- hyper graph
- graph structures
- web graph
- random walker
- multi db
- markov random walk
- adjacency matrix
- link prediction
- edge weights
- transition probability matrix
- small world networks
- graph model
- graph theory
- graph matching
- pairwise
- search algorithm