Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Bibliography
R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge Univ. Press, Cambridge, 1986; Russian transl.: Mir, Moscow, 1989.
G. Golub and C. F. Van Loan, Matrix Computations, John Hopkins Univ. Press, Baltimore, 1989; Russian transl.: Mir, Moscow, 1999.
D. K Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra [in Russian], Fizmatgiz, Moscow, 1963.
I. M. Gelfand, Lectures in Linear Algebra [in Russian], Nauka, Moscow, 1966.
C. Berge, The Theory of Graphs and Its Applications, Wiley, New York, 1962; Russian transl.: Inostr. Liter., Moscow, 1962.
D. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs, Academic Press, New York, 1980; Russian transl.: Naukova Dumka, Kiev, 1984.
S. P. Borgatti and M. G. Everett, “Models of core/periphery structures,” Social Networks, 21 (1999), 375–395.
J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” J. ACM, 46 (1999), no. 5, 604–632.
S. Brin and L. Page, “The anatomy of a large-scale hypertextual web-search engine,” in: Proceedings of the 7th WWW Conference, Brisbane, Australia, 1998, pp. 107–117.
W. Kintsch and D. M. Welsch, “The construction-integration model: A framework for studying memory for text,” in: Relating Theory and Data: Essays on Human Memory, eds. W. Hockley, S. Lewandowsky, Erlbaum, Hillsdale, NJ, 1991, pp. 367–386.
G. Storms, P. De Boeck, and W. Ruts, “Prototype and exemplar-based information in natural language categories,” J. Memory Language, 42 (2000), no. 1, 51–73.
V. V. Voevodin and Yu. A. Kuznetsov, Matrices and Computations [in Russian], Nauka, Moscow, 1984.
V. M. Chelnokov and V. L. Zephyrova, “Hypertext macrodynamics,” in: Lecture Notes in Computer Sci., vol. 1015, Springer-Verlag, Berlin, 1995, pp. 105–120.
V. M. Chelnokov and V. L. Zephyrova, “Collective phenomena in hypertext networks,” in: Proceedings of the Hypertext’ 97 Conference (Southhampton, UK), ACM, 1997, pp. 220–221.
S. P. Borgatti, “Centrality and AIDS,” Connections, 18 (1995), no. 1, 112–115.
S. Eubank et al., “Modelling disease outbreakes in realistic urban social networks,” Nature (13 May 2004), 429, no. 6988, 180–184.
C. L. Barrett, S. G. Eubank, and J. P. Smith, “If smallpox strikes Portland…,” Scientific American, 292 (2005), no. 3, 42–49.
Author information
Authors and Affiliations
Additional information
__________
Translated from Matematicheskie Zametki, vol. 80, no. 6, 2006, pp. 908–919.
Original Russian Text Copyright © 2006 by V. M. Chelnokov, V. L. Zephirova.
Rights and permissions
About this article
Cite this article
Chelnokov, V.M., Zephirova, V.L. On a matrix-based measure of the degree of coreness of a node in a network. Math Notes 80, 853–862 (2006). https://doi.org/10.1007/s11006-006-0207-3
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11006-006-0207-3