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

Abstract

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.

Accepted for publication in Physica A

References in corpus (9)

• The structure and function of complex networks
• Hierarchical structure and the prediction of missing links in networks
• Self-similarity of complex networks
• Extracting the hierarchical organization of complex systems
• Self-similar disk packings as model spatial scale-free networks
• Recursive graphs with small-world scale-free properties
• Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation
• High dimensional random Apollonian networks
• High Dimensional Apollonian Networks

Cited by in corpus (2)

• Random walks in modular scale-free networks with multiple traps
• Growth Patterns of Subway/Metro Systems Tracked by Degree Correlation