Communities Unfolding in Multislice Networks

Discovering communities in complex networks helps to understand the behaviour of the network. Some works in this promising research area exist, but communities uncovering in time-dependent and/or multiplex networks has not deeply investigated yet. In this paper, we propose a communities detection approach for multislice networks based on modularity optimization. We first present a method to reduce the network size that still preserves modularity. Then we introduce an algorithm that approximates modularity optimization (as usually adopted) for multislice networks, thus finding communities. The network size reduction allows us to maintain acceptable performances without affecting the effectiveness of the proposed approach.

[1]  Bart Selman,et al.  Tracking evolving communities in large linked networks , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[2]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Nick S. Jones,et al.  Dynamic communities in multichannel data: an application to the foreign exchange market during the 2007-2008 credit crisis. , 2008, Chaos.

[4]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

[5]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[6]  Sergio Gómez,et al.  Size reduction of complex networks preserving modularity , 2007, ArXiv.

[7]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[9]  Deepayan Chakrabarti,et al.  Evolutionary clustering , 2006, KDD '06.

[10]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[11]  Srinivasan Parthasarathy,et al.  An event-based framework for characterizing the evolutionary behavior of interaction graphs , 2009, ACM Trans. Knowl. Discov. Data.

[12]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Peter J. Mucha,et al.  Multiscale, and Multiplex Networks Community Structure in Time-Dependent, , 2010 .

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

[15]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

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