The disappearance of important nodes which are prominent characters in a social network may lead the social network to a broken structure. Many previous works have discussed reconstructing such networks using the network topology to devise an approach that finds a substitute node for a deleted node and generates appropriate links to avoid a fragmentation of the network. A common used property in finding substitute node is centrality, but calculating some kinds of centrality may spend too much time on re-scanning the graph. Thus, we propose a local approach, CLOMADE, standing for Choosing LOcal MAximum DEgree. We only need to scan the whole graph once for calculating degree. We choose a node with local maximum degree to be the substitute node and generate new links from the substitute node to other nodes. The experiments show that CLOMADE outperforms previous works in execution time.
['Shiou-Chi Li', 'Yu-Hao Ke', 'Fa-Yuan Liu', 'Jen-Wei Huang']
Reconstructing Dynamic Social Network by Choosing Local Maximum Degree Substitute