Walking on a graph with a magnifying glass: Stratified sampling via weighted random walks

Performance Evaluation Review

Volumn 39, Issue 1 SPEC. ISSUE, 2011, Pages 281-292

  Kurant, Maciej ^a   Gjoka, Minas ^a   Butts, Carter T ^a   Markopoulou, Athina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Graph sampling; Online social networks.; Random walks on weighted graphs; Stratified sampling

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS; HEURISTIC METHODS; OPTIMIZATION; RANDOM PROCESSES;

EDGE WEIGHTS; ESTIMATION PROBLEM; GRAPH SAMPLINGS; HIGHER EFFICIENCY; NODE SETS; ONLINE SOCIAL NETWORK.; RANDOM WALK; RANDOM WALK ON WEIGHTED GRAPH; STRATIFIED SAMPLING; WEIGHTED GRAPH;

SOCIAL NETWORKING (ONLINE);

EID: 79960184514     PISSN: 01635999     EISSN: None     Source Type: Journal    
DOI: 10.1145/1993744.1993773     Document Type: Conference Paper

References (44)

1. Weighted Random Walks of the Facebook social graph: http://odysseas. calit2.uci.edu/osn 2011.
2. D. Achlioptas, A. Clauset, D. Kempe, and C. On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. Journal of the ACM, 2009.
3. Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong. Analysis of topological characteristics of huge online social networking services. In WWW, pages 835-844, 2007. (Pubitemid 47582313)
4. D. Aldous and J. A. Fill. Reversible Markov Chains and Random Walks on Graphs. In preparation.
5. K. Avrachenkov, B. Ribeiro, and D. Towsley. Improving Random Walk Estimation Accuracy with Uniform Restarts. In I7th Workshop on Algorithms and Models for the Web Graph, 2010.
6. L. Backstrom and J. Kleinberg. Network Bucket Testing. In WWW, 2011.
7. L. Backstrom and J. Leskovec. Supervised Random Walks: Predicting and Recommending Links in Social Networks. In ACM International Conference on Web Search and Data Minig (WSDM), 2011.
8. L. Becchetti, C. Castillo, D. Donato, and A. Fazzone. A comparison of sampling techniques for web graph characterization. In LinkKDD, 2006.
9. H. R. Bernard, T. Hallett, A. Iovita, E. C. Johnsen, R. Lyerla, C. McCarty, M. Mahy, M. J. Salganik, T. Saliuk, O. Scutelniciuc, G. a. Shelley, P. Sirinirund, S. Weir, and D. F. Stroup. Counting hard-to-count populations: the network scale-up method for public health. Sexually Transmitted Infections, 86(Suppl 2):ii11-ii15, Nov. 2010.
10. S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing Markov chain on a graph. SIAM review, 46(4):667-689, 2004. (Pubitemid 40072140)
11. S. Chakrabarti. Focused crawling: a new approach to topic-specific Web resource discovery. Computer Networks, 31(11-16):1623-1640, May 1999.
12. W. G. Cochran. Sampling Techniques, volume 20 of McGraw-Hil Series in Probability and Statistics. Wiley, 1977.
13. M. Diligenti, F. Coetzee, S. Lawrence, C. Giles, and M. Gori. Focused crawling using context graphs. In Proceedings of the 26th International Conference on Very Large Data Bases, pages 527-534, 2000.
14. N. Duffield, C. Lund, and M. Thorup. Learn more, sample less: control of volume and variance in network measurement. IEEE Transactions on Information Theory, 51(5):1756-1775, May 2005. (Pubitemid 40654447)
15. J. Gentle. Random number generation and Monte Carlo methods. Springer Verlag, 2003.
16. W. R. Gilks, S. Richardson, and D. J. Spiegelhalter. Markov Chain Monte Carlo in Practice. Chapman and Hall/CRC, 1996.
17. M. Gjoka, C. Butts, M. Kurant, and A. Markopoulou. Multigraph Sampling of Online Social Networks. arXiv, (arXiv:1008.2565v1):1-10, 2010.
18. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. Walking in Facebook: A Case Study of Unbiased Sampling of OSNs. In INFOCOM, 2010.
19. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In INFOCOM, 2004.
20. M. Hansen and W. Hurwitz. On the Theory of Sampling from Finite Populations. Annals of Mathematical Statistics, 14(3), 1943.
21. D. D. Heckathorn. Respondent-Driven Sampling: A New Approach to the Study of Hidden Populations. Social Problems, 44:174-199, 1997.
22. M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. On near-uniform URL sampling. In WWW, 2000.
23. E. D. Kolaczyk. Statistical Analysis of Network Data, volume 69 of Springer Series in Statistics. Springer New York, 2009.
24. B. Krishnamurthy, P. Gill, and M. Arlitt. A few chirps about Twitter. In WOSN, 2008.
25. M. Kurant, M. Gjoka, C. Butts, and A. Markopoulou. Walking on a Graph with a Magnifying Glass. Arxiv preprint arXiv:1101.5463, 2011.
26. M. Kurant, A. Markopoulou, and P. Thiran. On the bias of BFS (Breadth First Search). In ITC, also in arXiv:1004.1729, 2010.
27. S. H. Lee, P.-J. Kim, and H. Jeong. Statistical properties of Sampled Networks. Phys. Rev. E, 73:16102, 2006.
28. J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD, pages 631-636, 2006. (Pubitemid 44535566)
29. S. Lohr. Sampling: design and analysis. Brooks/Cole, second edition, 2009.
30. L. Lovász. Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty, 2(1):1-46, 1993.
31. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculation by fast computing machines. Journal of Chemical Physics, 21:1087-1092, 1953.
32. A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Growth of the Flickr social network. In WOSN, 2008.
33. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC, pages 29-42, 2007.
34. A. Mohaisen, A. Yun, and Y. Kim. Measuring the mixing time of social graphs. IMC, 2010.
35. J. Neyman. On the Two Different Aspects of the Representative Method: The Method of Stratified Sampling and the Method of Purposive Selection. Journal of the Royal Statistical Society, 97(4):558, 1934.
36. A. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, and D. Stutzbach. Respondent-driven sampling for characterizing unstructured overlays. In Infocom Mini-conference, pages 2701-2705, 2009.
37. A. H. Rasti, M. Torkjazi, R. Rejaie, and D. Stutzbach. Evaluating Sampling Techniques for Large Dynamic Graphs. In Technical Report, volume 1, 2008.
38. B. Ribeiro and D. Towsley. Estimating and sampling graphs with multidimensional random walks. In IMC, volume 011, 2010.
39. B. Ribeiro, P. Wang, and D. Towsley. On Estimating Degree Distributions of Directed Graphs through Sampling. UMass Technical Report, 2010.
40. M. Salganik and D. D. Heckathorn. Sampling and estimation in hidden populations using respondent-driven sampling. Sociological Methodology, 34(1):193-240, 2004.
41. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. On unbiased sampling for unstructured peer-to-peer networks. In IMC, 2006.
42. E. Volz and D. D. Heckathorn. Probability based estimation theory for respondent driven sampling. Journal of Official Statistics, 24(1):79-97, 2008.
43. W. Willinger, R. Rejaie, M. Torkjazi, M. Valafar, and M. Maggioni. OSN Research: Time to Face the Real Challenges. In HotMetrics, 2009.
44. C. Wilson, B. Boe, A. Sala, K. P. N. Puttaswamy, and B. Y. Zhao. User interactions in social networks and their implications. In EuroSys, 2009.