Graph sampling provides an efficient way by selecting a representative subset of the original graph thus making the graph scale small for improved computations. Random walk graph sampling has been considered as a fundamental tool to collect uniform node samples from a large graph. In this paper, a comprehensive analysis and comparison of four existing sampling algorithms-BFS, NBRW-rw, MHRW and MHDA is presented. The comparison is shown on the basis of the performance of each algorithm on different kinds of datasets. Here, the considered parameters are node-degree distribution and clustering coefficient which effect the performance of an algorithm in generating unbiased samples. The sampling methods as in this study are analysed on the real-network datasets and finally the conclusion says that MHDA performs excellently whereas BFS gives a poor performance.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.