Scale-Free Networks from Vertex Rank.

• YANAI Kohsuke

  Graduate School of Frontier Sciences, The University of Tokyo Central Research Laboratory, Hitachi Ltd.

• IBA Hitoshi

  Graduate School of Frontier Sciences, The University of Tokyo

Bibliographic Information

Other Title

• ネットワークが創発する知能　　ノード順位による選択を用いたスケールフリー・ネットワークモデル
• ノード順位による選択を用いたスケールフリー・ネットワークモデル
• ノード ジュンイ ニ ヨル センタク オ モチイタ スケールフリー ネットワーク モデル

Abstract

We propose a novel model for scale-free networks that uses a rank-based selection. The proposed model produces networks according to the rank assigned to each node. It selects a certain number of nodes randomly and makes two evenly-divided groups of selected nodes. It then adds a new link between the two nodes which have the highest rank in each group. By repeating these steps, scale-free networks are generated. In this paper, we show that networks obtained from our model have a scale-free property through a theoretical proof and simulation results. These results indicate that the exponent of the degree distribution is roughly equivalent to 1. We also discuss the difference from the previous models and its applications to real-world networks.

Journal

• Computer Software

  Computer Software 24 (1), 50-61, 2007

  Japan Society for Software Science and Technology

Details

• CRID: 1390001204737060864
• NII Article ID: 110006163667
• NII Book ID: AN10075819
• DOI: 10.11309/jssst.24.1_50
• NDL BIB ID: 8668428
• ISSN: 02896540
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I8668428
• Text Lang: ja
• Data Source:
  • JaLC
  • NDL
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed