Identification of Sparse Interdependent Edges in Heterogeneous Network Models via Greedy Module Matching

The identification of interdependent edges plays a critical role in improving information propagation efficiency and enhancing network robustness in interdependent networks. However, existing methods exhibit significant limitations when identifying interdependent edges between networks with substantial differences in edge density. This paper proposes a greedy module matching-based method for sparse interdependent edge identification in similar-order heterogeneous networks. The method utilizes degree entropy and betweenness centrality as node characteristic values for sparse and dense networks, respectively. It first leverages structural differences between sparse and dense networks to determine the upper bound of interdependent edges. Then, a clustering algorithm is employed to identify modules in both networks that align with the estimated number of interdependent edges. Finally, a greedy algorithm is applied to infer interdependent edges between sparse and dense networks. The proposed method is validated using synthetic networks and power-communication networks, with network robustness and connection efficiency as evaluation metrics. Additionally, further validation is conducted through applications in problem–answer networks. Experimental results demonstrate that the proposed approach significantly improves the prediction of sparse interdependent relationships in heterogeneous complex networks and has broad applicability across multiple domains.