Abstract
Community structure is an important topological property of complex networks, which is beneficial to understand the structures and functions of complex networks. In this chapter a new statistical parameter, which we call network potential, is proposed to measure a complex network by introducing the field theories of physics. We then present a detecting algorithm of community structure based on the network potential whose main strategy is partitioning the network by optimizing the value of the network potential. We test our algorithm on both computer-generated networks and real-world networks whose community structure is already known. The experimental results show the algorithm can be effectively utilized for detecting the community structure of complex network.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Strogatz SH (2001) Exploring complex networks. Nature 410:268–276
Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47–97
Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167–256
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69:026113
Fortunato S (2010) Community detection in graphs. Phys Rep 486:75–174
E W, Li TJ, Vanden-Eijnden E (2008) Optimal partition and effective dynamics of complex networks. Proc Natl Acad Sci USA 105:7907–7912
Fiedler M (1973) Algebraic connectivity of graphs. Czech Math J 23(98):298–305
Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291–307
Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69:066133
Ruan JH, Zhang WX (2008) Identifying network communities with a high resolution. Phys Rev E 77:016104
Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814–818
Yang B, Cheung WK, Liu J (2007) Community mining from signed social networks. IEEE Trans Knowl Data Eng 19:1333–1348
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826
Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Natl Acad Sci USA 101(9):2658–2663
Clauset A (2005) Finding local community structure in networks. Phys Rev E 72:026132
Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104
Newman MEJ (2001) Scientific collaboration networks: ii. Shortest paths, weighted networks, and centrality. Phys Rev E 64:016132
Danon L, Diaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech 2005:P09008
Penrose M (2003) Random geometric graphs. Oxford University Press, Oxford
Liu J, Wang N (2009) Detecting community structure of complex networks by affinity propagation. IEEE Int Conf Intell Comput Intell Syst 4:13–19
Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anth Res 33(4):452–473
Lusseau D (2003) The emergent properties of a dolphin social network. Proc R Soc Lond B 270(Suppl2):S186–S188
Acknowledgments
This work was supported by National Natural Science Foundation of China (61071152), National “Twelfth Five-Year” Plan for Science and Technology Support (2012BAH38B04), and Major State Basic Research Development Program (2010CB731400 and 2010CB731406).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media New York
About this paper
Cite this paper
Zhao, Y., Zhao, C., Chen, X., Li, S., Peng, H., Zhang, Y. (2012). Detecting Community Structure of Complex Networks Based on Network Potential. In: Liang, Q., et al. Communications, Signal Processing, and Systems. Lecture Notes in Electrical Engineering, vol 202. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5803-6_45
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5803-6_45
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-5802-9
Online ISBN: 978-1-4614-5803-6
eBook Packages: EngineeringEngineering (R0)