Identifying Modules in Complex Networks by a Graph-Theoretical Method and Its Application in Protein Interaction Networks
Detecting community structure/modules in complex networks recently attracts increasing attention from various fields including mathematics, physics and biology. In this paper, we propose a method based on graph-theoretical clustering for identifying modularity structure in complex networks. Compared with the existing algorithms, this method, based on minimum spanning tree, has several advantages. For example, unlike many algorithms, this method is deterministic and not sensitive to the initialization. In addition, the method does not require a prior knowledge about the number of the modules. It can easily obtain the number of clusters by analyzing the edge weight distribution of minimum spanning tree. Moreover, this algorithm has computational compexity of polynomial-time with low order and can be used to deal with large-scale networks. Experimental results show that our method produces good results for real networks and can also uncover meaningful functional modules in protein interaction networks.
KeywordsMinimum spanning tree (MST) functional module protein interaction network complex network
Unable to display preview. Download preview PDF.
- 1.Gibson, D., Kleinberg, J., Raghavan, P.: Inferring Web Communities from Link Topology. In: Proceedings of the 9th ACM Conference on Hypertext and Hypermedia, ACM Press, New York (1998)Google Scholar
- 6.Zhang, S., Liu, H.-W., Ning, X.-M., Zhang, X.-S.: A Graph-Theoretic Method for Mining Functional Modules in Large Sparse Protein Interaction Networks. In: Proceeding of Sixth IEEE International Conference on Data Mining-Workshops (ICDMW’06), pp. 130–135. IEEE Computer Society Press, Los Alamitos (2006)CrossRefGoogle Scholar
- 9.Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)Google Scholar
- 10.White, S., Smyth, P.: A Spectral Clustering Approach to Finding Communities in Graphs. SIAM International Conference on Data Mining (2005)Google Scholar
- 11.Danon, L., Daz-Guilera, A., Duch, J., Arenas, A.: Comparing Community Structure Identification. J. Statist. Mech.: Theory and Experiment, 09, P09008 (2005)Google Scholar
- 12.Angelini, L., Boccaletti, S., Marinazzo, D., et al.: Fast Identification of Network Modules by Optimization of Ratio Association, cond-mat/0610182 (2006)Google Scholar
- 13.Reichardt, J., Bornholdt, S.: Detecting Fuzzy Community Structures in Somplex Networks with a Potts Model. Physical Review Letters, 93, 218701 (2004)Google Scholar
- 16.Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Phys. Rev. E 69, 026113 (2004)Google Scholar
- 17.Duch, J., Arenas, A.: Community Identification Using Extremal Optimization. Phys. Rev. E, 72, 027104 (2005)Google Scholar
- 30.Vathy-Fogarassy, A., Feil, B., Abonyi, J.: Minimal Spanning Tree Based Fuzzy Clustering. ENFORMATIKA Transactions on Engineering, Computing and Technology 8, 7–12 (2005)Google Scholar