Abstract: With the widespread use of infrastructure networks such as power systems,transportation systems,and communication systems,it is of great significance to improve the robustness of complex networks.The rewiring mechanism is an efficient and simple method to improve the robustness of the network.The rewiring mechanism based on the 0-order null model improves the robustness of the network by randomly deleting and creating edges.Although the number of edges is maintained,the degree of nodes will change,such as the RM-ES algorithm.The rewiring mechanism based on the 1-order null model improves the robustness of the network by randomly selecting two edges for rewiring,although the degree distribution is maintained,it is difficult to find the appropriate nodes by random edge selection,which increases the running time of algorithms,such as the RM-LCC algorithm.Therefore,in order to maintain the degree distribution and improve the robustness of the network,this paper proposes a fast rewiring mechanism based on 1-order null model,called FRM.The FRM algorithm first weights the edges by degree for each edge,then selects two edges with the probability proportional to the weight of edge,finally,creates the edges between nodes with similar degree.We compare the FRM algorithm with other methods on real network data sets.The experimental results of three real network data show that FRM algorithm performs better than four representative rewiring algorithms under the attack of degree centrality,betweenness centrality and PageRank centrality with respect to the ratio of nodes in largest connected component s(Q),robustness index R and robustness index I(G).

Key words: Complex network, Largest connected component, Rewiring mechanism, Robustness, Shannon entropy