Lowest degree decomposition of complex networks

• Published in: Chaos, solitons and fractals Vol. 199; p. 116765
• Main Authors: Yu, Yong, Jing, Ming, Zhao, Na, Zhou, Tao
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.10.2025
• Subjects: Complex networks; Influence maximization; Network decomposition; Network decomposition; Influence maximization; Complex networks
• ISSN: 0960-0779
• DOI: 10.1016/j.chaos.2025.116765

The identification of vital nodes is a fundamental challenge in network science. Motivated by the nested nature of real networks, we propose a decomposition method termed Lowest Degree Decomposition (LDD). This method iteratively prunes the nodes with the lowest degree at each step, revealing a refined structural hierarchy. We rigorously prove that LDD is a subdivision of the famous k-core decomposition. We further propose the so-called LDD+ index that integrates the normalized ranking scores of the target node and its immediate neighbors subject to the LDD index. Extensive numerical experiments on epidemic spreading, synchronization, and nonlinear mutualistic dynamics demonstrate that the LDD+ index can more accurately locate the most influential spreaders, the most efficient controllers, and the most vulnerable species than k-core decomposition and other well established indices. In addition to identifying vital nodes, LDD can also be used as a powerful tool in network visualization and a novel criterion in network modeling. •We propose a simple and efficient method to find critical nodes in complex networks.•We test epidemic spreading, synchronization and mutualistic dynamics on 37 real networks, showing remarkable advantages of the proposed method.•We have strictly proved that LDD is a more refined subdivision of k-core decomposition.