Title: SHOMAN: an efficient method for finding the important nodes in a network

Authors: Shivam Bathla; Omprakash Sah Kanu; Anurag Singh

Addresses: Department of Computer Science and Engineering, National Institute of Technology Delhi, Delhi 110040, India ' Department of Computer Science and Engineering, National Institute of Technology Delhi, Delhi 110040, India ' Department of Computer Science and Engineering, National Institute of Technology Delhi, Delhi 110040, India

Abstract: In this paper, we propose and study the SHOMAN metric for determining the importance of a node in a network. The method is based on a significant feature of networks, namely clustering coefficient, and uses the principle of six degrees of separation to go through only up to six nodes to find the score of node influence. We demonstrate that our algorithm is highly effective at calculating the importance of nodes when compared to other centrality measures. We also propose that our method can be used in viral marketing and controlling disease spreading.

Keywords: six-degrees of separation; clustering coefficient; robustness; centrality; viral marketing; disease spreading.

DOI: 10.1504/IJBIDM.2021.118205

International Journal of Business Intelligence and Data Mining, 2021 Vol.19 No.3, pp.291 - 303

Accepted: 29 Jul 2019
Published online: 29 Sep 2021 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article