Measurement-calibrated graph models for social network experiments

Proceedings of the 19th International Conference on World Wide Web, WWW '10

Volumn , Issue , 2010, Pages 861-870

  Sala, Alessandra ^a   Cao, Lili ^a   Wilson, Christo ^a   Zablit, Robert ^a   Zheng, Haitao ^a   Zhao, Ben Y ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

graph models; social networking

Indexed keywords

COMMUNITY DETECTION; CRITICAL EVALUATION; DATA SETS; DIRECT MEASUREMENT; FACEBOOK; GRAPH DATA; GRAPH METRIC; GRAPH MODEL; GRAPH PROPERTIES; HIGH FIDELITY; LARGE DATASETS; MODEL PARAMETERS; NEW SYSTEM; PRIVATE INFORMATION; REAL DATA SETS; RESOURCE COSTS; SOCIAL GRAPHS; SOCIAL NETWORKING; SOCIAL NETWORKS; SPAM FILTERING; STATISTICAL CONFIDENCE; SYNTHETIC GRAPHS; WEB SEARCHES;

BENCHMARKING; DATA PROCESSING; EXPERIMENTS; WEBSITES;

GRAPHIC METHODS;

EID: 77954613479     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1772690.1772778     Document Type: Conference Paper

References (36)

1. Monte Carlo Statistical Methods. New York: Springer-Verlag, 2004.
2. ADAMIC, L. A., BUYUKKOKTEN, O., AND ADAR, E. A social network caught in the web. First Monday 8, 6 (2003).
3. AHN, Y.-Y., ET AL. Analysis of topological characteristics of huge online social networking services. In Proc. of WWW (May 2007).
4. BACKSTROM, L., DWORK, C., AND KLEINBERG, J. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In WWW (May 2007).
5. BARABASI, A.-L., AND ALBERT, R. Emergence of scaling in random networks. Science 286 (1999), 509-512.
6. BARAKAT, C., ET AL. A flow-based model for internet backbone traffic. In Proc. of Internet Measurement Workshop (2002).
7. BARBARO, M., AND ZELLER, T. A face is exposed for AOL searcher no. 4417749, August 2006. NY Times.
8. BLUM, A., CHAN, T.-H. H., AND RWEBANGIRA, M. R. A random-surfer web-graph model. In Proc. of ANALCO (2006).
9. CLAUSET, A., SHALIZI, C. R., AND NEWMAN,M. E. J. Power-law distributions in empirical data. SIAM Review 51, 4 (2009), 661-703.
10. DOUCEUR, J. R. The Sybil attack. In Proc. of IPTPS (March 2002).
11. ERDOS, P., AND RENYI, A. On the evolution of random graphs. Mathematical Institute of the Hungarian Acadamy of Science (1960).
12. FLOYD, S., AND KOHLER, E. Internet research needs better models. In Proc. of HotNets (Oct. 2002).
13. GARRISS, S., ET AL. Re: Reliable email. In Proc. of NSDI (2006).
14. IVONA, B., ADAM, K., AND RAHUL, S. Graph model selection using maximum likelihood. In Proc. of ICML (2006).
15. KIM, M., KOTZ, D., AND KIM, S. Extracting a mobility model from real user traces. In Proc. of INFOCOM (April 2006).
16. KONRAD, A., ZHAO, B. Y., JOSEPH, A. D., AND LUDWIG, R. A markov-based channel model algorithm for wireless networks. ACM Wireless Networks 9, 3 (May 2003), 189-199.
17. KUMAR, R., ET AL. Stochastic models for the web graph. In Proc. of FOCS (2000).
18. KUMAR, R., NOVAK, J., AND TOMKINS, A. Structure and evolution of online social networks. In Proc. of ACM KDD (2006).
19. LESKOVEC, J., AND FALOUTSOS, C. Scalable modeling of real graphs using kronecker multiplication. In Proc. of ICML (2007).
20. LESKOVEC, J., KLEINBERG, J., AND FALOUTSOS, C. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proc. of ACM KDD (2005).
21. LI, L., ET AL. Towards a theory of scale-free graphs: Definition, properties, and implications. Internet Math 2, 4 (2005), 431-523.
22. LUDWIG, R., KONRAD, A., AND JOSEPH, A. Optimizing the end-to-end performance of reliable flows over wireless link. In Proc. of MobiCom (Seattle, WA, 1999).
23. MAHADEVAN, P., ET AL. Systematic topology analysis and generation using degree correlations. In Proc. of SIGCOMM (2006).
24. MESSMER, B., AND BUNKE, H. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Analysis and Machine Intelligence 20 (1998), 493-504. (Pubitemid 128741329)
25. MISLOVE, A., ET AL. Measurement and analysis of online social networks. In Proc. of IMC (San Diego, CA, Oct 2007).
26. MISLOVE, A., ET AL. Growth of the flickr social network. In Proc. of WOSN (Seattle, WA, August 2008).
27. NARAYANAN, A., AND SHMATIKOV, V. How to break anonymity of the netflix prize dataset. In Proc. of IEEE S&P (May 2008).
28. NARAYANAN, A., AND SHMATIKOV, V. De-anonymizing social networks. In Proc. of IEEE S&P (May 2009).
29. NEWMAN, M. E. J. Mixing patterns in networks. Physical Review E 67-026126 (2003).
30. PUTTASWAMY, K. P. N., SALA, A., AND ZHAO, B. Y. Improving anonymity using social links. In Proc. of NPSec (October 2008).
31. RUSSELL, S., AND NORVIG, P. Artificial Intelligence: A Modern Approach, second ed. Prentice Hall, 2003.
32. TOIVONEN, R., ET AL. A model for social networks. Physica A: Statistical and Theoretical Physics 371, 2 (Nov. 2006), 851-860.
33. VAZQUEZ, A. Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations. Physical Review E 67-056104 (2003).
34. WATTS, D. J., AND STROGATZ, S. Collective dynamics of 'small-world' networks. Nature, 393 (1998), 440-442.
35. WILSON, C., BOE, B., SALA, A., PUTTASWAMY, K. P. N., AND ZHAO, B. Y. User interactions in social networks and their implications. In Proc. of EuroSys (April 2009).
36. YU, H., ET AL. Sybilguard: defending against sybil attacks via social networks. In Proc. of SIGCOMM (September 2006).