Print Email Facebook Twitter Pseudoinverse of the Laplacian and best spreader node in a network Title Pseudoinverse of the Laplacian and best spreader node in a network Author Van Mieghem, P.F.A. (TU Delft Network Architectures and Services) Devriendt, K.L.T. (External organisation) Çetinay Iyicil, H. (TU Delft Network Architectures and Services) Date 2017 Abstract Determining a set of "important" nodes in a network constitutes a basic endeavor in network science. Inspired by electrical flows in a resistor network, we propose the best conducting node j in a graph G as the minimizer of the diagonal element Qjj† of the pseudoinverse matrix Q† of the weighted Laplacian matrix of the graph G. We propose a new graph metric that complements the effective graph resistance RG and that specifies the heterogeneity of the nodal spreading capacity in a graph. Various formulas and bounds for the diagonal element Qjj† are presented. Finally, we compute the pseudoinverse matrix of the Laplacian of star, path, and cycle graphs and derive an expansion and lower bound of the effective graph resistance RG based on the complement of the graph G. To reference this document use: http://resolver.tudelft.nl/uuid:d30bd7b7-808c-4594-ab34-be90b434fa53 DOI https://doi.org/10.1103/PhysRevE.96.032311 ISSN 2470-0045 Source Physical Review E, 96 (3), 1-22 Part of collection Institutional Repository Document type journal article Rights © 2017 P.F.A. Van Mieghem, K.L.T. Devriendt, H. Çetinay Iyicil Files PDF 31834950.pdf 1.03 MB Close viewer /islandora/object/uuid:d30bd7b7-808c-4594-ab34-be90b434fa53/datastream/OBJ/view