[{“box”:0,”content”:”
n
n
- n t
n
Rajesh Yadav
[/foreach]
n
n
n
- [foreach 286] [if 1175 not_equal=””]n t
- Assistant Professor, Department of Computer Science, SIES College Of Arts, Science & Commerce (Autonomous), Maharashtra, India
n[/if 1175][/foreach]
n
Abstract
nCentrality, a fundamental concept in social network analysis (SNA), plays a pivotal role in understanding the structural dynamics and information flow within networks. This paper offers an extensive examination of centrality metrics and their utilization in diverse fields. We begin by defining centrality and exploring its significance in characterizing the importance of nodes within a network. Subsequently, we delve into the literature Review by different authors and most employed centrality metrics, including degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality, elucidating their underlying mathematical foundations and practical implications. Furthermore, the paper discusses the strengths and limitations of each centrality measure, offering insights into their suitability for different network structures and research objectives. Additionally, we examine real-world applications of centrality in fields such as social sciences, epidemiology, organizational behavior, and information retrieval, highlighting the diverse contexts in which centrality analysis proves invaluable. This review serves as a comprehensive resource for researchers, practitioners, and enthusiasts in the field of social network analysis, offering a nuanced understanding of centrality measures and their broad-ranging applications across disciplines. Major focus is to make students in undergraduate degree and post-graduation about centrality measures in social network analysis.
n
Keywords: Degree centrality, betweenness centrality, SNA, centrality metrics
n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Data Structure Studies(ijdss)]
n
n
n
n
n
nn
nn[if 992 equals=”Open Access”] Full Text PDF[else] nvar fieldValue = “[user_role]”;nif (fieldValue == ‘indexingbodies’) {n document.write(‘Full Text PDF‘);n }nelse if (fieldValue == ‘administrator’) { document.write(‘Full Text PDF‘); }nelse if (fieldValue == ‘ijdss’) { document.write(‘Full Text PDF‘); }n else { document.write(‘ ‘); }n [/if 992] [if 379 not_equal=””]nn
Browse Figures
n
n[/if 379]n
References
n[if 1104 equals=””]n
- Linton C. Freeman.”Centrality in social networks conceptual clarification,Social Networks”,Volume 1, Issue 3,1978,Pages 215–239,ISSN 0378–8733, Available at doi: https://doi.org/10.1016/0378–8733(78)90021–7
- Stephen P Borgatti, Martin G Everett, “Models of core/periphery structures,Social Networks”,Volume 21, Issue 4,2000, Pages 375–395,ISSN0378–8733, Available at doi: https://doi.org/10.1016/S0378–8733(99)00019–2.
- Opsahl, Tore & Agneessens, Filip & Skvoretz, John. “Node Centrality in Weighted Networks: Generalizing Degree and Shortest Paths. Social Networks – SOC NETWORKS”, 245–251. 10.1016/j.socnet.2010.03.006.
- Brass, Daniel J. “Being in the Right Place: A Structural Analysis of Individual Influence in an Organization.” Administrative Science Quarterly, vol. 29, no. 4, 1984, pp. 518–39. JSTOR, https://doi.org/10.2307/2392937.
- Sabidussi, Gert. “The centrality index of a graph.” Psychometrika 31 (1966): 581-603.
- Frost, H.. (2022). Eigenvector centrality for multilayer networks with dependent node importance.
- Das, Kousik, Sovan Samanta, and Madhumangal Pal. “Study on centrality measures in social networks: a survey.” Social network analysis and mining 8 (2018): 1–11.
- Landherr, Andrea, Bettina Friedl, and Julia Heidemann. “A critical review of centrality measures in social networks.” Wirtschaftsinformatik 52 (2010): 367–382.
- Das K, Samanta S, Pal M. Study on centrality measures in social networks: a survey. Social network analysis and mining. 2018 Dec;8:1–1.
- Valente TW, Coronges K, Lakon C, Costenbader E. How correlated are network centrality measures?. Connections (Toronto, Ont.). 2008 Jan 1;28(1):16.
nn[/if 1104][if 1104 not_equal=””]n
- [foreach 1102]n t
- [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
n[/foreach]
n[/if 1104]
nn
nn[if 1114 equals=”Yes”]n
n[/if 1114]
n
n
n
n
n
| Volume | 01 |
| Issue | 02 |
| Received | September 20, 2023 |
| Accepted | October 3, 2023 |
| Published | October 25, 2023 |
n
n
n
n
n[/foreach]
n[/if 1190] [if 1177 not_equal=””]n
n
n[/foreach]
n[/if 1177]
n
n
n
n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n n function myfun() {n x = document.getElementById(“editor”);n y = document.getElementById(“down”);n z = document.getElementById(“up”);n if (x.style.display == “none”) {n x.style.display = “block”;n }n else {n x.style.display = “none”;n }n if (y.style.display == “none”) {n y.style.display = “block”;n }n else {n y.style.display = “none”;n }n if (z.style.display == “none”) {n z.style.display = “block”;n }n else {n z.style.display = “none”;n }n }n function myfun2() {n x = document.getElementById(“reviewer”);n y = document.getElementById(“down2”);n z = document.getElementById(“up2”);n if (x.style.display == “none”) {n x.style.display = “block”;n }n else {n x.style.display = “none”;n }n if (y.style.display == “none”) {n y.style.display = “block”;n }n else {n y.style.display = “none”;n }n if (z.style.display == “none”) {n z.style.display = “block”;n }n else {n z.style.display = “none”;n }n }n”}]