COMPLEX NETWORKS GENERATED BY A SELF-SIMILAR PLANAR FRACTAL

Abstract

Many complex networks have scale-free and small-world effects. In this paper, a family of evolving networks is constructed modeled by a non-symmetric self-similar planar fractal, using the encoding method in fractal geometry. Based on the self-similar structure, we study the degree distribution, clustering coefficient and average path length of our evolving network to verify their scale-free and small-world characteristics.