Planar unclustered scale-free graphs as models for technological and biological networks.

Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases — usually associated with topological restrictions — their clustering is low and they are almost planar. In this paper we introduce a family of graphs which share all these properties and are defined by two parameters. As their construction is deterministic, we obtain exact analytic expressions for relevant properties of the graphs including the degree distribution, degree correlation, diameter, and average distance, as a function of the two defining parameters. Thus, the graphs are useful to model some complex networks, in particular several families of technological and biological networks, and in the design of new practical communication algorithms in relation to their dynamical processes. They can also help understanding the underlying mechanisms that have produced their particular structure.

[1]  Ricard V. Solé,et al.  A Model of Large-Scale proteome Evolution , 2002, Adv. Complex Syst..

[2]  Roger Guimerà,et al.  Extracting the hierarchical organization of complex systems , 2007, Proceedings of the National Academy of Sciences.

[3]  Francesc Comellas,et al.  Modeling complex networks with self-similar outerplanar unclustered graphs ☆ , 2009 .

[4]  Jonathan P K Doye,et al.  Self-similar disk packings as model spatial scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  R. Solé,et al.  Information Theory of Complex Networks: On Evolution and Architectural Constraints , 2004 .

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

[7]  R. F. Cancho,et al.  Topology of technology graphs: small world patterns in electronic circuits. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Fan Chung Graham,et al.  Duplication Models for Biological Networks , 2002, J. Comput. Biol..

[9]  G. Fertin,et al.  High-dimensional Apollonian networks , 2005, cond-mat/0503316.

[10]  Zhongzhi Zhang,et al.  Self-similar non-clustered planar graphs as models for complex networks , 2008, Journal of Physics A: Mathematical and Theoretical.

[11]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[14]  R. Ferrer i Cancho,et al.  Scale-free networks from optimal design , 2002, cond-mat/0204344.

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

[16]  J. Guan,et al.  Maximal planar scale-free Sierpinski networks with small-world effect and power law strength-degree correlation , 2007, 0706.3490.

[17]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[18]  J. S. Andrade,et al.  Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs. , 2004, Physical review letters.

[19]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

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

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

[22]  André Raspaud,et al.  Recursive graphs with small-world scale-free properties. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[24]  Lili Rong,et al.  High-dimensional random Apollonian networks , 2005, cond-mat/0502591.

[25]  Francesc de Paula Comellas Padró,et al.  Modeling complex networks with self-similar outerplanar unclustered graphs , 2009 .

[26]  Reinhard Diestel,et al.  Graph Theory , 1997 .