A SUFFICIENT CONDITION FOR CLASSIFIED NETWORKS TO POSSESS COMPLEX NETWORK FEATURES

被引:0
|
作者
Geng, Xianmin [1 ]
Zhou, Shengli [1 ]
Tang, Jiashan [2 ]
Yang, Cong [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing 210016, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Coll Sci, Nanjing 210046, Jiangsu, Peoples R China
关键词
Scale free network; Clustering coefficient; Graph-valued stochastic process; Markovian process;
D O I
10.3934/nhm.2012.7.59
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We investigate network features for complex networks. A sufficient condition for the limiting random variable to possess the scale free property and the high clustering property is given. The uniqueness and existence of the limit of a sequence of degree distributions for the process is proved. The limiting degree distribution and a lower bound of the limiting clustering coefficient of the graph-valued Markov process are obtained as well.
引用
收藏
页码:59 / 69
页数:11
相关论文
共 50 条