Selection of influential spreaders in complex networks using Pareto Shell decomposition

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.