Analysis of Coauthorship Network in Political Science using Centrality Measures

In recent era, networks of data are growing massively and forming a shape of complex structure. Data scientists try to analyze different complex networks and utilize these networks to understand the complex structure of a network in a meaningful way. There is a need to detect and identify such a complex network in order to know how these networks provide communication means while using the complex structure. Social network analysis provides methods to explore and analyze such complex networks using graph theories, network properties and community detection algorithms. In this paper, an analysis of co-authorship network of Public Relation and Public Administration subjects of Microsoft Academic Graph (MAG) is presented, using common centrality measures. The authors belong to different research and academic institutes present all over the world. Cohesive groups of authors have been identified and ranked on the basis of centrality measures, such as betweenness, degree, page rank and closeness. Experimental results show the discovery of authors who are good in specific domain, have a strong field knowledge and maintain collaboration among their peers in the field of Public Relations and Public Administration.

@article{Ahmed2018,
  title     = {Analysis of Coauthorship Network in Political Science using Centrality Measures},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {9},
  number    = {10},
  year      = {2018},
  publisher = {The Science and Information Organization},
  author    = {Adeel Ahmed and Muhammad Fahad Khan and Muhammad Usman and Khalid Saleem},
  doi       = {10.14569/IJACSA.2018.091040},
  url       = {https://doi.org/10.14569/IJACSA.2018.091040}
}