Papers
Topics
Authors
Recent
Search
2000 character limit reached

Weighted cycle-based identification of influential node groups in complex networks

Published 15 Mar 2025 in cs.SI, cs.IT, and math.IT | (2503.11974v1)

Abstract: Identifying influential node groups in complex networks is crucial for optimizing information dissemination, epidemic control, and viral marketing. However, traditional centrality-based methods often focus on individual nodes, resulting in overlapping influence zones and diminished collective effectiveness. To overcome these limitations, we propose Weighted Cycle (WCycle), a novel indicator that incorporates basic cycle structures and node behavior traits (edge weights) to comprehensively assess node importance. WCycle effectively identifies spatially dispersed and structurally diverse key node group, thereby reducing influence redundancy and enhancing network-wide propagation. Extensive experiments on six real-world networks demonstrate WCycle's superior performance compared to five benchmark methods across multiple evaluation dimensions, including influence propagation efficiency, structural differentiation, and cost-effectiveness. The findings highlight WCycle's robustness and scalability, establishing it as a promising tool for complex network analysis and practical applications requiring effective influence maximization.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.