Reverse preferential spread in complex networks

Hiroshi Toyoizumi, Seiichi Tani, Naoto Miyoshi, Yoshio Okamoto

Research output: Contribution to journalArticle

7 Citations (Scopus)

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.

Original languageEnglish
Article number021103
JournalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Volume86
Issue number2
DOIs
Publication statusPublished - 2012 Aug 3

Fingerprint

Complex Networks
Reverse
Vertex of a graph
distributing
logistics
Upper bound
Logistic Growth
Degree Distribution
Directly proportional
Tend

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Statistical and Nonlinear Physics
  • Statistics and Probability

Cite this

Reverse preferential spread in complex networks. / Toyoizumi, Hiroshi; Tani, Seiichi; Miyoshi, Naoto; Okamoto, Yoshio.

In: Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, Vol. 86, No. 2, 021103, 03.08.2012.

Research output: Contribution to journalArticle

@article{d5ef4434c5e342acb56a71783871efa7,
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.",
author = "Hiroshi Toyoizumi and Seiichi Tani and Naoto Miyoshi and Yoshio Okamoto",
year = "2012",
month = "8",
day = "3",
doi = "10.1103/PhysRevE.86.021103",
language = "English",
volume = "86",
journal = "Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics",
issn = "1063-651X",
publisher = "American Physical Society",
number = "2",

}

TY - JOUR

T1 - Reverse preferential spread in complex networks

AU - Toyoizumi, Hiroshi

AU - Tani, Seiichi

AU - Miyoshi, Naoto

AU - Okamoto, Yoshio

PY - 2012/8/3

Y1 - 2012/8/3

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84864591354&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864591354&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.86.021103

DO - 10.1103/PhysRevE.86.021103

M3 - Article

AN - SCOPUS:84864591354

VL - 86

JO - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

JF - Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics

SN - 1063-651X

IS - 2

M1 - 021103

ER -