A network model generated from the recursive graph based on polygon

摘要

The study of network models is one of the most challenging research fields among the studies of complex networks, which have been the hot research topics in recent decades. In this paper, we construct a deterministic network by a mapping method based on a recursive graph, and analyze its topological characteristics, including degree distribution, clustering coefficient, network diameter, average path length and degree correlations. We obtain that this network has the small-world property and positive correlation. The network modeling as we present gives a new perspective on networks, and helps to understand better the evolutions of the real-life systems, making it possible to explore the complexity of complex systems.