有向网络的复制机制及其相关网络分析
PDF下载 (317)毛小燕,周晖杰.有向网络的复制机制及其相关网络分析[J].宁波大学学报(理工版),2015,28(02):28-31.DOI:
MAO Xiao-yan,ZHOU Hui-Jie.Copying Mechanism of Directed Networks and Relevant Networks Analysis[J].Journal of Ningbo University(Natural Science & Engineering Edition),2015,28(02):28-31.DOI:
| Title: | Copying Mechanism of Directed Networks and Relevant Networks Analysis |
| 作者: | 毛小燕, 周晖杰 |
| Author(s): | MAO Xiao-yan, ZHOU Hui-Jie |
| 关键词: | 有向网络; 复制模型; 自然数网络; 入度分布; 复制率 |
| Keywords: | directed networks; copying model; natural number network; in-degree distribution; copying rate |
| 分类号: | TP393; N94 |
| 文献标识码: | A |
| 摘要: | 鉴于有向网络比无向网络包含了更多的内在信息, 而复杂网络中的基本统计量往往仅适用于无向网络, 使得有向网络的研究相对缺少, 由此提出了一个有向网络的统计量, 并分析该统计量在相关有向网络研究中的有效性. 考虑到复制是有向网络增长的一个主要动力, 定义了有向网络结点复制率和有向网络复制率的概念, 并利用结点入度分布和复制率研究了有向规则网络、复制模型网络及自然数网络. 结果显示, 完全复制模型和自然数网络的入度具有无标度特性, 其入度分布的幂律指数 都为2, 2个有向网络的复制率 , 而部分复制模型的复制率 . 因此, 有向网络的入度分布、复制率都能很好地解释完全复制模型与自然数网络的相关性, 可作为重要统计量广泛应用于有向网络研究中. |
| Abstract: | Directed networks contain much more internal information than undirected ones. Many of the basic statistics for complex networks can only be applied to undirected networks, causing relative lack in the research on directed ones. To remedy this shortcoming, the paper proposes the concept of copying rate and analyzes the effectiveness of the statistics for directed networks. Based on statistics of in-degree distribution and copying rate for directed networks, the directed regular networks are selected for study purposes, including both the copying model networks and natural number network. On the rigorous derivation in in-degree distribution and copying rate of directed networks, the result reveals that completely copying model and natural number network have a power-law in-degree distribution with , and copying rate for completely copying model and natural number network is 1, which explains the correlation between completely copying model and natural number network. |
| 参考文献 /References: | [1] Barabási A L, Albert R and Jeong H. Mean-field theory for scale-free random networks[J]. Physica A, 1999, 272:173-187. [2] Du Yuxian, Gao Cai, Hu Yong, et al. A new method of identifying influential nodes in complex networks based on TOPSIS[J]. Physica A, 2014, 399:57-69. [3] Newman M E J. Assortative mixing in networks[J]. Phys Rev Lett, 2002, 89(20):1-5. [4] 毛小燕. 增长网络结点度相关性的混合系数[J]. 宁波大学学报: 理工版, 2011, 24(4):92-96. [5] Gnana T, Mahendra P, Dharshana K, et al. Node assortativity in complex networks: An alternative approach [J]. Procedia Computer Science, 2014, 29:2449-2461. [6] Broder A, Kumar S R, Maghoul F, et al. Graph structure in the web[J]. Computer Networks, 2000, 33:309-320. [7] Krapivsky P L, Redner S. Network growth by copying[J]. Phys Rev E, 2005, 36118(71):1-7. [8] 史定华, 周晖杰. 自然数网络和素数定理[J]. 复杂系统与复杂性科学, 2010, 7(4):52-54. |
| 备注/Memo: | 收稿日期: 2014－08－29. 宁波大学学报（理工版）网址: http://journallg.nbu.edu.cn/基金项目: 浙江省教育厅科研项目（Y201326771）; 宁波市自然科学基金（2013A610100）.第一作者: 毛小燕（1980－）, 女, 浙江衢州人, 讲师, 主要研究方向: 模糊数学与逻辑代数. E-mail: maoxiaoyan@nbu.edu.cn 宁波大学学报（理工版）网址：http://journallg.nbu.edu.cn/ |
