Enhance the Performance of Network Computation by a Tunable Weighting Strategy

Networked systems with high computational efficiency are desired in many applications ranging from sociology to engineering. Generally, the performance of the network computation can be enhanced by two ways: rewiring and weighting. In this paper, we proposed a new two-modes weighting strategy based on the concept of communication neighbor graph, which takes use of both the local and global topological properties, e.g., degree centrality, betweenness centrality, and closeness centrality. The weighting strategy includes two modes: In the original mode, it enhances the network synchronizability by increasing the weights of bridge edges; whereas in the inverse version, it increases the significance of community structure by decreasing the weights of bridge edges. The scheme of weighting is controlled by only one parameter, i.e., \alpha, which can be easily performed. We test the effectiveness of our model on a number of artificial benchmark networks as well as real-world ones. To the best of our knowledge, the proposed weighting strategy can outperform the existing methods in improving the performance of network computation.