Detecting the structure of social networks using (α,β)- communities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6732 LNCS, Issue , 2011, Pages 26-37

  He, Jing ^b   Hopcroft, John ^a   Liang, Hongyu ^b   Suwajanakorn, Supasorn ^a   Wang, Liaoruo ^a  

^a School of Operations Research and Information Engineering   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNITY ALGORITHMS; COMMUNITY IS; COMMUNITY SIZE; CORE STRUCTURE; DEGREE DISTRIBUTIONS; RANDOM GRAPH MODELS; REAL-WORLD NETWORKS; SOCIAL GRAPHS; SOCIAL NETWORKS; SOCIAL STRUCTURE;

ALGORITHMS; MATHEMATICAL MODELS; USER INTERFACES; SOCIAL NETWORKING (ONLINE);

GRAPH THEORY;

EID: 79958181384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21286-4_3     Document Type: Conference Paper

References (15)

1. Choudhury, M.D., Lin, Y.-R., Sundaram, H., Candan, K., Xie, L., Kelliher, A.: How does the sampling strategy impact the discovery of information diffusion in social media? In: Proc. 4th Int'l AAAI Conf. Weblogs and Social Media, ICWSM (2010)
2. Choudhury, M.D., Sundaram, H., John, A., Seligmann, D.D., Kelliher, A.: Birds of a feather: does attribute homophily impact information diffusion on social media? (under review)
3. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 06111 (2004)
4. Gaertler, M.: Clustering. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol. 3418, pp. 178-215. Springer, Heidelberg (2005)
5. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99(12), 7821-7826 (2002)
6. He, J., Hopcroft, J.E., Liang, H., Supasorn, S., Wang, L.: Detecting the structure of social networks using (α, β)-communities. Tech. rep., Cornell University (2011), http://hdl.handle.net/1813/22415
7. Lang, K., Rao, S.: A flow-based method for improving the expansion or conductance of graph cuts. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 325-337. Springer, Heidelberg (2004)
8. Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Statistical properties of community structure in large social and information networks. In: Proc. 18th Int'l World Wide Web Conf. WWW (2008)
9. Mishra, N., Schreiber, R., Stanton, I., Tarjan, R.E.: Finding strongly-knit clusters in social networks. Internet Mathematics 5(1-2), 155-174 (2009)
10. Newman, M.E.J.: Detecting community structure in networks. The European Physical J. B 38, 321-330 (2004)
11. Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004)
12. Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)
13. Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. USA 103(23), 8577-8582 (2006)
14. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
15. Schaeffer, S.E.: Graph clustering. Computer Science Review 1(1), 27-64 (2007)