| Summary: | Coreness is one of the important indicators to measure the importance of a node. Traditionally, the coreness of a node is measured by <i>k</i>-core decomposition. However, to measure the coreness in a dynamic network, the <i>k</i>-core decomposition method becomes very time-consuming and inefficient, and cannot meet the need in very large real networks. Recently, the <inline-formula> <math display="inline"> <semantics> <mi mathvariant="script">H</mi> </semantics> </math> </inline-formula> operator method was proposed to calculate the coreness of a node, which provides a novel method to deal with the coreness of a node in a network. In this paper, we decode the coreness variation rule by a symmetric pair of experiments, i.e., deleting and adding edge, on real networks. Then, an algorithm to fast update the coreness of related nodes is proposed. Results on five real networks showed that the performance of the proposed algorithm was greatly enhanced and comprehensively superior to the <i>k</i>-core decomposition algorithm. Our study provides a promising way to optimize the algorithm of coreness calculation in the dynamic networks.
|
|---|