[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.33851/JMIS.2022.9.2.121

Collective Betweenness Centrality in Networks

Gombojav, Gantulga (Department of Information and Computer Sciences, National University of Mongolia)
Purevsuren, Dalaijargal (Department of Information and Computer Sciences, National University of Mongolia)
Sengee, Nyamlkhagva (Department of Information and Computer Sciences, National University of Mongolia)

Publication Information

Journal of Multimedia Information System / v.9, no.2, 2022 , pp. 121-126 More about this Journal

Abstract

The shortest path betweenness value of a node quantifies the amount of information passing through the node when all the pairs of nodes in the network exchange information in full capacity measured by the number of the shortest paths between the pairs assuming that the information travels in the shortest paths. It is calculated as the cumulative of the fractions of the number of shortest paths between the node pairs over how many of them actually pass through the node of interest. It's possible for a node to have zero or underrated betweenness value while sitting just next to the giant flow of information. These nodes may have a significant influence on the network when the normal flow of information is disrupted. We propose a betweenness centrality measure called collective betweenness that takes into account the surroundings of a node. We will compare our measure with other centrality metrics and show some applications of it.

Keywords

Big Data; Data Analysis; Network Analysis;

Citations & Related Records

Reference

1	J. Leskovec and J. Mcauley, "Learning to discover social circles in ego networks," Advances in Neural Information Processing Systems, 2012, vol. 25.
2	S. Xu, P. Wang, and J. Lu, "Iterative neighbour-information gathering for ranking nodes in complex networks," Scientific Report, vol. 7, no. 1, p. 41321, Feb. 2017. DOI
3	H. W. Hethcote, "The mathematics of infectious diseases," SIAM Rev., vol. 42, no. 4, pp. 599-653, Dec. 2000. DOI
4	J. H. Huh, Y. Kim, and K. Seo, "Power aware routing protocol in multimedia ad-hoc network considering hop lifetime of node," Journal of Multimedia Information System, vol. 1, no. 2, pp. 101-110, 2014.
5	I. Cooper, A. Mondal, and C. G. Antonopoulos, "A SIR model assumption for the spread of COVID-19 in different communities," Chaos, Solitons & Fractals, vol. 139, p. 110057, Oct. 2020. DOI
6	R. Guimera, L. Danon, A. Diaz-Guilera, F. Giralt, and A. Arenas, "Self-similar community structure in a network of human interactions," Physcis Revew E, vol. 68, no. 6, p. 065103, Dec. 2003. DOI
7	J. Santonja, K. Martinez, F. J. Roman, S. Escorial, M. Quiroga, and J. Alvarez-Linera, et al., "Brain resilience across the general cognitive ability distribution: Evidence from structural connectivity," Brain Struct Funct, vol. 226, no. 3, pp. 845-859, Apr. 2021. DOI
8	Q. Zeng, Y. Liu, M. Tang, and J. Gong, "Identifying super-spreaders in information-epidemic coevolving dynamics on multiplex networks," Knowledge-Based Systems, vol. 229, p. 107365, Oct. 2021. DOI
9	S. Wandelt, X. Sun, D. Feng, M. Zanin, and S. Havlin, "A comparative analysis of approaches to network-dismantling," Scientific Report, vol. 8, no. 1, Sep. 2018.
10	A. A. Aouiz, S. B. Hacene, and P. Lorenz, "Channel busyness based multipath load balancing routing protocol for ad hoc networks," IEEE Network, vol. 33, no. 5, pp. 118-125, Sep. 2019. DOI
11	F. Morone and H. A. Makse, "Influence maximization in complex networks through optimal percolation," Nature, vol. 524, no. 7563, Art. Aug. 2015.
12	F. Zhu, "Improved collective influence of finding most influential nodes based on disjoint-set reinsertion," Scientific Report, vol. 8, no. 1, Sep. 2018.
13	U. Brandes, "On variants of shortest-path betweenness centrality and their generic computation," Social Networks, vol. 30, no. 2, pp. 136-145, May 2008. DOI
14	M. Ianni, E. Masciari, and G. Sperli, "A survey of big data dimensions vs social networks analysis," Journal of Intelligent Information System, vol. 57, no. 1, pp. 73-100, Aug. 2021. DOI
15	W. Liu, M. Pellegrini, and A. Wu, "Identification of bridging centrality in complex networks," IEEE Access, vol. 7, pp. 93123-93130, 2019. DOI
16	L. Jain, R. Katarya, and S. Sachdeva, "Opinion leader detection using whale optimization algorithm in online social network," Expert Systems with Applications, vol. 142, p. 113016, Mar. 2020. DOI
17	D. Chen, L. Lu, M. S. Shang, Y. C. Zhang, and T. Zhou, "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and Its Applications, vol. 391, no. 4, pp. 1777-1787, Feb. 2012. DOI
18	Y. Yang, X. Wang, Y. Chen, M. Hu, and C. Ruan, "A novel centrality of influential nodes identification in complex networks," IEEE Access, vol. 8, pp. 58742-58751, 2020. DOI
19	C. A. Reis Pinheiro, M. Galati, N. Summerville, and M. Lambrecht, "Using network analysis and machine learning to identify virus spread trends in COVID-19," Big Data Research, vol. 25, p. 100242, Jul. 2021. DOI
20	C. Castellano, S. Fortunato, and V. Loreto, "Statistical physics of social dynamics," Review of Modern Physics, vol. 81, no. 2, pp. 591-646, May 2009. DOI
21	O. Sporns, C. J. Honey, and R. Kotter, "Identification and classification of hubs in brain networks," PLOS ONE, vol. 2, no. 10, p. e1049, Oct. 2007. DOI