On a matrix-based measure of the degree of coreness of a node in a network.

The paper focuses on the right and left eigenvectors of a network matrix that belong to the largest eigenvalue. It is shown that each of vector entries measures the walk centrality of the corresponding node’s position in the network’s link structure and of the positions of the node’s adjacent nodes; as a result, it indicates to which degree the node can be associated with the structure’s core, i.e., the structural coreness of the node. The relationship between the vectors’ coordinates and the position of the nodes, as well as the actual computation of the coordinates, is based on an iterative computational scheme known as the power method. The paper studies the method’s convergence for networks of different structure. Some possible applications are discussed. The paper also includes a numerical example dealing with a real network of 197 nodes and 780 links. [ABSTRACT FROM AUTHOR]