中国物理B ›› 2010, Vol. 19 ›› Issue (12): 120503-120503.doi: 10.1088/1674-1056/19/12/120503

• • 上一篇    下一篇

S-curve networks and an approximate method for estimating degree distributions of complex networks

郭进利   

  1. Business School, University of Shanghai for Science and Technology, Shanghai 200093, China
  • 收稿日期:2009-03-18 修回日期:2010-07-15 出版日期:2010-12-15 发布日期:2010-12-15
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant No. 70871082), and the Shanghai Leading Academic Discipline Project (Grant No. S30504).

S-curve networks and an approximate method for estimating degree distributions of complex networks

Guo Jin-Li(郭进利)   

  1. Business School, University of Shanghai for Science and Technology, Shanghai 200093, China
  • Received:2009-03-18 Revised:2010-07-15 Online:2010-12-15 Published:2010-12-15
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant No. 70871082), and the Shanghai Leading Academic Discipline Project (Grant No. S30504).

摘要: In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference values for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, it proposes a finite network model with a bulk growth. The model is said to be an S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barabási–Albert method) is not suitable for the network. It develops an approximate method to predict the growth dynamics of the individual nodes, and uses this to calculate analytically the degree distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-law form. This method can overcome a shortcoming of Barabási–Albert method commonly used in current network research.

Abstract: In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference values for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, it proposes a finite network model with a bulk growth. The model is said to be an S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barabási–Albert method) is not suitable for the network. It develops an approximate method to predict the growth dynamics of the individual nodes, and uses this to calculate analytically the degree distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-law form. This method can overcome a shortcoming of Barabási–Albert method commonly used in current network research.

Key words: complex network , scale-free network , power-law distribution , IPv4 standard , logistic curve

中图分类号:  (Probability theory, stochastic processes, and statistics)

  • 02.50.-r
89.75.Hc (Networks and genealogical trees)