Extracting dense communities from telecom call graphs

3rd IEEE/Create-Net International Conference on Communication System Software and Middleware, COMSWARE

Volumn , Issue , 2008, Pages 82-89

  Pandit, Vinayaka ^a   Modani, Natwar ^a   Mukherjea, Sougata ^a   Nanavali, Amit A ^a   Roy, Sambuddha ^a   Agarwal, Amit ^b  

^a IBM RESEARCH INDIA   (India)

^b University of North Carolina at Chapel Hill   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPHIC METHODS; MIDDLEWARE; SOCIAL NETWORKING (ONLINE); TELEPHONE SETS;

ALGORITHMIC ENGINEERING; COLLABORATION NETWORK; DENSEST SUBGRAPH PROBLEMS; DYNAMIC OBJECTS; LARGE ORGANIZATIONS; RESEARCH COMMUNITIES; SOCIAL CONTACTS; TELECOM CALL GRAPH;

GRAPH THEORY;

EID: 51849098115     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COMSWA.2008.4554383     Document Type: Conference Paper

References (28)

1. J. Abello, A. Buchsbaum, and J. Westbrook, "A functional approach to external graph algorithms," in Proceedings of the 6th European Symosium on Algorithms (ESA), 1998, pp. 332-343.
2. J. Abello, M. Resende, and S. Sudarsky, "Massive quasi-clique detection," in Proceedings of the 5th Latin American symposium on Theoretical Informatics (LATIN), 2002, pp. 598-612.
3. W. Aiello, F. Chung, and L. Lu, "A random graph model for massive graphs," in Proceedings of ACM Symposium on Theory of Computing (STOC), 2000, pp. 171-180.
4. L. Backstrom, C. Dwork, and J. Kleinberg, "Wherefore art though R3579X? Anonymized social networks, hidden patterns, and structural steganography," in Proceedings of the conference on World Wide Web (WWW), 2007.
5. A. Barabasi and R. Albert. "Emergence of scaling in random networks," Science, vol. 286, pp. 509-512, 1999.
6. A. Barabasi, H. J. anf E. Ravasz, Z. Neda, A. Schuberts, and T. Vischek, "Evolution of the social network of scientific collaborations." Physica. vol. 311, pp. 590-614, 2002.
7. V. Batagelj and A. Mrvar, Graph Drawing Software. Berlin: Springer, 2003, ch. Pajek: Analysis and Visualization of large networks, pp. 77-103.
8. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, S. Stata, A. Tomkins, and J. Wiener, "Graph structure in the web," in Proceedings of the nineth international conference on World Wide Web ( WWW), 2000, pp. 309-320.
9. M. Charikar, "Greedy approximation algorithms for finding dense components in a graph," in Proceedings of the 5th workshop on Approximation Algorithms (APPROX), 2000, pp. 84-95.
10. D. Crane. Invisible colleges: Diffusion of knowledge in scientific communities, Chicago: University of Chicago Press, 1972.
11. DBLP, "DBLP - Computer Science Bibliography." http://www.informatik.uni-trier.de/lcy/db.
12. S. Eubank, V. A. Kumar, M. Marathe, A. Srinivasan, and N. Wang, "Structural and algorithmic aspects of massive social networks," in ACM Symposium on Discrete Algorithms (SODA), 2004, pp. 718-727.
13. G. Flake, S. Lawrence, C. Giles, and F. Coetzee, "Self-organization and identification of Web communities," IEEE Computer, vol. 35. pp. 66-71, 2002.
14. J. Kleinberg, "Navigation in a small world," Nature, vol. 406, 2000.
15. _, "The small-world phenomenon: An algorithmic perspective," in Proceedings of the 32nd annual ACM Symposium on Theoty of Computing(STOC), 2000, pp. 163-170.
16. D. Liben-Nowell and J. Kleinberg, "The link prediction problem for social networks," in Proceedings of ACM Conference on Information and Knowledge Management (CIKM), 2003, pp. 556-559.
17. Linkedln, "Linkedin: Relations Matter," http://www.linkedin. com.
18. S. Milgram, "The small world problem," Psychology Today, vol. 2, pp. 60-67. 1967.
19. J. Moody, "Race, school integration, and friendship segregation in America," American Journal of Sociology, vol. 107. pp. 679-716, 2001.
20. J. Moreno, Who shall survive? Beacon. NY: Beacon House, 1934.
21. A. Nanavati, S. Gurumurthy, G. Das. D. Chakraborty, K. Dasgupta, S. Mukherjea, and A. Joshi. "On the structural properties of massive telecom call graphs: findings and implications," in Proceedings of ACM Conference on Knolwedge and Information Management(CIKM), 2006, pp. 435-444.
22. M. Newman, "Scientific collaboration networks: I. Network construction and fundamental results," Physical Review, vol. 64. 2001.
23. _, "Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality." Physical Review, vol. 64, 2001.
24. _, "The structure and function of complex networks," SIAM Review, pp. 167-256, 2003.
25. J. Padgett and C. Ansell, "Robust action and the rise of medici," American Journal of Sociology, vol. 98, pp. 1259-1319, 1993.
26. A. Rapaport, "Contribution to the theory of random and biased nets," Bulletin of Mathematical Biophysics, vol. 19, pp. 257-277, 1957.
27. A. Vazquez, R. Pastor-Satoross, and A. Vespignani, "Large-scale topological and dynamic properties of the internet," Physical Review, vol. 65. 2002.
28. D. Watts and S. Strogatz, "Collective dynamics of small-world networks," Nature, vol. 393, pp. 440-442, 1998.