Complex networks modeled on the Sierpinski gasket

Abstract

In this paper, we use the Sierpinski gasket to construct evolving networks Gt whose node set is the solid regular triangles in the construction of the Sierpinski gasket up to the stage t and any two nodes are neighbors if and only if the corresponding solid triangles are in contact with each other on boundary. Using the encoding method, we show that our evolving networks are scale-free (power-law degree distribution) and have the small-world effect (small average path length and high clustering coefficient).