4.6 Article

A directed weighted scale-free network model with an adaptive evolution mechanism

出版社

ELSEVIER
DOI: 10.1016/j.physa.2021.125897

关键词

Directed weighted networks; Weight evolution; Scale free; Strength distributions

资金

  1. National Natural Science Foundation of China [62076104, 61573004, 11871231]
  2. Natural Science Foundation of Fujian Province, PR China [2019J01065]
  3. Program for New Century Excellent Talents in Fujian Province University, PR China
  4. Subsidized Project for Postgraduates' Innovative Fund in Scientific Research of Huaqiao University, PR China

向作者/读者索取更多资源

This paper introduces a strength-based directed weighted scale-free network model, and through theoretical analysis and simulations, it demonstrates the network characteristics and discusses the relationship between the power-law exponent and parameters.
Based on the fact that most of real networks are directed and weighted, and the breeding of new connections generally affects the communication capacity of neighbor nodes, this paper proposes a strength-based instead of degree-based directed weighted scale-free network model where an adaptive weight evolution mechanism is introduced, and the newly added edges between existing nodes besides between existing nodes and the new node are involved in. Theoretical analysis shows the strength (in-strength and out-strength) distribution as well as degree (in-degree and out-degree) distribution of networks generated by our presented model follow a power law distribution, indicating the network is with scale-free characteristic, and the power-law exponent is independent of network size, but depends on the basic edge weight, the weight increment and the number of newly added edges. Numerous simulations further verify that numerical results are well consistent with the theoretical results, and the dependence of power-law exponents on the aforementioned parameters are also analyzed and discussed. In addition, the topological characteristics of the directed weighted scale-free network, such as the average clustering coefficient and the average path length, are demonstrated as well. (C) 2021 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据