Multigraph sampling of online social networks

IEEE Journal on Selected Areas in Communications

Volumn 29, Issue 9, 2011, Pages 1893-1905

  Gjoka, Minas ^a   Butts, Carter T ^a,b   Kurant, MacIej ^a   Markopoulou, Athina ^a,b  

^a University of California Irvine   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Graph sampling; Last.fm; Multigraph; Random walks; Sampling methods; Social network services

Indexed keywords

LAST.FM; MULTIGRAPHS; RANDOM WALK; SAMPLING METHODS; SOCIAL NETWORK SERVICES;

INTERNET; RANDOM PROCESSES;

SOCIAL NETWORKING (ONLINE);

EID: 80053654964     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2011.111012     Document Type: Article

References (38)

1. Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, "Analysis of topological characteristics of huge online social networking services", in Proc. 16th Int. Conf. on World Wide Web, Banff, Alberta, Canada, 2007, pp. 835-844. (Pubitemid 47582313)
2. A. Mislove, M. Marcon, K. Gummadi, P. Druschel, and B. Bhattacharjee, "Measurement and analysis of online social networks", in Proc. 7th ACM SIGCOMM Conf. on Internet measurement, San Diego, CA, 2007, pp. 29-42.
3. C. Wilson, B. Boe, A. Sala, K. Puttaswamy, and B. Zhao, "User interactions in social networks and their implications", in Proc. 4th ACM European Conf. on Computer systems, Nuremberg, Germany, 2009, pp. 205-218.
4. S. H. Lee, P.-J. Kim, and H. Jeong, "Statistical properties of sampled networks", Physical Review E, vol. 73, p. 16102, 2006.
5. M. Kurant, A. Markopoulou, and P. Thiran, "On the bias of BFS (Breadth First Search)", in Proc. 22nd Int. Teletraffic Congr., also in arXiv:1004.1729, 2010.
6. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou, "Walking in Facebook: A Case Study of Unbiased Sampling of OSNs", in Proc. IEEE INFOCOM, San Diego, CA, 2010.
7. A. H. Rasti, M. Torkjazi, R. Rejaie, and D. Stutzbach, "Evaluating Sampling Techniques for Large Dynamic Graphs", Univ. Oregon, Tech. Rep. CIS-TR-08-01, Sep. 2008.
8. D. D. Heckathorn, "Respondent-Driven Sampling II: Deriving Valid Estimates from Chain-Referral Samples of Hidden Populations", Social Problems, vol. 49, pp. 11-34, 2002.
9. S. Ross, Introduction to probability models. Academic Press, 2003, vol. 8.
10. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou, "Practical Recommendations on Sampling OSN Users by Crawling the Social Graph", To appear in IEEE J. Sel. Areas Commun. on Measurement of Internet Topologies, 2011.
11. D. D. Heckathorn, "Respondent-Driven Sampling: A New Approach to the Study of Hidden Populations", Social Problems, vol. 44, pp. 174-199, 1997.
12. M. Salganik and D. D. Heckathorn, "Sampling and estimation in hidden populations using respondent-driven sampling", Sociological Methodology, vol. 34, no. 1, pp. 193-240, 2004.
13. M. Newman, "Ego-centered networks and the ripple effect", Social Networks, vol. 25, pp. 83-95, 2003.
14. M. Hansen and W. Hurwitz, "On the Theory of Sampling from Finite Populations", Annals of Mathematical Statistics, vol. 14, no. 3, 1943.
15. J. Geweke, "Evaluating the accuracy of sampling-based approaches to the calculation of posterior moments", in Bayesian Statistics, 1992, pp. 169-193.
16. A. Gelman and D. Rubin, "Inference from iterative simulation using multiple sequences", in Statistical science, vol. 7, no. 4, 1992, pp. 457-472.
17. D. West, Introduction to graph theory. Prentice Hall, 1996.
18. S. Boyd, P. Diaconis, and L. Xiao, "Fastest mixing Markov chain on a graph", SIAM review, vol. 46, no. 4, pp. 667-689, 2004. (Pubitemid 40072140)
19. M. Newman, "Random graphs with clustering", Physical review letters, vol. 103, no. 5, p. 58701, 2009.
20. A. Leon-Garcia, Probability, statistics, and random processes for electrical engineering. Pearson/Prentice Hall, 2008.
21. M. Gjoka, C. T. Butts, M. Kurant, and A. Markopoulou, "Multigraph Sampling of Online Social Networks", To appear in IEEE J. Sel. Areas Commun. on Measurement of Internet Topologies, 2011.
22. R. Rejaie, M. Torkjazi, M. Valafar, and W. Willinger, "Sizing up online social networks", IEEE Network, vol. 24, no. 5, pp. 32-37, 2010.
23. G. Seber, "The estimation of animal abundance and related parameters", New York, 1982.
24. W. Willinger, R. Rejaie, M. Torkjazi, M. Valafar, and M. Maggioni, "OSN Research: Time to face the real challenges", in Proc. 2nd Workshop on Hot Topics in Measurement & Modeling of Computer Systems, Seattle, WA, 2009.
25. U. Acer, P. Drineas, and A. Abouzeid, "Random walks in time-graphs", in Proc. 2nd Int. Workshop on Mobile Opportunistic Networking, 2010, pp. 93-100.
26. M. Kurant, A. Markopoulou, and P. Thiran, "Towards Unbiased BFS Sampling", To appear in IEEE J. Sel. Areas Commun. on Measurement of Internet Topologies, 2011.
27. B. Krishnamurthy, P. Gill, and M. Arlitt, "A few chirps about twitter", in Proc. 1st workshop on Online social networks, Seattle, WA, 2008, pp. 19-24.
28. C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-to-peer networks", in Proc. IEEE INFOCOM, Hong Kong, China, 2004.
29. A. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, and D. Stutzbach, "Respondent-driven sampling for characterizing unstructured overlays", in Proc. IEEE INFOCOM Mini-conference, Rio de Janeiro, Brazil, 2009, pp. 2701-2705.
30. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger, "On unbiased sampling for unstructured peer-to-peer networks", in Proc. 6th ACM SIGCOMM Conf. on Internet measurement, Rio de Janeiro, Brazil, 2006.
31. J. Leskovec and C. Faloutsos, "Sampling from large graphs", in Proc. 12th ACM SIGKDD Int. Conf. on Knowledge discovery and data mining, Philadelphia, PA, 2006, pp. 631-636. (Pubitemid 44535566)
32. B. Ribeiro and D. Towsley, "Estimating and sampling graphs with multidimensional random walks", in Proc. 10th ACM SIGCOMM Conf. on Internet measurement, Melbourne, Australia, 2010.
33. W. Gilks and G. Roberts, "Strategies for improving MCMC", Markov chain Monte Carlo in practice, pp. 89-114, 1996.
34. S. Thompson, "Adaptive cluster sampling", Journal of the American Statistical Association, vol. 85, no. 412, pp. 1050-1059, 1990.
35. -, "Stratified Adaptive Cluster Sampling", Biometrika, vol. 78, no. 2, pp. 389-397, 1991.
36. I. Konstas, V. Stathopoulos, and J. Jose, "On social networks and collaborative recommendation", in Proc. 32nd Int. ACM SIGIR Conf. on Research and development in information retrieval, Boston, MA, 2009, pp. 195-202.
37. R. Schifanella, A. Barrat, C. Cattuto, B. Markines, and F. Menczer, "Folks in folksonomies: social link prediction from shared metadata", in Proc. 3rd ACM Int. Conf. on Web search and data mining, New York, NY, 2010, pp. 271-280.
38. N. Baym and A. Ledbetter, "Tunes that bind? Predicting friendship strength in a music-based social network", Information, Communication and Society, vol. 12, no. 3, 2009.