Properties of a new small-world network with spatially biased random shortcuts

Ryo Matsuzawa, Jun Tanimoto, Eriko Fukuda

Research output: Contribution to journalArticle

Abstract

This paper introduces a small-world (SW) network with a power-law distance distribution that differs from conventional models in that it uses completely random shortcuts. By incorporating spatial constraints, we analyze the divergence of the proposed model from conventional models in terms of fundamental network properties such as clustering coefficient, average path length, and degree distribution. We find that when the spatial constraint more strongly prohibits a long shortcut, the clustering coefficient is improved and the average path length increases. We also analyze the spatial prisoner's dilemma (SPD) games played on our new SW network in order to understand its dynamical characteristics. Depending on the basis graph, i.e., whether it is a one-dimensional ring or a two-dimensional lattice, and the parameter controlling the prohibition of long-distance shortcuts, the emergent results can vastly differ.

Original languageEnglish
Pages (from-to)408-415
Number of pages8
JournalPhysica A: Statistical Mechanics and its Applications
Volume486
DOIs
Publication statusPublished - Nov 15 2017

Fingerprint

Small-world Network
Biased
Clustering Coefficient
Path Length
prohibition
Distance Distribution
Prisoner's Dilemma Game
Power-law Distribution
games
Degree Distribution
coefficients
Divergence
divergence
Model
Ring
rings
Graph in graph theory

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Condensed Matter Physics

Cite this

Properties of a new small-world network with spatially biased random shortcuts. / Matsuzawa, Ryo; Tanimoto, Jun; Fukuda, Eriko.

In: Physica A: Statistical Mechanics and its Applications, Vol. 486, 15.11.2017, p. 408-415.

Research output: Contribution to journalArticle

@article{8e3b36b71ed54996a496513fe0b57705,
title = "Properties of a new small-world network with spatially biased random shortcuts",
abstract = "This paper introduces a small-world (SW) network with a power-law distance distribution that differs from conventional models in that it uses completely random shortcuts. By incorporating spatial constraints, we analyze the divergence of the proposed model from conventional models in terms of fundamental network properties such as clustering coefficient, average path length, and degree distribution. We find that when the spatial constraint more strongly prohibits a long shortcut, the clustering coefficient is improved and the average path length increases. We also analyze the spatial prisoner's dilemma (SPD) games played on our new SW network in order to understand its dynamical characteristics. Depending on the basis graph, i.e., whether it is a one-dimensional ring or a two-dimensional lattice, and the parameter controlling the prohibition of long-distance shortcuts, the emergent results can vastly differ.",
author = "Ryo Matsuzawa and Jun Tanimoto and Eriko Fukuda",
year = "2017",
month = "11",
day = "15",
doi = "10.1016/j.physa.2017.05.031",
language = "English",
volume = "486",
pages = "408--415",
journal = "Physica A: Statistical Mechanics and its Applications",
issn = "0378-4371",
publisher = "Elsevier",

}

TY - JOUR

T1 - Properties of a new small-world network with spatially biased random shortcuts

AU - Matsuzawa, Ryo

AU - Tanimoto, Jun

AU - Fukuda, Eriko

PY - 2017/11/15

Y1 - 2017/11/15

N2 - This paper introduces a small-world (SW) network with a power-law distance distribution that differs from conventional models in that it uses completely random shortcuts. By incorporating spatial constraints, we analyze the divergence of the proposed model from conventional models in terms of fundamental network properties such as clustering coefficient, average path length, and degree distribution. We find that when the spatial constraint more strongly prohibits a long shortcut, the clustering coefficient is improved and the average path length increases. We also analyze the spatial prisoner's dilemma (SPD) games played on our new SW network in order to understand its dynamical characteristics. Depending on the basis graph, i.e., whether it is a one-dimensional ring or a two-dimensional lattice, and the parameter controlling the prohibition of long-distance shortcuts, the emergent results can vastly differ.

AB - This paper introduces a small-world (SW) network with a power-law distance distribution that differs from conventional models in that it uses completely random shortcuts. By incorporating spatial constraints, we analyze the divergence of the proposed model from conventional models in terms of fundamental network properties such as clustering coefficient, average path length, and degree distribution. We find that when the spatial constraint more strongly prohibits a long shortcut, the clustering coefficient is improved and the average path length increases. We also analyze the spatial prisoner's dilemma (SPD) games played on our new SW network in order to understand its dynamical characteristics. Depending on the basis graph, i.e., whether it is a one-dimensional ring or a two-dimensional lattice, and the parameter controlling the prohibition of long-distance shortcuts, the emergent results can vastly differ.

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

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

U2 - 10.1016/j.physa.2017.05.031

DO - 10.1016/j.physa.2017.05.031

M3 - Article

AN - SCOPUS:85020793905

VL - 486

SP - 408

EP - 415

JO - Physica A: Statistical Mechanics and its Applications

JF - Physica A: Statistical Mechanics and its Applications

SN - 0378-4371

ER -