Degree Distribution Analysis of a Random Graph Process Based on Markov Chains
In this paper,we investigate a growing random graph process,which allows loops and multiple edges.Based on the first-passage probability of Markov chains,we provide a rigorous and straightforward proof to the existence of the degree distribution of a random graph process,and finally show the precise expression of degree distribution.Numerical simulations reveal that our theoretical derivations are consistent with simulation values.
Random graph Degree distribution Markov chains First-passage probability
Li Tan Zhenting Hou Xiangxing Kong Qinggui Zhao
School of Mathematics,Central South University,Changsha,Hunan,410075,China School of athematics,Central South University,Changsha,Hunan,410075,China School of Mathematics,Chongqing University of Arts and Sciences,Chongqing,402160,China
国际会议
张家界
英文
394-401
2009-09-20(万方平台首次上网日期,不代表论文的发表时间)