| 注册
首页|期刊导航|计算机工程|一种定量评估复杂网络节点重要度的算法

一种定量评估复杂网络节点重要度的算法

张益

计算机工程2011,Vol.37Issue(20):87-88,96,3.
计算机工程2011,Vol.37Issue(20):87-88,96,3.DOI:10.3969/j.issn.1000-3428.2011.20.030

一种定量评估复杂网络节点重要度的算法

Quantitative Evaluation Algorithm for Node Importance of Complex Networks

张益1

作者信息

  • 1. 重庆师范大学资产管理处,重庆400047
  • 折叠

摘要

Abstract

This paper applies the gray relation analysis theory to the ascertain of the node importance of complex network, and defines suppositional perfect "kernel node". It takes the gray correlation degree as measure to evaluate the correlation degree of every node of the network and the perfect "kernel node", more correlation degree more important in the network. Simulation results show the algorithm is effective, and its operation speed is fast. It can get perfect calculation capability in large-sized complex network.

关键词

复杂网络/灰色关联分析/关联系数/节点重要度/无标度

Key words

complex networks/ gray relation analysis/ relation coefficient/ node importance/ scale-free

分类

信息技术与安全科学

引用本文复制引用

张益..一种定量评估复杂网络节点重要度的算法[J].计算机工程,2011,37(20):87-88,96,3.

基金项目

重庆市自然科学基金资助项目(CSTC,2010BB2090) (CSTC,2010BB2090)

计算机工程

OACSCDCSTPCD

1000-3428

访问量0
|
下载量0
段落导航相关论文