COMPLEX NETWORKS MODELED ON A KIND OF SIERPIŃSKI-LIKE CARPET

Abstract

In this paper, we use a kind of Sierpiński-like carpet to construct a special evolving network, whose nodes are all the solid squares in the construction of the carpet up to stage t. In our network, two nodes are neighbors if and only if the intersection of their corresponding squares is a line segment. Using the encoding method in fractal geometry, we show that our evolving network is scale-free and has the small-world effect, but is not fractal scaling.