Generalization beyond unweighted undirected networks

Generalize the centralitylocal-similarity fusion paradigm to directed, weighted, and dynamic temporal networks.

Background

The experiments and formulation in the paper focus on unweighted, undirected, static networks. Although the discussion sketches possible directed-network extensions using HITS, a general treatment covering directed, weighted, and temporally evolving networks remains unresolved. Such a generalization would test whether the piecewise completion rule and centrality-product mechanism remain valid when edge direction, edge weights, or temporal evolution affect link formation.

References

Besides the generalization along the centrality dimension, several open questions of the framework deserve investigation: (1) adaptive learning mechanisms for the fusion weights \omega{C}(\cdot,\cdot)---for example, end-to-end optimization of the weighting-function parameters under supervision from network topology or node attributes, upgrading empirical values'' toautomatic tuning''; (2) the generalization of the fusion paradigm to directed, weighted, and dynamic temporal networks; (3) scalability verification and approximation-algorithm design on large-scale complex networks ($|V|>104$); (4) quantitative analysis of the normalization scheme for local similarity scores and the theoretical optimality of the weighting coefficients.

— Link prediction in complex networks via fusing node centrality and local similarity indices  (2609.09658 - Zhang et al., 9 Sep 2026) in Section 7.2, Methodological outlook

Besides the generalization along the centrality dimension, several open questions of the framework deserve investigation: (1) adaptive learning mechanisms for the fusion weights \omega{C}(\cdot,\cdot)---for example, end-to-end optimization of the weighting-function parameters under supervision from network topology or node attributes, upgrading empirical values'' toautomatic tuning''; (2) the generalization of the fusion paradigm to directed, weighted, and dynamic temporal networks; (3) scalability verification and approximation-algorithm design on large-scale complex networks ($|V|>104$); (4) quantitative analysis of the normalization scheme for local similarity scores and the theoretical optimality of the weighting coefficients.

— Link prediction in complex networks via fusing node centrality and local similarity indices  (2609.09658 - Zhang et al., 9 Sep 2026) in Section 7.2, Methodological outlook