 Lowest degree decomposition of complex networksYong Yu, Ming Jing, Na Zhao and Tao Zhou Chaos, Solitons & Fractals, 2025, vol. 199, issue P3 Abstract: 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. Keywords: Complex networks; Influence maximization; Network decomposition (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:199:y:2025:i:p3:s0960077925007787 DOI: 10.1016/j.chaos.2025.116765 Access Statistics for this article Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros More articles in Chaos, Solitons & Fractals from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.