Modularity of Complex Networks Models

Modularity is designed to measure the strength of division of a network into clusters (known also as communities). Networks with high modularity have dense connections between the vertices within clusters but sparse connections between vertices of different clusters. As a result, modularity is often used in optimization methods for detecting community structure in networks, and so it is an important graph parameter from a practical point of view. Unfortunately, many existing non-spatial models of complex networks do not generate graphs with high modularity; on the other hand, spatial models naturally create clusters. We investigate this phenomenon by considering a few examples from both sub-classes. We prove precise theoretical results for the classical model of random d-regular graphs as well as the preferential attachment model, and contrast these results with the ones for the spatial preferential attachment (SPA) model that is a model for complex networks in which vertices are embedded in a metric space, and each vertex has a sphere of influence whose size increases if the vertex gains an in-link, and otherwise decreases with time. The results obtained in this paper can be used for developing statistical tests for models selection and to measure statistical significance of clusters observed in complex networks.

[1]  Rory Wilson,et al.  Geometric Graph Properties of the Spatial Preferred Attachment model , 2011, ArXiv.

[2]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[3]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[4]  M. E. J. Newman,et al.  Power laws, Pareto distributions and Zipf's law , 2005 .

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

[6]  Shashank Khandelwal,et al.  Exploring biological network structure with clustered random networks , 2009, BMC Bioinformatics.

[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]  Alan M. Frieze,et al.  Some Typical Properties of the Spatial Preferred Attachment Model , 2012, Internet Math..

[9]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

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

[11]  Alan M. Frieze,et al.  A Geometric Preferential Attachment Model of Networks , 2006, Internet Math..

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

[13]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[14]  Rory Wilson,et al.  Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model , 2016, Internet Math..

[15]  Alan M. Frieze,et al.  High Degree Vertices and Eigenvalues in the Preferential Attachment Graph , 2005, Internet Math..

[16]  Deryk Osthus,et al.  Popularity based random graph models leading to a scale-free degree sequence , 2004, Discret. Math..

[17]  A. L. O N.  On the edge-expansion of graphs , 2002 .

[18]  Tao Zhou,et al.  Maximal planar networks with large clustering coefficient and power-law degree distribution. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[20]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[21]  Laurent Viennot,et al.  Asymptotic Modularity of Some Graph Classes , 2011, ISAAC.

[22]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

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

[24]  Boris G. Pittel,et al.  Note on the Heights of Random Recursive Trees and Random m-ary Search Trees , 1994, Random Struct. Algorithms.

[25]  Béla Bollobás,et al.  Random Graphs , 1985 .

[26]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[27]  W. Feller.  Generalization of a probability limit theorem of Cramér , 1943 .

[28]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

[29]  Amin Saberi,et al.  On certain connectivity properties of the Internet topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[30]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

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

[32]  Jeannette C. M. Janssen,et al.  Model Selection for Social Networks Using Graphlets , 2012, Internet Math..

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

[34]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[35]  Béla Bollobás,et al.  The Isoperimetric Number of Random Regular Graphs , 1988, Eur. J. Comb..

[36]  N. Wormald.  Models of random regular graphs , 2010 .

[37]  M. Newman.  Power laws, Pareto distributions and Zipf's law , 2005 .

[38]  Joel H. Spencer,et al.  Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.

[39]  Colin McDiarmid,et al.  Modularity of tree-like and random regular graphs , 2016, ArXiv.

[40]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

[42]  Sanjeev Khanna,et al.  The Power of Local Information in Social Networks , 2012, WINE.

[43]  Colin McDiarmid,et al.  Modularity in random regular graphs and lattices , 2013, Electron. Notes Discret. Math..

[44]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[45]  Anthony Bonato,et al.  Graph Searching Games and Probabilistic Methods , 2017 .

[46]  Paweł Prałat,et al.  Modularity of complex networks models , 2017 .

[47]  Anthony Bonato,et al.  A Spatial Web Graph Model with Local Influence Regions , 2007, Internet Math..

[48]  N. Wormald.  The differential equation method for random graph processes and greedy algorithms , 1999 .

[49]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[50]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[51]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[52]  Santo Fortunato,et al.  Limits of modularity maximization in community detection , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[53]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .