ASYMPTOTIC FORMULA ON AVERAGE PATH LENGTH OF A SPECIAL NETWORK BASED ON SIERPINSKI CARPET

Abstract

In this paper, we construct a special network based on the construction of the Sierpinski carpet. Using the self-similarity and renewal theorem, we obtain the asymptotic formula for the average path length of our evolving network.