Degree distribution of a scale-free random graph model

被引:1
作者
Tan, Li [1 ,2 ]
Hou, Zhen Ting [1 ]
Liu, Xin Ru [1 ]
机构
[1] Cent S Univ, Sch Math, Changsha 410075, Peoples R China
[2] Cent S Univ, Sch Traff & Transportat Engn, Changsha 410075, Peoples R China
基金
中国国家自然科学基金;
关键词
Degree distribution; scale-free; Markov chains; RANDOM NETWORKS; DEGREE SEQUENCE; WEB;
D O I
10.1007/s10114-012-9365-2
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we consider the degree distribution of a general random graph with multiple edges and loops from the perspective of probability. Based on the first-passage probability of Markov chains, we give a new and rigorous proof to the existence of the network degree distribution and obtain the precise expression of the degree distribution. The analytical results are in good agreement with numerical simulations.
引用
收藏
页码:587 / 598
页数:12
相关论文
共 15 条
[1]   Internet -: Diameter of the World-Wide Web [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 1999, 401 (6749) :130-131
[2]   Mean-field theory for scale-free random networks [J].
Barabási, AL ;
Albert, R ;
Jeong, H .
PHYSICA A, 1999, 272 (1-2) :173-187
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   The degree sequence of a scale-free random graph process [J].
Bollobás, B ;
Riordan, O ;
Spencer, J ;
Tusnády, G .
RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (03) :279-290
[5]   Popularity based random graph models leading to a scale-free degree sequence [J].
Buckley, PG ;
Osthus, D .
DISCRETE MATHEMATICS, 2004, 282 (1-3) :53-68
[6]   A general model of web graphs [J].
Cooper, C ;
Frieze, A .
RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (03) :311-335
[7]   Structure of growing networks with preferential linking [J].
Dorogovtsev, SN ;
Mendes, JFF ;
Samukhin, AN .
PHYSICAL REVIEW LETTERS, 2000, 85 (21) :4633-4636
[9]  
Hou Z. T., 2009, P COMPLEX, P1827
[10]  
Hou ZT, 2010, ACTA MATH SCI, V30, P1523