Lattice scale-free networks with weighted linking

Abstract

Recently, models of the scale-free (SF) networks on lattices were investigated, which consider the influence of the embedded space on the networks. Since a lot of real networks exist on the 2D global surface, it is helpful to discuss these models. In this paper, based on the lattice SF networks model, a linking weight is added, thus an additional parameter which can control the clustering coefficient is introduced. Depending on the linking weight, the properties of the model change smoothly from the lattice SF model to the SF random graphs.