Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/30235
Title: The connections of connections : new results on the centrality and communicability of networks
Authors: Farrugia, Alexander
Keywords: Resolvents (Mathematics)
Matrices
Graph theory
Issue Date: 2018
Publisher: University of Malta. Junior College
Citation: Farrugia, A. (2018). The connections of connections : new results on the centrality and communicability of networks. Symposia Melitensia, 14, 257-269
Abstract: In network science, the centrality, or importance, of a node in a network is of crucial importance, for instance to rank webpages or to measure the rate of the spread of news on a social network. Also of importance is measuring the communicability between two nodes in a network, which assesses how well the nodes can communicate between them. Two methods of calculating the centrality and communicability of nodes in a network, arising from the subgraph centrality approach utilizing walk of graphs are surveyed, with a focus on the more recently introduced of these two methods. A connection between the centrality and communicability scores produced by this scheme is presented. The question of how the centrality and communicability of nodes vary by the introduction of new links in the network is put forward. To answer this question, formulae that derive these centrality and communicability differences in terms of existing centralities of nodes within the network are presented.
URI: https://www.um.edu.mt/library/oar//handle/123456789/30235
ISSN: 1812-7509
Appears in Collections:Scholarly Works - JCMath
SymMel, 2018, Volume 14
SymMel, 2018, Volume 14

Files in This Item:
File Description SizeFormat 
20. The Connections of.pdf610.58 kBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.