Assortativity analysis of complex real-world networks using the principal components of the centrality metrics Online publication date: Wed, 10-Jan-2024
by Natarajan Meghanathan
International Journal of Data Science (IJDS), Vol. 9, No. 1, 2024
Abstract: Principal component analysis (PCA) captures the variations in the data spread over m features into n dominating principal components (typically, n < m, if the features are correlated) that are orthogonal to each other. Assortativity analysis for complex networks has been so far conducted just with the degree centrality metric or some node-level metric of interest, but not with respect to more than one metric. In this paper, we show that PCA can be used to determine the assortativity index (AI) of complex real-world networks with respect to the four major centrality metrics (degree, eigenvector, betweenness, and closeness) considered together (as features representing the data) for the nodes. Assortativity index of the network is computed as the weighted average (AIPCw.avg) of the assortativity indices of the network with respect to each principal component, and the weights are the eigenvalues of the eigenvectors corresponding to the principal components.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Science (IJDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook