Asymptotic formula on average path length of fractal networks modelled on Sierpinski Gasket
classification
🧮 math.MG
keywords
networksasymptoticaverageevolvingformulagasketlengthpath
read the original abstract
In this paper, we introduce a new method to construct evolving networks based on the construction of the Sierpinski gasket. Using self-similarity and renewal theorem, we obtain the asymptotic formula for average path length of our evolving networks.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.