 Finding important nodes via improved cycle ratio methodYihao Huang, Weijun Peng, Muhua Zheng, Ming Zhao, Manrui Zhao and Yicheng Zhang Chaos, Solitons & Fractals, 2025, vol. 190, issue C Abstract: The cycle ratio method is designed to define the importance of nodes by the cycles of a network, and a set of important nodes identified by this method has superior control performance than by degree centrality, H-index, and coreness methods in several aspects such as spreading, percolation, and pinning control. Unfortunately, the method is not precise enough to portray the importance of the nodes, so in this paper, we improve the cycle ratio method by reducing the impact of four and larger cycles and adding the effects of the tree structure. Through numerical simulations on several real networks, we find that the set of important nodes discovered by the improved cycle ratio method is more dispersed and has better control in all three aspects of spreading, percolation, and pinning control than the original cycle ratio method. The work in this paper makes it more accurate to use the cycle structure to find a set of important nodes in a network and provides new ideas for a deeper understanding of the effects of local structure on the importance of the nodes. Keywords: Network; Cycle ratio; Tree structure (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:190:y:2025:i:c:s0960077924012980 DOI: 10.1016/j.chaos.2024.115746 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.