Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 148686, 14 pages
http://dx.doi.org/10.1155/2014/148686
Research Article

Detecting Community Structures in Networks by Label Propagation with Prediction of Percolation Transition

1College of Marine Engineering, Dalian Maritime University, Dalian 116026, China
2Department of Architectural Engineering, Jilin Province Economic Management Cadre College, Changchun 130012, China

Received 17 March 2014; Revised 17 June 2014; Accepted 17 June 2014; Published 7 July 2014

Academic Editor: Domenico Ursino

Copyright © 2014 Aiping Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. V. Thanikaiselvan, P. Arulmozhivarman, S. Subashanthini, and R. Amirtharajan, “A graph theory practice on transformed image: a random image steganography,” The Scientific World Journal, vol. 2013, Article ID 464107, 7 pages, 2013. View at Publisher · View at Google Scholar
  2. M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  3. M. E. J. Newman, “Analysis of weighted networks,” Physical Review E, vol. 70, Article ID 056131, 2004. View at Google Scholar
  4. M. E. J. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E, vol. 74, no. 3, Article ID 036104, 19 pages, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  5. J. Reichardt and S. Bornholdt, “Statistical mechanics of community detection,” Physical Review E, vol. 74, no. 1, Article ID 016110, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. M. E. J. Newman, “Fast algorithm for detecting community structure in networks,” Physical Review E, vol. 69, no. 6, Article ID 066133, 2004. View at Publisher · View at Google Scholar · View at Scopus
  7. A. Clauset, M. E. J. Newman, and C. Moore, “Finding community structure in very large networks,” Physical Review E, vol. 70, no. 6, Article ID 066111, 2004. View at Publisher · View at Google Scholar · View at Scopus
  8. H. J. Li, B. Y. Xu, L. Zheng, and J. Yan, “Integrating attributes of nodes solves the community structure partition effectively,” Modern Physics Letters B, vol. 28, no. 5, Article ID 1450037, 2014. View at Google Scholar
  9. J. Duch and A. Arenas, “Community detection in complex networks using extremal optimization,” Physical Review E, vol. 72, no. 2, Article ID 027104, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 76, no. 3, Article ID 036106, 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. A. P. Zhang, G. Ren, B. Z. Jia, H. Cao, and S. B. Zhang, “Generalization of label propagation algorithm in complex networks,” in Proceedings of the 25th IEEE Chinese Control and Decision Conference, pp. 1306–1309, Guiyang, China, 2013.
  12. I. X. Y. Leung, P. Hui, P. Liò, and J. Crowcroft, “Towards real-time community detection in large networks,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 79, no. 6, Article ID 066107, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 69, no. 2, Article ID 026113, 2004. View at Publisher · View at Google Scholar · View at Scopus
  14. M. E. J. Newman, “Modularity and community structure in networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 103, no. 23, pp. 8577–8582, 2006. View at Publisher · View at Google Scholar
  15. M. J. Barber and J. W. Clark, “Detecting network communities by propagating labels under constraints,” Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, vol. 80, no. 2, Article ID 026129, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. X. Liu and T. Murata, “Advanced modularity-specialized label propagation algorithm for detecting communities in networks,” Physica A, vol. 389, no. 7, pp. 1493–1500, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. P. Schuetz and A. Caflisch, “Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement,” Physical Review E, vol. 77, no. 4, Article ID 046112, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Fortunato and M. Barthélemy, “Resolution limit in community detection,” Proceedings of the National Academy of Sciences of the United States of America, vol. 104, no. 1, pp. 36–41, 2006. View at Publisher · View at Google Scholar
  19. B. H. Good, Y.-A. de Montjoye, and A. Clauset, “Performance of modularity maximization in practical contexts,” Physical Review E, vol. 81, no. 4, Article ID 046106, 19 pages, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. W. W. Zachary, “An information flow model for conflict and fission in small groups,” Journal of Anthropological Research, vol. 33, no. 4, pp. 452–473, 1977. View at Google Scholar
  21. D. Lusseau, “The emergent properties of a dolphin social network,” Proceedings of the Royal Society B: Biological Sciences, vol. 270, supplement 2, pp. S186–S188, 2003. View at Publisher · View at Google Scholar · View at Scopus
  22. P. M. Gleiser and L. Danon, “Community structure in jazz,” Advances in Complex Systems, vol. 6, no. 4, pp. 565–573, 2003. View at Publisher · View at Google Scholar
  23. H. Jeong, S. P. Mason, A.-L. Barabási, and Z. N. Oltvai, “Lethality and centrality in protein networks,” Nature, vol. 411, no. 6833, pp. 41–42, 2001. View at Publisher · View at Google Scholar · View at Scopus
  24. R. Guimerà, L. Danon, A. Díaz-Guilera, F. Giralt, and A. Arenas, “Self-similar community structure in a network of human interactions,” Physical Review E, vol. 68, no. 6, Article ID 065103, 2003. View at Publisher · View at Google Scholar · View at Scopus
  25. X. F. Wang, X. Li, and G. R. Chen, Complex Networks Theory and Its Application, Tsinghua University, Beijing, China, 2006, (Chinese).
  26. D. Achlioptas, R. M. D'Souza, and J. Spencer, “Explosive percolation in random networks,” Science, vol. 323, no. 5920, pp. 1453–1455, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  27. T. Bohman and J. H. Kim, “A phase transition for avoiding a giant component,” Random Structures and Algorithms, vol. 28, no. 2, pp. 195–214, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  28. M. Tedre and N. Moisseinen, “Experiments in computing: a survey,” The Scientific World Journal, vol. 2014, Article ID 549398, 11 pages, 2014. View at Publisher · View at Google Scholar
  29. A. Lancichinetti, S. Fortunato, and F. Radicchi, “Benchmark graphs for testing community detection algorithms,” Physical Review E, vol. 78, no. 4, Article ID 046110, 2008. View at Publisher · View at Google Scholar · View at Scopus
  30. S. H. Yook, H. Jeong, A. L. Barabasi, and Y. Tu, “weighted evolving networks,” Physical Review Letters, vol. 86, pp. 5835–5838, 2001. View at Publisher · View at Google Scholar