The Community for Technology Leaders
2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (2011)
Beijing, China
Oct. 10, 2011 to Oct. 12, 2011
ISBN: 978-0-7695-4557-8
pp: 357-360
Increasing size of online social networks (OSNs) has given rise to sampling method studies that provide a relatively small but representative sample of large-scale OSNs so that the measurement and analysis burden can be affordable. So far, a number of sampling methods already exist that crawl social graphs. Most of them are suitable for one-mode graph where there is only one type of nodes. Literatures show that Metropolis-Hastings Random Walk (MHRW) produces unbiased samples with better performance than other sampling methods. But there are more and more online social networking sites with two types of nodes, such as Taobao and eBay. Representing these two-mode networks as bipartite graphs, we study the sampling methods for bipartite graphs in this paper. Our contributions include analyze the effectiveness of extending MHRW algorithm to bipartite graphs and making a modification in sampling procedure to improve the stability. Finally, we compare our MHRW sampling algorithm with Random Walk (RW) over the generated bipartite graphs as well as real two-mode network graphs. Simulations show that MHRW outperforms RW over bipartite graphs.
online social networks, bipartite graph, crawling, random walks, sampling ratio

J. Wang and Y. Guo, "Unbiased Sampling of Bipartite Graph," 2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery(CYBERC), Beijing, China, 2011, pp. 357-360.
181 ms
(Ver 3.3 (11022016))