Community Detection in Multi-Layer Networks

Recent years have seen a surge of interest in community detection and a large range of algorithms have been designed and applied to this specific task. However, the vast majority of the work done in the area has been concerned with simple weighted graphs. This results in some of the real world systems being oversimplified to fit this model. In this project, I design a new community detection algorithm capable of detecting communities in multi-layer networks. Multi-layer networks are constituted of a finite set of graphs, called layers, which share the same nodes but differ in their edges. I construct a modeling approach whereby I try to approximate the network using communities. The results show that this approach can reveal multi-layer communities that would not be found using standard community detection tools.

[1]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[2]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Dennis V. Lindley,et al.  An Introduction to Bayesian Inference and Decision , 1974 .

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

[5]  David R. Anderson,et al.  Model selection and multimodel inference : a practical information-theoretic approach , 2003 .

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

[7]  Eyal de Lara,et al.  Haggle: Seamless Networking for Mobile Applications , 2007, UbiComp.

[8]  Pascal Frossard,et al.  Clustering With Multi-Layer Graphs: A Spectral Perspective , 2011, IEEE Transactions on Signal Processing.

[9]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

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

[11]  Damien Fay,et al.  On Joint Diagonalisation for Dynamic Network Analysis , 2011, ArXiv.

[12]  Philip S. Yu,et al.  Community Learning by Graph Approximation , 2007, Seventh IEEE International Conference on Data Mining (ICDM 2007).

[13]  Jean-Charles Delvenne,et al.  Stability of graph communities across time scales , 2008, Proceedings of the National Academy of Sciences.

[14]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[15]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[16]  Cecilia Mascolo,et al.  Components in time-varying graphs , 2011, Chaos.

[17]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[18]  F. Radicchi,et al.  Statistical significance of communities in networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Robert L. Winkler,et al.  An Introduction to Bayesian Inference and Decision , 1972 .

[20]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[21]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[22]  Stephen Kelley.  The existence and discovery of overlapping communities in large-scale networks , 2009 .

[23]  Haixun Wang,et al.  The Trinity Graph Engine , 2012 .