Community Detection in Multi-dimensional Network

Community structure is one of the hidden characteristics of complex network topology. Detecting the community structure is crucial to understand and utilize the network structure. Existing methods are mostly detecting the community on a one-dimensional network, which is based on only one kind of relationship between the nodes. In this paper, as the prerequisite that there are various ways of people connection in real world, we modeling the multiple relationships of group members in the complex network as a multi-dimensional network. Then we used the traditional community detection to infer the community structure from each dimension of our model. Finally, we define the sibling matrix to map the inferred different community structures from the multi-dimensional network into a comprehensive association, so we can find the hidden community of the complex network. Experimental results show that compared with existing algorithms, the proposed algorithm has higher performance.

[1]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Steve Gregory,et al.  Detecting community structure in networks using edge prediction methods , 2012, ArXiv.

[3]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Weixiong Zhang,et al.  Discovering link communities in complex networks by exploiting link dynamics , 2012, ArXiv.

[5]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[6]  László Lovász,et al.  Multifractal network generator , 2010, Proceedings of the National Academy of Sciences.

[7]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.