Properties of weighted complex networks

We study two kinds of weighted networks, weighted small-world (WSW) and weighted scale-free (WSF). The weight w(ij) of a link between nodes i and j in the network is defined as the product of endpoint node degrees; that is w(ij) = (k(i)k(j))(theta). In contrast to adding weights to links when networks are being constructed, we only consider weights depending on the "popularity" of the nodes represented by their connectivity. It was found that both weighted networks have broad distributions on the characterization of the link weight, the vertex strength, and the average shortest path length. Furthermore, as a survey of the model, the epidemic spreading process in both weighted networks was studied based on the standard susceptible-infected (SI) model. The spreading velocity reaches a peak very quickly after the infection outbreaks and an exponential decay was found in the long time propagation.