Random continuous model of scale-free networks

被引:0
作者
Xianmin Geng
机构
[1] Nanjing University of Aeronautics and Astronautics,College of Science
来源
Journal of Systems Science and Complexity | 2011年 / 24卷
关键词
Counting processes; degree distribution; scaling exponent; scale-free networks;
D O I
暂无
中图分类号
学科分类号
摘要
There are a lot of continuous evolving networks in real world, such as Internet, www network, etc. The evolving operation of these networks are not an equating interval of time by chance. In this paper, the author proposes a new mathematical model for the mechanism of continuous single preferential attachment on the scale free networks, and counts the distribution of degree using stochastic analysis. Namely, the author has established the random continuous model of the network evolution of which counting process determines the operating number, and has proved that this system self-organizes into scale-free structures with scaling exponent γ = 3+ α/m.
引用
收藏
页码:218 / 224
页数:6
相关论文
共 17 条
[1]  
Barabási A. L.(1999)Emergence of scaling in random networks Science 28 509-512
[2]  
Albert R.(2001)Exploring complex networks Nature 410 268-276
[3]  
Strogatz S. H.(1999)Growth dynamics of the World-Wide Web Nature 401 131-97
[4]  
Huberman B. A.(1999)Statistical mechanics of complex networks Rev. Mod. Phys. 74 47-5237
[5]  
Adamic L. A.(2000)Topology of evolving networks: Local events and universality Phys. Rev. Lett. 85 5234-97
[6]  
Albert R.(2002)Statistical mechanics of complex networks Rev. of Modern Phy. 74 47-290
[7]  
Barabási A. L.(2001)The degree sequence of a scale-free random graph process Random Structures and Algorithms 18 279-67
[8]  
Albert R.(1998)Collective dynamics of small-world networks Nature 393 440-undefined
[9]  
Barabási A. L.(1967)The small world problem Psychology Today 2 61-undefined
[10]  
Albert R.(undefined)undefined undefined undefined undefined-undefined