Keywords: 
• 度关联网络 /
• 重连

Abstract: The degree correlation of nodes is known to considerably affect the network dynamics in systems with a complex network structure. Thus it is necessary to generate degree correlated networks for the study of network systems. The assortatively correlated networks can be generated effectively by rewiring connections in scale-free networks. However, disassortativity in scale-free networks due to rewiring has not been studied systematically.
In this paper, we present the effectiveness of generating disassortative scale-free networks by rewiring the already formed structure of connections which are built using the evolving network model. In the rewiring, two randomly selected links are cut and the four ends are connected randomly by two new links. The rewiring will be reserved if the disassortativity changes to the direction we need, otherwise it will be aborted. However, if one or both of the new links already exist in the network or a node is connected to itself, the rewiring step is aborted and two new links are selected. Our result shows that the rewiring method can enhance the disassortativity of scale-free networks. However, it is notable that the disassortativity measured by the Pearson correlation coe?cient cannot be tuned to ?1 which is believed to be the complete disassortativity. We obtain that the minimum value of the Pearson correlation coe?cient depends on the parameters of networks, and we study the effect of network parameters on the degree correlation of the rewired networks, including the network size, the connection density of the network, and the heterogeneity of node degrees in the network. The result suggests that the effect of rewiring process is poorer in networks with higher heterogeneity, large size and sparse density. Another measurement of degree correlation called Kendall-Gibbons’ coe?cient is also used here, which gives the value of degree correlation independent of the network size. We give the relation of Kendall-Gibbons’ coe?cient to network sizes in both original scale-free networks and rewired networks. Results show that there is no obvious variance in rewired networks when the network size changes. The Kendall-Gibbons’ coe?cient also shows that rewiring can effectively enhance the disassortativity of the scale-free network.
We also study the effectiveness of rewiring by comparing it with two sets of data of real Internets. We use the evolving network model to generate networks which have the same parameters as the real Internet, including network sizes, connection density and degree distribution exponents. We obtain that the networks generated by rewiring procedure cannot reach the same degree correlation as the real networks. The degree distribution of real networks diverges from the model at the largest degree or the smallest degree, which provides a heuristic explanation for the special degree correlation of real networks. Therefore, the difference at the end of the distribution is not negligible.