期刊文献+

无标度网络累积分布的新方法

New method for cumulative distribution of scale-free network
下载PDF
导出
摘要 以算法的方式给出了具有无标度性的极大平面图网络,计算了极大平面图网络模型的顶点累积分布和边累积分布,并验证二者的等价性。此外,按照混合方式的不同,提出了新的统计指标:边点混合累积分布。随后,提出猜想:采用线性混合方式的边点混合累积分布与顶点累积分布是等价的。此猜想为全方位、多角度的探讨无标度网络提供了新视角。 By applying algorithm method, the maximal planar network with scale-free properties is em- ployed. The cumulative degree distribution and edge-cumulative degree distribution are computed, and the equivalence between them is testified. Besides, the new statistical index, namely, the mix cumulative distribution between edge and vertex on the basis of different mixed method is provided. A conjecture: If the mixed mode is linear, the mix cumulative distribution is equivalent to cumulative distribution is pro- posed. This conjecture makes a contribution to discussing scale-free network by applying all-round and multi-angle standpoint.
作者 王晓敏 姚兵
出处 《中山大学学报(自然科学版)》 CAS CSCD 北大核心 2017年第3期41-45,共5页 Acta Scientiarum Naturalium Universitatis Sunyatseni
基金 国家自然科学基金(61163054 61363060 61662066)
关键词 无标度网络 顶点累积分布 边累积分布 幂律分布 scale-free network vertex cumulative distribution edge-cumulative distribution power lawdistribution
  • 相关文献

参考文献5

二级参考文献89

  • 1RADIA PERLMAN. Hierarchical networks and the sub- network partition problem [ J ]. Computer Networks and ISDN Systems, 1985, 9 : 297 - 303.
  • 2YAO B, ZHOU X Q, ZHANG J J, et al. Labellings and invariants of models from complex networks [ C ]// Pro- ceeding of 2012 International Conference on Systems and Informatics, 2012 : 1616 - 1620.
  • 3YAO B, CHEN X E, ZHOU X Q, et al. Graphs related with scale-free networks [ C ]//Proceeding of The 2n In- ternational Conference on Electronics, Communications and Control, 2012- 284 - 287.
  • 4YAO B, CHEN X E, YANG C, et al. Spanning trees and dominating sets in scale-free networks [ C ]// Pro- ceeding of 2012 IET International Conference on Informa- tion Science and Control Engineering, 2012:111 -115.
  • 5FERNAU H, KNEIS J, KRATSCH D, et al. An exact algorithm for the maximum leaf spanning tree problem [ J]. Theoretical Computer Science, 2011, 412 (45) : 6290 - 6302.
  • 6GAREY M R, JOHNSON D S. Computers and intracta- bility: a guide to the theory of NP-completeness [ M ]. New York : W H Freeman and Company, 1979.
  • 7BARABSI A L, BONABEAU E. Scale-free networks [ J]. Scientific American, 2003, 288: 60- 69.
  • 8Watts D J, Strogatz S H. Collective dynamics of ' small- world' networks. Nature, 1998, 393(6684): 440-442.
  • 9Barabasi A L, Albert R. Emergence of scaling in random networks. Science, 1999, 286(5439): 509-512.
  • 10Kumar R, Raghavan P, Rajagopalan S, et al. Stochastic models for the web graph//Proceedings of the 41st Annual Symposium on Foundations of Computer Science. California, USA, 2000:57- 65.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部