Community detection in weighted networks: Algorithms and applications

2013 IEEE International Conference on Pervasive Computing and Communications, PerCom 2013

Volumn , Issue , 2013, Pages 179-184

  Lu, Zongqing ^a   Wen, Yonggang ^a   Cao, Guohong ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNITY DETECTION; COMMUNITY DETECTION ALGORITHMS; DATA-FORWARDING; ONLINE SOCIAL NETWORKS (OSN); TRACE DRIVEN SIMULATION; WEIGHTED NETWORKS; WORM CONTAINMENT STRATEGY;

ALGORITHMS; COMPUTER WORMS; NETWORK PROTOCOLS; POPULATION DYNAMICS; SIGNAL DETECTION; SOCIAL NETWORKING (ONLINE); UBIQUITOUS COMPUTING;

DELAY TOLERANT NETWORKS;

EID: 84880120943     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PerCom.2013.6526730     Document Type: Conference Paper

References (18)

1. S. Fortunato, "Community detection in graphs," Physics Reports, vol. 486, no. 3-5, pp. 75-174, 2010.
2. E. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant manets," in ACM Mobihoc 2007.
3. P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap: social-based forwarding in delay tolerant networks," in ACM Mobihoc 2008.
4. W. Gao, Q. Li, B. Zhao, and G. Cao, "Multicasting in delay tolerant networks: a social network perspective," in ACM Mobihoc 2009.
5. W. Gao and G. Cao, "User-centric data dissemination in disruption tolerant networks," in IEEE INFOCOM 2011.
6. N. Nguyen, T. Dinh, S. Tokala, and M. Thai, "Overlapping communities in dynamic networks: their detection and mobile applications," in ACM Mobicom 2011.
7. W. Gao, G. Cao, T. La Porta, and J. Han, "On exploiting transient social contact patterns for data forwarding in delay-tolerant networks," Mobile Computing, IEEE Transactions on, vol. 12, no. 1, pp. 151-165, jan. 2013.
8. A. Vahdat, D. Becker et al., "Epidemic routing for partially connected ad hoc networks," Technical Report CS-200006, Duke University, Tech. Rep., 2000.
9. Q. Yuan, I. Cardei, and J. Wu, "Predict and relay: an efficient routing in disruption-tolerant networks," in ACM Mobihoc 2009.
10. Z. Zhu, G. Cao, S. Zhu, S. Ranjan, and A. Nucci, "A social network based patching scheme for worm containment in cellular networks," in IEEE INFOCOM 2009.
11. G. Palla, I. Der'enyi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol. 435, no. 7043, pp. 814-818, 2005. (Pubitemid 40839731)
12. U. Raghavan, R. Albert, and S. Kumara, "Near linear time algorithm to detect community structures in large-scale networks," Physical Review E, vol. 76, no. 3, p. 036106, 2007.
13. Y. Ahn, J. Bagrow, and S. Lehmann, "Link communities reveal multiscale complexity in networks," Nature, vol. 466, no. 7307, pp. 761-764, 2010.
14. S. Gregory, "Finding overlapping communities in networks by label propagation," New Journal of Physics, vol. 12, p. 103018, 2010.
15. D. Chen, M. Shang, Z. Lv, and Y. Fu, "Detecting overlapping communities of weighted networks via a local algorithm," Physica A: Statistical Mechanics and its Applications, vol. 389, no. 19, pp. 4177-4187, 2010.
16. J. Leskovec, K. Lang, and M. Mahoney, "Empirical comparison of algorithms for network community detection," in ACM WWW 2010.
17. N. Eagle and A. Pentland, "Reality mining: sensing complex social systems," Personal and Ubiquitous Computing, vol. 10, no. 4, pp. 255-268, 2006.
18. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, "On the evolution of user interaction in facebook," in Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks (WOSN'09), August 2009.