On the bias of BFS (Breadth First Search)

2010 22nd International Teletraffic Congress - Proceedings, ITC 22

Volumn , Issue , 2010, Pages

  Kurant, MacIej ^a   Markopoulou, Athina ^b   Thiran, Patrick ^a  

^a EPFL   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

BFS; Bias; Breadth First Search; Facebook; Graph sampling; Online social networks; OSN

Indexed keywords

BFS; BIAS; BREADTH-FIRST SEARCH; FACEBOOK; GRAPH SAMPLING; ONLINE SOCIAL NETWORKS; OSN;

COMPUTER SIMULATION; DEFORESTATION; RANDOM PROCESSES;

SOCIAL NETWORKING (ONLINE);

DEFORESTATION; GRAPHIC METHODS; INTERNET; NETWORKS; RANDOM PROCESSES; SAMPLING; SIMULATION; SOCIOLOGY;

EID: 78650137532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITC.2010.5608727     Document Type: Conference Paper

References (28)

1. M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, "On near-uniform url sampling," in Proc. of WWW, 2000.
2. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger, "On unbiased sampling for unstructured peer-to-peer networks," in IMC, 2006.
3. A. Rasti, M. Torkjazi, R. Rejaie, N. Duffield, W. Willinger, and D. Stutzbach, "Respondent-driven sampling for characterizing unstructured overlays," in INFOCOM Mini-Conference, April 2009.
4. C. Gkantsidis, M. Mihail, and A. Saberi, "Random walks in peer-to-peer networks," in Proc. of Infocom, 2004.
5. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou, "Walking in facebook: A case study of unbiased sampling of osns," Infocom, 2010.
6. B. Krishnamurthy, P. Gill, and M. Arlitt, "A few chirps about twitter," in Proc. of WOSN, 2008.
7. J. Leskovec and C. Faloutsos, "Sampling from large graphs," in Proc. of ACM SIGKDD, 2006.
8. L. Lovasz, "Random walks on graphs. a survey," in Combinatorics, 1993.
9. M. Najork and J. L. Wiener, "Breadth-first search crawling yields highquality pages," in Proc. of WWW, 2001.
10. Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong, "Analysis of Topological Characteristics of Huge Online Social Networking Services," in Proc. of WWW, 2007.
11. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and S. Bhattacharjee, "Measurement and Analysis of Online Social Networks," in Proc. of IMC, 2007.
12. C. Wilson, B. Boe, A. Sala, K. P. Puttaswamy, and B. Y. Zhao, "User interactions in social networks and their implications," in Proc. Of EuroSys, 2009.
13. S. H. Lee, P.-J. Kim, and H. Jeong, "Statistical properties of sampled networks," Phys. Rev. E, vol. 73, p. 016102, 2006.
14. L.Becchetti, C.Castillo, D.Donato, and A.Fazzone, "A comparison of sampling techniques for web graph characterization," in LinkKDD, 2006.
15. S. Ye, J. Lang, and F. Wu, "Crawling Online Social Graphs," in APWeb, 2010.
16. A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, "Growth of the flickr social network," in WOSN, 2008.
17. J. H. Kim, "Poisson cloning model for random graphs," International Congress of Mathematicians (ICM), 2006 (preprint in 2004).
18. D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, "On the bias of traceroute sampling: or, power-law degree distributions in regular graphs," in STOC, 2005.
19. J. Illenberger, G. Flötteröd, and K. Nage, "An approach to correct bias induced by snowball sampling," Sunbelt Social Networks Conference, 2009.
20. L. Goodman, "Snowball sampling," Annals of Mathematical Statistics, vol. 32, p. 148170, 1961.
21. W. Gilks, S. Richardson, and D. Spiegelhalter, Markov Chain Monte Carlo in Practice. Chapman and Hall/CRC, 1996.
22. D. Heckathorn, "Respondent-driven sampling: A new approach to the study of hidden populations," Social Problems, vol. 44, p. 174199, 1997.
23. M. Salganik and D. Heckathorn, "Sampling and estimation in hidden populations using respondent-driven sampling," Sociological Methodology, vol. 34, p. 193239, 2004.
24. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: densification laws, shrinking diameters and possible explanations," in KDD, 2005.
25. M. Molloy and B. Reed, "A critical point for random graphs with a given degree sequence," pp. 161-179, 1995.
26. M. E. J. Newman, "Ego-centered networks and the ripple effect," Social Networks, vol. 25, pp. 83-95, 2003.
27. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1990.
28. M. Newman, "Assortative mixing in networks," in Phys. Rev. Lett. 89, 2002.