Analysis of Coauthorship Network in Political Science using Centrality Measures

by   Adeel Ahmed, et al.

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 coauthorship 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.



There are no comments yet.


page 1

page 4

page 6

page 8

page 9

page 14


Twenty Years of Network Science: A Bibliographic and Co-Authorship Network Analysis

Two decades ago three pioneering papers turned the attention to complex ...

Two Decades of Network Science as seen through the co-authorship network of network scientists

Complex networks have attracted a great deal of research interest in the...

Community Detection Clustering via Gumbel Softmax

Recently, in many systems such as speech recognition and visual processi...

Learning Reputation in an Authorship Network

The problem of searching for experts in a given academic field is hugely...

Convexity in scientific collaboration networks

Convexity in a network (graph) has been recently defined as a property o...

Graph fractal dimension and structure of fractal networks: a combinatorial perspective

In this paper we study self-similar and fractal networks from the combin...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.