Abstract
The selection of prominent nodes in order to maximize the ability of spreading is very crucial in complex networks. The well known K-Shell method, which comprises nodes located at the core of a network, is better than the degree centrality and betweenness centrality, in capturing the spreading ability for a single origin spreader. As per the multiple origin spreaders, the K-Shell method fails to yield similar results when compared to the degree centrality. Current research proposes a Pareto-Shell Decomposition. It employs Pareto front function. It’s Pareto optimal set comprises non-dominated spreads, with the ratio of high out-degree to in-degree and high in-degree. Pareto-Shell decomposition outperforms the K-Shell and the degree centrality for multiple origin spreaders, with the simulation of epidemic spreading process.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
