Generation of networks with prescribed degree-dependent clustering

We propose a systematic, rigorous mathematical optimization methodology for the construction, “on demand,” of network structures that are guaranteed to possess a prescribed collective property: the degree-dependent clustering. The ability to generate such realizations of networks is important not only for creating artificial networks that can perform desired functions, but also to facilitate the study of networks as part of other algorithms. This problem exhibits large combinatorial complexity and is difficult to solve with off-the-shelf commercial optimization software. To that end, we also present a customized preprocessing algorithm that allows us to judiciously fix certain problem variables and, thus, significantly reduce computational times. Results from the application of the framework to data sets resulting from simulations of an acquaintance network formation model are presented.

[1]  E. Volz,et al.  Random networks with tunable degree distribution and clustering. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

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

[4]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

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

[6]  N. Wormald Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.

[7]  Ioannis G. Kevrekidis,et al.  Equation-free: The computer-aided analysis of complex multiscale systems , 2004 .

[8]  Persi Diaconis,et al.  A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees , 2011, Internet Math..

[9]  Han Hoogeveen,et al.  Seven criteria for integer sequences being graphic , 1991, J. Graph Theory.

[10]  S. Hakimi On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[11]  M. Newman Properties of highly clustered networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[13]  R. Pastor-Satorras,et al.  Epidemic spreading in correlated complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Jing Yang,et al.  Network Models and Financial Stability , 2007 .

[15]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[16]  Marián Boguñá,et al.  Tuning clustering in random networks with arbitrary degree distributions. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Albert-László Barabási,et al.  Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  P. Pardalos,et al.  Clustering challenges in biological networks , 2009 .

[19]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[20]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[21]  Panos M. Pardalos,et al.  A Retrospective Review of Social Networks , 2009, 2009 International Conference on Advances in Social Network Analysis and Mining.

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

[23]  Alessandro Vespignani,et al.  Topology and correlations in structured scale-free networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[25]  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.

[26]  C. Floudas Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications , 1995 .

[27]  S. N. Dorogovtsev,et al.  How to construct a correlated net , 2002 .

[28]  R. Axelrod The Complexity of Cooperation , 2011 .

[29]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

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

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

[32]  D. Watts,et al.  Influentials, Networks, and Public Opinion Formation , 2007 .

[33]  S. Strogatz Exploring complex networks , 2001, Nature.

[34]  T. Valente Social network thresholds in the diffusion of innovations , 1996 .

[35]  Clayton W. Commander,et al.  Identifying Critical Nodes in Protein-Protein Interaction Networks , 2009 .

[36]  Christos Faloutsos,et al.  R-MAT: A Recursive Model for Graph Mining , 2004, SDM.

[37]  Alessandro Vespignani,et al.  Multiscale mobility networks and the spatial spreading of infectious diseases , 2009, Proceedings of the National Academy of Sciences.

[38]  Beom Jun Kim Performance of networks of artificial neurons: the role of clustering. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Andrew D. Huberman,et al.  Finger-length ratios and sexual orientation , 2000, Nature.

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

[41]  Stefan Bornholdt,et al.  Emergence of a small world from local interactions: modeling acquaintance networks. , 2002, Physical review letters.

[42]  Qiang Qiang,et al.  A unified network performance measure with importance identification and the ranking of network components , 2007, Optim. Lett..

[43]  Panos M. Pardalos,et al.  Complexity analysis for maximum flow problems with arc reversals , 2010, J. Comb. Optim..

[44]  J. Hopcroft,et al.  Are randomly grown graphs really random? , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[45]  Mona Singh,et al.  A Compact Mathematical Programming Formulation for DNA Motif Finding , 2006, CPM.

[46]  C. W. Gear,et al.  Equation-Free, Coarse-Grained Multiscale Computation: Enabling Mocroscopic Simulators to Perform System-Level Analysis , 2003 .

[47]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[48]  Mona Singh,et al.  A combinatorial optimization approach for diverse motif finding applications , 2006, Algorithms for Molecular Biology.

[49]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[50]  Neo D. Martinez,et al.  Simple rules yield complex food webs , 2000, Nature.

[51]  Peihua Fu,et al.  An Evolving Scale-free Network with Large Clustering Coefficient , 2006, 2006 9th International Conference on Control, Automation, Robotics and Vision.

[52]  M. Jackson,et al.  The Effects of Social Networks on Employment and Inequality , 2004 .