Large human communication networks: Patterns and a utility-driven generator

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

Volumn , Issue , 2009, Pages 269-277

  Du, Nan ^a,b   Faloutsos, Christos ^b   Wang, Bai ^a   Akoglu, Leman ^b  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Cliques; Graph generators; Social networks

Indexed keywords

CLIQUES; COMMUNICATION SERVICE; DIRECT CONTACT; EVOLVING NETWORKS; GRAPH GENERATORS; HUMAN COMMUNICATIONS; LARGE DATASETS; PERSONAL COMMUNICATION SERVICES; POWER LAW; REAL NETWORKS; REAL-WORLD; SOCIAL NETWORKS;

CELLULAR RADIO SYSTEMS; COMMUNICATION; TELEPHONE SYSTEMS;

GRAPH THEORY;

EID: 70350668603     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557054     Document Type: Conference Paper

References (36)

1. C. C. Aggarwal and P. S. Yu. Outlier detection with uncertain data. In SDM, pages 483-493, 2008.
2. S. Albers, S. Eilts, E. Even-Dar, Y. Mansour, and L. Roditty. On nash equilibria for a network creation game. In SODA, pages 89-98, 2006.
3. R. Albert and A.-L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47, 2002.
4. B. Wu and D. B. Davison Identifying link farm spam pages. In WWW 2005, pages 820-829, 2005.
5. A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
6. Z. Bi, C. Faloutsos, and F. Korn. The "DGX" distribution for mining massive, skewed data. SIGKDD 2001, pages 17-26
7. F. Cazals and C. Karande. Reporting maximal cliques: new insights into an old problem. Research Report, http://cgal.inria.fr/Publications/2005/CK05b, (5615), 2005.
8. D. Chakrabarti and C. Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv., 38(1), 2006.
9. V. Chandola, A. Banerjee, and V. Kumar. Anomaly detection: A survey. To Appear in ACM Computing Survey.
10. L.-N. David and K. Jon. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7):1019-1031, 2007.
11. E. D. Demaine, M. Hajiaghayi, H. Mahini, and M. Zadimoghaddam. The price of anarchy in network creation games. In PODC, pages 292-298, 2007.
12. N. Du, B. Wu, and B. Wang. A parallel algorithm for enumerating all maximal cliques in complex networks. In ICDM2006 Mining Complex Data Workshop, pages 320-324.
13. Z. Elena, K. Aleksander, and G. Lise. Trusting spam reporters: A reporter-based reputation system for email filtering. ACM Trans. Inf. Syst., 27(1), 2008.
14. P. Erdos and A. Renyi. On the evolution of random graphs. Publ. Math. Inst. Hungary. Acad. Sci., 5:17-61, 1960.
15. E. Even-Dar, M. J. Kearns, and S. Suri. A network formation game for bipartite exchange economies. In SODA, pages 697-706, 2007.
16. A. Fabrikant, A. Luthra, E. N. Maneva, C. H. Papadimitriou, and S. Shenker. On a network creation game. In PODC, pages 347-351, 2003.
17. J. Leskovec, L. Backstorm, R. Kumar, and A. Tomkins Microscopic evolution of social networks. In SIGKDD 2008, pages 462-470.
18. Y. Koren. Tutorial on recent progress in collaborative filtering. In RecSys 2008.
19. N. Laoutaris, L. J. Poplawski, R. Rajaraman, R. Sundaram, and S.-H. Teng. Bounded budget connection games or how to make friends and influence people on a budget. CoRR, 2008.
20. J.-G. Lee, J. Han, and X. Li. Trajectory outlier detection: A partition-and-detect framework. In ICDE 2008, pages 140-149.
21. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In SIGKDD 2005, pages 177-187
22. M. McGlohon, L. Akoglu, and C. Faloutsos. Weighted graphs and disconnected components: patterns and a generator. InSIGKDD 2008.
23. W. Michael and H. Mattord. Principles of Information Secuirty. Thomson, Canada.
24. M. Mitzenmacher. Dynamic models for file sizes and double pareto distributions. 2002.
25. A. A. Nanavati, S. Gurumurthy, G. Das, D. Chakraborty, K. Dasgupta, S. Mukherjea, and A. Joshi. In CIKM 2006.
26. J. F. Nash. Non-cooperative games. Annals of Mathematics, 54, 286-295, 1951.
27. M. E. J. Newman. Power laws, pareto distributions and zipf's law. May 2006.
28. J.-P. Onnela, J. Saramäki, J. Hyvönen, G. Szabó, A. M. de Menezes, K. Kaski, A.-L. Barabási, and J. Kertész. Analysis of a large-scale weighted network of one-to-one human communication. New J. Phys., 9(6):179, 2007.
29. J. P. Onnela, J. Saramaki, J. Hyvonen, G. Szabo, D. Lazer, K. Kaski, J. Kertesz, and A. L. Barabasi. Structure and tie strengths in mobile communication networks. PNAS, 104(18):7332-7336, May 2007.
30. W. Reed and M. Jorgensen. The double pareto-lognormal distribution a new parametric model for size distribution. 2004.
31. M. Seshadri, S. Machiraju, A. Sridharan, J. Bolot, C. Faloutsos, and J. Leskove. In SIGKDD 2008.
32. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Neighborhood formation and anomaly detection in bipartite graphs. In ICDM, pages 418-425, 2005.
33. S. Wasserman and K. Faust. Social Network Analysis. Cambridge University Press, Cambridge, 1994.
34. D. Watts. Small Worlds:The Dynamics of Networks between Order and Randomness. Princeton University Press, 1999.
35. D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, 393(6684):440-442, June 1998.
36. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440-442, June 1998.