Search Results for author:
Found 1 papers, 1 papers with code
On Random Walk Based Graph Sampling
In this paper, we first present a comprehensive analysis of the drawbacks of three widely-used random walk based graph sampling algorithms, called re-weighted random walk (RW) algorithm, Metropolis-Hastings random walk (MH) algorithm and maximum-degree random walk (MD) algorithm.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
