Community detection and visualization of networks with the map equation framework

Large networks contain plentiful information about the organization of a system. The challenge is to extract useful information buried in the structure of myriad nodes and links. Therefore, powerfu ...

[1]  Claude E. Shannon,et al.  A mathematical theory of communication , 1948, MOCO.

[2]  Ludo Waltman,et al.  A new methodology for constructing a publication-level classification system of science , 2012, J. Assoc. Inf. Sci. Technol..

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

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

[5]  Martin Rosvall,et al.  Memory in network flows and its effects on community detection, ranking, and spreading , 2014 .

[6]  Tiago P. Peixoto.  Hierarchical block structures and high-resolution model selection in large networks , 2013, ArXiv.

[7]  Martin Rosvall,et al.  Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems , 2010, PloS one.

[8]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[9]  Martin Rosvall,et al.  Compression of flow can reveal overlapping modular organization in networks , 2011, ArXiv.

[10]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[11]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[12]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[13]  Bram van Leer,et al.  Analysis and Implementation of , 2009 .

[14]  David M Blei,et al.  Efficient discovery of overlapping communities in massive networks , 2013, Proceedings of the National Academy of Sciences.

[15]  Ignacio Marín,et al.  Exploring the limits of community detection strategies in complex networks , 2013, Scientific Reports.

[16]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks: References , 2008 .

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

[18]  J. H. Ward.  Hierarchical Grouping to Optimize an Objective Function , 1963 .

[19]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[20]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[21]  Mauricio Barahona,et al.  Encoding dynamics for multiscale community detection: Markov time sweeping for the map equation. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  T. Masaki.  Structure and Dynamics , 2002 .

[23]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[24]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[26]  Gene H. Golub,et al.  Matrix computations , 1983 .

[27]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[28]  V A Traag,et al.  Narrow scope for resolution-limit-free community detection. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[30]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Carl T. Bergstrom,et al.  Mapping Change in Large Networks , 2008, PloS one.

[32]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[33]  S. Dongen.  Graph clustering by flow simulation , 2000 .

[34]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[35]  M. Newman.  Erratum: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality (Physical Review e (2001) 64 (016132)) , 2006 .

[36]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[37]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[38]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[39]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[40]  Alessandra Conversi,et al.  Comparative Analysis , 2009, Encyclopedia of Database Systems.

[41]  Martin Rosvall,et al.  Ranking and clustering of nodes in networks with smart teleportation , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[43]  Martin T. Dove.  Structure and Dynamics , 2003 .