Abstract:

There are three important structural features in complex networks: small-world effect, scale-free property and network’s navigability. Typical models reflecting these features, respectively, are the Watts-Strogatz’s model, the Barabási-Albert’s model and the Kleinberg’s model. Based on the typical models, a new model of growing and navigable networks is proposed, with the generated networks possessing all these features simultaneously. The results of navigation obtained by using a greedy algorithm on networks of the model are similar to, or even better than, that of the Kleinberg’s model.

Key words: complex network; small-world effect; scale-free property; network’s navigability; greedy algorithm