Acta mathematica scientia,Series B ›› 2011, Vol. 31 ›› Issue (1): 221-228.doi: 10.1016/S0252-9602(11)60222-1

• Articles • Previous Articles     Next Articles

MARKOV CHAIN-BASED ANALYSIS OF THE DEGREE DISTRIBUTION FOR A GROWING NETWORK

 HOU Zhen-Ting1, TONG Jin-Ying3, SHI Ding-Hua1,2   

  1. 1. School of Mathematical Science and Computing Technology, Central South University, Changsha |410075, China;
    2. Department of Mathematics, Shanghai University, Shanghai 200444, China;
    3. School of Sciences, Donghua University, Shanghai 201620, China
  • Received:2008-07-09 Revised:2008-11-25 Online:2011-01-20 Published:2011-01-20
  • Supported by:

    This research is supported by the National Natural Science Foundation (11071258, 60874083, 10872119, 10901164)

Abstract:

In this article, we focus on discussing the degree distribution of the DMS model from the perspective of probability. On the basis of  the concept and technique of first-passage probability in Markov theory, we provide a rigorous proof for existence of the steady-state degree distribution, mathematically re-deriving the exact formula of the distribution. The approach based on Markov chain theory is universal and performs well in a large class of growing networks.

Key words: Growing networks, preferential attachment, power law

CLC Number: 

  • 05C80
Trendmd