A Novel Gravity-Quasi-Laplacian Approach to Identifying Influential Nodes in Complex Networks

• URL: http://arxiv.org/abs/2607.23419v1
• Date: Sun, 26 Jul 2026 02:34:29 GMT
• Title: A Novel Gravity-Quasi-Laplacian Approach to Identifying Influential Nodes in Complex Networks
• Abstract summary: This study introduces a new ranking framework that integrates a quasi-Laplacian structural measure with a gravity-inspired aggregation process.<n>The proposed approach is designed to be free of tunable parameters, interpretable, and computationally efficient, requiring only a small fixed gravity radius.
• Score: 12.209536487880513
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Identifying influential nodes in complex networks is a fundamental challenge with broad applications in areas such as social network analysis, communication infrastructure, transportation systems, and information networks. Existing ranking methods typically rely on combinations of structural features-such as degree, k-shell index, and neighborhood connectivity-to estimate a node's importance. However, many of these approaches suffer from key limitations, including insufficient accuracy, low resolution in distinguishing nodes with similar influence, dependence on tunable parameters, and high computational complexity, which restrict their practicality in large-scale or real-world networks. This study introduces a new ranking framework that integrates a quasi-Laplacian structural measure with a gravity-inspired aggregation process. The core idea is to construct a strengthened representation of each node's structural role using only simple yet informative attributes-namely degree and k-shell index-and then evaluate its local influence through a short-range interaction mechanism. The proposed approach is designed to be free of tunable parameters, interpretable, and computationally efficient, requiring only a small fixed gravity radius (R=3), which makes it suitable for large and diverse networks. Experiments conducted on nine real-world networks and compared against eight state-of-the-art methods demonstrate that the proposed framework consistently outperforms existing techniques in terms of accuracy, resolution, and computational simplicity. These results highlight the effectiveness of the gravity-quasi-Laplacian paradigm as a reliable and scalable tool for identifying influential nodes in complex networks.

Related papers

• Renormalization Group Guided Tensor Network Structure Search [58.0378300612202]
  Network structure search (TN-SS) aims to automatically discover optimal network topologies and rank robustness for efficient tensor decomposition in high-dimensional data representation.<n>We propose RGTN (Renormalization Group guided Network search), a physics-inspired framework transforming TN-SS via multi-scale renormalization group flows.
  arXiv  Detail & Related papers  (2025-12-31T06:31:43Z)
• Contrastive clustering based on regular equivalence for influential node identification in complex networks [10.538045764554019]
  ReCC is a novel deep unsupervised framework for influential node identification.<n>It is pre-trained using network reconstruction loss and fine-tuned with a combined contrastive and clustering loss.<n>Extensive experiments demonstrate that ReCC outperforms state-of-the-art approaches across several benchmarks.
  arXiv  Detail & Related papers  (2025-08-30T09:34:39Z)
• Critical Nodes Identification in Complex Networks: A Survey [18.35145044797889]
  This paper provides a comprehensive review of critical node identification techniques.<n>It categorizes them into seven main classes: intrinsic, critical nodes deletion problem, influence, network control, artificial intelligence, higher-order and dynamic methods.<n>It identifies key challenges, such as algorithmic, real-time evaluation in dynamic networks, analysis of higher-order structures, and computational efficiency in large-scale networks.
  arXiv  Detail & Related papers  (2025-07-08T16:45:48Z)
• Cost-Effective Community-Hierarchy-Based Mutual Voting Approach for Influence Maximization in Complex Networks [54.366995393644586]
  Real-world usually have high requirements on the balance between time and accuracy of influential nodes identification. This article proposes a novel approach called Cost-Effective Community-Hierarchy-Based Mutual Voting for influence in complex networks. The proposed approach outperforms 16 state-of-the-art techniques on the balance between time complexity and accuracy of influential nodes identification.
  arXiv  Detail & Related papers  (2024-09-21T06:32:28Z)
• Sifting out communities in large sparse networks [2.666294200266662]
  We introduce an intuitive objective function for quantifying the quality of clustering results in large sparse networks. We utilize a two-step method for identifying communities which is especially well-suited for this domain. We identify complex genetic interactions in large-scale networks comprised of tens of thousands of nodes.
  arXiv  Detail & Related papers  (2024-05-01T18:57:41Z)
• Unsupervised Graph Attention Autoencoder for Attributed Networks using K-means Loss [0.0]
  We introduce a simple, efficient, and clustering-oriented model based on unsupervised textbfGraph Attention textbfAutotextbfEncoder for community detection in attributed networks. The proposed model adeptly learns representations from both the network's topology and attribute information, simultaneously addressing dual objectives: reconstruction and community discovery.
  arXiv  Detail & Related papers  (2023-11-21T20:45:55Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• DANI: Fast Diffusion Aware Network Inference with Preserving Topological Structure Property [2.8948274245812327]
  We propose a novel method called DANI to infer the underlying network while preserving its structural properties. DANI has higher accuracy and lower run time while maintaining structural properties, including modular structure, degree distribution, connected components, density, and clustering coefficients.
  arXiv  Detail & Related papers  (2023-10-02T23:23:00Z)
• Deep Architecture Connectivity Matters for Its Convergence: A Fine-Grained Analysis [94.64007376939735]
  We theoretically characterize the impact of connectivity patterns on the convergence of deep neural networks (DNNs) under gradient descent training. We show that by a simple filtration on "unpromising" connectivity patterns, we can trim down the number of models to evaluate.
  arXiv  Detail & Related papers  (2022-05-11T17:43:54Z)
• Towards Understanding Theoretical Advantages of Complex-Reaction Networks [77.34726150561087]
  We show that a class of functions can be approximated by a complex-reaction network using the number of parameters. For empirical risk minimization, our theoretical result shows that the critical point set of complex-reaction networks is a proper subset of that of real-valued networks.
  arXiv  Detail & Related papers  (2021-08-15T10:13:49Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• Learning Connectivity of Neural Networks from a Topological Perspective [80.35103711638548]
  We propose a topological perspective to represent a network into a complete graph for analysis. By assigning learnable parameters to the edges which reflect the magnitude of connections, the learning process can be performed in a differentiable manner. This learning process is compatible with existing networks and owns adaptability to larger search spaces and different tasks.
  arXiv  Detail & Related papers  (2020-08-19T04:53:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.