Aug 2026· 2026 12th International Conference on Big Data and Information Analytics (BigDIA)· pp. 1005-1012· 0 citations· 34 references
Abstract
To accurately identify key spreading nodes in complex networks, this paper proposes a local gravity model, ESTG, based on entropy-weighted triangle structure and directed resistance distance. The main innovations of this method include: introducing the k-shell information of nodes into the triangle structure measurement, and using information entropy to measure the diversity of k-shell distribution within the triangles, thereby giving higher weights to triangles located in the core or with significant hierarchical differentiation, and constructing entropy-weighted triangle coreness; calculating resistance distances based on the k-order neighborhood subgraph of each node and using the pseudoinverse, introducing directed resistance distance to simultaneously capture multi-path coupling effects and asymmetry in propagation; extending the semi-global triangle centrality as the node mass, integrating it with directed resistance distance into the local gravity model, and obtaining the ESTG node influence score. The performance of various baseline methods is compared on nine real networks and three LFR synthetic networks. Experimental findings demonstrate that ESTG achieves superior performance over the comparison methods with respect to node discrimination, ranking accuracy, and top-k node identification.
This paper investigates whether entropy-based k-hop metrics capture aspects of structural node importance that are not emphasized by classical centrality measures. We compare degree and eigenvector centrality with two entropy-based measures, Entropy-Weighted Redundancy (EWR) and Normalized Entropy Density (NED), on thr...
Zsolt Valiskó, T. Balla, Csaba Biró· Proceedings of the 13th Inte...· 0 citations
The existing key node identification methods in complex networks rely on local topological information or global structural features, which are difficult to fully integrate multi-order local structural information and global propagation characteristics, resulting in the limitation of the accuracy and discrimination abi...
Gravity model is an effective method for vital node identification of complex networks. Many existing gravity models take the shortest path length as the interaction distance, however, interactions for the node pairs with identical path lengths may be different, and simply using the shortest path length cannot well dis...
Qi Wu, Tian Qiu, Guang Chen· International Journal of Mod...· 0 citations
Comparing the ISM centrality measures to commonly used weighted variants of out-degree, in-degree, closeness, shortest-path betweenness, and Katz centrality in directed, weighted networks shows strong correlations between the ISM out-centrality and weighted out-degree and outward Katz centrality, particularly for low e...
The identification of influential nodes in directed networks is fundamental to diffusion analysis, network robustness assessment, and information recommendation. Owing to the asymmetry introduced by directed edges, conventional centrality methods often struggle to jointly characterize the local spreading range, higher-...
Zi-Yue Zhao, Bo Hu· Entropy· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.