Reverse preferential spread in complex networks

Hiroshi Toyoizumi*, Seiichi Tani, Naoto Miyoshi, Yoshio Okamoto

*この研究の対応する著者

研究成果: Article査読

9 被引用数 (Scopus)

抄録

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.

本文言語English
論文番号021103
ジャーナルPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
86
2
DOI
出版ステータスPublished - 2012 8 3

ASJC Scopus subject areas

  • 統計物理学および非線形物理学
  • 統計学および確率
  • 凝縮系物理学

フィンガープリント

「Reverse preferential spread in complex networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル