Multifractal network generator

We introduce a new approach to constructing networks with realistic features. Our method, in spite of its conceptual simplicity (it has only two parameters) is capable of generating a wide variety of network types with prescribed statistical properties, e.g., with degree or clustering coefficient distributions of various, very different forms. In turn, these graphs can be used to test hypotheses or as models of actual data. The method is based on a mapping between suitably chosen singular measures defined on the unit square and sparse infinite networks. Such a mapping has the great potential of allowing for graph theoretical results for a variety of network topologies. The main idea of our approach is to go to the infinite limit of the singular measure and the size of the corresponding graph simultaneously. A very unique feature of this construction is that with the increasing system size the generated graphs become topologically more structured. We present analytic expressions derived from the parameters of the—to be iterated—initial generating measure for such major characteristics of graphs as their degree, clustering coefficient, and assortativity coefficient distributions. The optimal parameters of the generating measure are determined from a simple simulated annealing process. Thus, the present work provides a tool for researchers from a variety of fields (such as biology, computer science, biology, or complex systems) enabling them to create a versatile model of their network data.

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

[2]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[3]  Béla Bollobás,et al.  Handbook of large-scale random networks , 2008 .

[4]  T. Nepusz,et al.  Likelihood-based Clustering of Directed Graphs , 2007, 2007 International Symposium on Computational Intelligence and Intelligent Informatics.

[5]  M. A. Muñoz,et al.  Scale-free networks from varying vertex intrinsic fitness. , 2002, Physical review letters.

[6]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[7]  Albert-Laszlo Barabasi,et al.  Deterministic scale-free networks , 2001 .

[8]  R. Pastor-Satorras,et al.  Class of correlated random networks with hidden variables. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[10]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[11]  Stephen G. Kobourov,et al.  Graph-Drawing Contest Report , 1994, GD.

[12]  Peng Wang,et al.  Recent developments in exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[13]  Gábor E. Tusnády,et al.  Reconstructing Cortical Networks: Case of Directed Graphs with High Level of Reciprocity , 2008 .

[14]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[15]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[16]  Lev Nachmanson,et al.  Graph Drawing Contest Report , 2009, Graph Drawing.

[17]  G. Bianconi.  The entropy of randomized network ensembles , 2007, 0708.0153.

[18]  Priya Mahadevan,et al.  Systematic topology analysis and generation using degree correlations , 2006, SIGCOMM.

[19]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[20]  M. Newman,et al.  Solution of the two-star model of a network. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[22]  M. DePamphilis,et al.  HUMAN DISEASE , 1957, The Ulster Medical Journal.

[23]  Béla Bollobás,et al.  Random Graphs and Branching Processes , 2008 .

[24]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[25]  A. Barab.  Deterministic scale-free networks , 2007 .

[26]  R. Carter.  11 – IT and society , 1991 .

[27]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

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

[29]  Christos Faloutsos,et al.  Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication , 2005, PKDD.

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

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

[32]  Christos Faloutsos,et al.  Scalable modeling of real graphs using Kronecker multiplication , 2007, ICML '07.

[33]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

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

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

[36]  S. Nechaev,et al.  On scale-free and poly-scale behaviors of random hierarchical networks , 2008, 0811.4518.

[37]  A. Barabasi,et al.  The human disease network , 2007, Proceedings of the National Academy of Sciences.

[38]  B. Bollobás.  The evolution of random graphs , 1984 .

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

[40]  Béla Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007, Random Struct. Algorithms.

[41]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

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

[43]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[44]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[45]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[46]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[47]  Martin Suter,et al.  Small World , 2002 .

[48]  S. Wasserman,et al.  Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp , 1996 .