Benefits of bias: Towards better characterization of network sampling

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 105-113

  Maiya, Arun S ^a   Berger Wolf, Tanya Y ^a  

^a 1120 Science and Engineering Offices   (United States)

Author keywords

Bias; Complex networks; Crawling; Graph mining; Link mining; Online sampling; Sampling; Social network analysis

Indexed keywords

COMPLEX NETWORKS; MARKET RESEARCH; SOCIAL NETWORKING (ONLINE);

BIAS; CRAWLING; GRAPH MINING; IN NETWORKS; LINK MINING; NETWORK SAMPLINGS; ON-LINE SAMPLING; P2P SYSTEM; SOCIAL NETWORK ANALYSIS; SYSTEMS NETWORKS;

PEER TO PEER NETWORKS;

EID: 80052689976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.202043     Document Type: Conference Paper

References (51)

1. 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'05.
2. L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman. Search in power-law networks. Physical Review E, 64(4):046135+, Sept. 2001.
3. N. K. Ahmed, F. Berchmans, J. Neville, and R. Kompella. Time-based sampling of social network activity graphs. In MLG'10.
4. N. K. Ahmed, J. Neville, and R. Kompella. Reconsidering the Foundations of Network Sampling. In WIN'10.
5. A.-L. Barabasi and R. Albert. Emergence of Scaling in Random Networks. Science, 286(5439):509-512, Oct. 1999.
6. M. Boguná, R. P. Satorras, A. D. Guilera, and A. Arenas. Models of social networks based on social distance attachment. Physical Review E, 70(5):056122+, Nov. 2004.
7. P. Boldi, M. Santini, and S. Vigna. Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. In WAW'04.
8. T. Cao, X. Wu, S. Wang, and X. Hu. OASNET: an optimal allocation approach to inuence maximization in modular social networks. In SAC'10.
9. J. Cho, H. G. Molina, and L. Page. Effcient crawling through URL ordering. Computer Networks and ISDN Systems, 30(1-7):161-172, 1998.
10. N. A. Christakis and J. H. Fowler. Social Network Sensors for Early Detection of Contagious Outbreaks. PLoS ONE, 5(9):e12948+, Sept. 2010.
11. F. Chung and L. Lu. Connected Components in Random Graphs with Given Expected Degree Sequences. Annals of Combinatorics, 6(2):125-145, Nov. 2002.
12. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(6):066111+, Dec. 2004.
13. R. Cohen, S. Havlin, and D. ben Avraham. Effcient Immunization Strategies for Computer Networks and Populations. arXiv:cond-mat/0207387v3, Dec. 2003.
14. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. McGraw-Hill Science/Engineering/Math, 2nd edition, Dec. 2003.
15. E. Costenbader. The stability of centrality measures when networks are sampled. Social Networks, 25(4):283-307, Oct. 2003. (Pubitemid 37378916)
16. U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652, July 1998. (Pubitemid 128488790)
17. S. L. Feld. Why Your Friends Have More Friends Than You Do. The Am. J. of Sociology, 96(6):1464-1477, 1991.
18. S. Fortunato. Community detection in graphs. arXiv:0906.0612v2 [physics.soc-ph], Jan. 2010.
19. O. Frank. Models and Methods in Social Network Analysis (Structural Analysis in the Social Sciences), chapter 3. Cambridge University Press, Feb. 2005.
20. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou. A Walk in Facebook: Uniform Sampling of Users in Online Social Networks. arXiv e-print (arXiv:0906.0060v3), Feb. 2011.
21. B. H. Good, Y.-A. de Montjoye, and A. Clauset. Performance of modularity maximization in practical contexts. Physical Review E, 81(4):046106+, Apr. 2010.
22. M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. On near-uniform URL sampling. In WWW'00.
23. S. Hoory, N. Linial, and A. Wigderson. Expander Graphs and Their Applications. Bull. Amer. Math. Soc, 43, 2006.
24. J. Hopcroft and D. Sheldon. Manipulation-resistant reputations using hitting time. In WAW'07.
25. C. Hubler, H.-P. Kriegel, K. Borgwardt, and Z. Ghahramani. Metropolis Algorithms for Representative Subgraph Sampling. In ICDM'08.
26. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. J. ACM, 51(3):497-515, May 2004.
27. J. Kleinberg. Complex Networks and Decentralized Search Algorithms. In International Congress of Mathematicians (ICM), 2006.
28. E. D. Kolaczyk. Statistical Analysis of Network Data, chapter 5. Springer, 2009.
29. V. Krishnamurthy, M. Faloutsos, M. Chrobak, J. Cui, L. Lao, and A. Percus. Sampling large Internet topologies for simulation purposes. Computer Networks, 51(15):4284-4302, Oct. 2007. (Pubitemid 47284952)
30. M. Kurant, A. Markopoulou, and P. Thiran. On the bias of BFS. Arxiv e-print (arXiv:1004.1729v1), Apr. 2010.
31. A. Lakhina, J. W. Byers, M. Crovella, and P. Xie. Sampling Biases in IP Topology Measurements. In INFOCOM'03.
32. S. H. Lee, P. J. Kim, and H. Jeong. Statistical properties of sampled networks. Physical Review E, 73(1):016102+, Jan. 2006.
33. J. Leskovec. Stanford Large Network Dataset Collection. http://snap.stanford.edu/data/.
34. J. Leskovec and C. Faloutsos. Sampling from large graphs. In KDD'06.
35. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In KDD'05.
36. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In KDD'07.
37. L. Lovasz. Random Walks on Graphs: A Survey. Combinatorics: Paul Erdos is 80, II, 1994.
38. L. Lovasz. Very large graphs. arXiv:0902.0132v1 [math.CO], Feb. 2009.
39. A. S. Maiya and T. Y. Berger Wolf. Expansion and search in networks. In CIKM'10.
40. A. S. Maiya and T. Y. Berger-Wolf. Sampling Community Structure. In WWW'10.
41. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC'07.
42. M. Najork. Breadth-first search crawling yields high-quality pages. In WWW'01.
43. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, Mar. 2003.
44. M. Potamias, F. Bonchi, C. Castillo, and A. Gionis. Fast shortest path distance estimation in large networks. In CIKM'09.
45. U. N. Raghavan, R. Albert, and S. Kumara. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3):036106+, Sept. 2007.
46. M. P. H. Stumpf, C. Wiuf, and R. M. May. Subnets of scale-free networks are not scale-free: Sampling properties of networks. PNAS, 102(12):4221-4224, Mar. 2005. (Pubitemid 40397092)
47. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. On unbiased sampling for unstructured peer-to-peer networks. IEEE/ACM Trans. Netw., 17(2):377-390, 2009.
48. H. Tong, B. A. Prakash, C. Tsourakakis, T. E. Rad, C. Faloutsos, and D. H. Chau. On the Vulnerability of Large Graphs. In ICDM'10.
49. D. Tsoumakos and N. Roussopoulos. Analysis and comparison of P2P search methods. In InfoScale'06.
50. D. J. Watts and S. H. Strogatz. Collective dynamics of'small- world'networks. Nature, 393(6684):440-442, June 1998.
51. E. W. Zuckerman and J. T. Jost. What Makes You Think You're so Popular? Self-Evaluation Maintenance and the Subjective Side of the "Friendship Paradox". Social Psychology Quarterly, 64(3), 2001.