Reconstructing Weighted Social Networks After a Node Deleted with Substitute Node Selection

The social networks are inherently non-static, rendering the preservation of structural information within dynamic social networks a critical concern. While existing literature has addressed this issue in directed and undirected networks, there is no research in the treatment of weighted networks. Therefore, this paper introduces a framework aimed at addressing the node disappearance problem in weighted social networks. The proposed framework establishes theorems about the shortest path and endeavors to identify the optimal substitute node to minimize alterations to the shortest paths. Experimental results demonstrate that in real social networks, the proposed scheme outperforms existing methods.