title: Reverse preferential spread in complex networks.
abstract: Large-degree nodes may have a larger influence on the network, but they can be bottlenecks for spreading information since spreading attempts tend to concentrate on these nodes and become redundant. We discuss that the reverse preferential spread (distributing information inversely proportional to the degree of the receiving node) has an advantage over other spread mechanisms. In large uncorrelated networks, we show that the mean number of nodes that receive information under the reverse preferential spread is an upper bound among any other weight-based spread mechanisms, and this upper bound is indeed a logistic growth independent of the degree distribution.
authors.affiliation: Waseda University, Nishi-waseda 1-6-1, Shinjuku, Tokyo JP-169-8050, Japan.
authors.forename: Hiroshi
authors.initials: H
authors.lastname: Toyoizumi
authors.forename: Seiichi
authors.initials: S
authors.lastname: Tani
authors.forename: Naoto
authors.initials: N
authors.lastname: Miyoshi
authors.forename: Yoshio
authors.initials: Y
authors.lastname: Okamoto