In this work, we analyze gossip spreading on weighted networks. We try to define a new metric to classify weighted complex networks using our model. The model proposed here is based on the gossip spreading model introduced by Lind et al. on unweighted networks. The new metric is based on gossip...

Network systems evolving by preferential attachment of new vertices and by link loading are considered. The probability of node attaching is assumed to depend linearly on degrees of existing nodes to which new ones are connected. The rule of the network loading allows both deterministic and...