Evolving networks with disadvantaged long-range connections

Abstract

We consider a growing network, whose growth algorithm is based on the preferential attachment typical for scale-free constructions, but where the long-range bonds are disadvantaged. Thus, the probability to get connected to a site at distance $d$ is proportional to $d^{-α}$, where $α$ is a tunable parameter of the model. We show that the properties of the networks grown with $α<1$ are close to those of the genuine scale-free construction, while for $α>1$ the structure of the network is vastly different. Thus, in this regime, the node degree distribution is no more a power law, and it is well-represented by a stretched exponential. On the other hand, the small-world property of the growing networks is preserved at all values of $α$.