A class of scale-free network model with the degree sequence of geometric sequence

作者：Lu, Bin; Xiao, Wenjun^*; Liu, Yanxia

来源：Journal of Information and Computational Science, 2013, 10(18): 6113-6120.

DOI：10.12733/jics20102654

• Degree sequence
• Geometric sequence
• Network parameters
• Network structures
• Positive integers
• Scale free networks
• Scale-free properties
• Topology structure

A new network model with the degree sequence of geometric sequence is proposed in this paper. The network model is theoretically proved to be a scale-free network, the power exponent of which is simultaneously obtained. The degree sequence of the network model is a geometric sequence, the first term of which is a positive integer, and common ratio q of which is a positive integer greater than 1. The length of the degree sequence is l. The number of nodes with kidegree is bn-i+1, and the power exponent is logqb, where b is also a positive integer, and n = l-1. In the network model, the geometric sequence is used to determine network parameters, such as power exponent, the minimum degree and the number of nodes. Subsequently, related properties of the network are analyzed. Then, the topology structure of the network is found to vary with the change of degree sequence length. However, the scale-free property of it is always the same. Finally, some instances are employed to illustrate the network model. The illustrations show that the network model may exhibit different network structures.

• 出版日期2013-12-10
• 单位华南理工大学