Pseudoinverse of the Laplacian and best spreader node in a network
- 15 September 2017
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 96 (3) , 032311
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 in a graph as the minimizer of the diagonal element of the pseudoinverse matrix of the weighted Laplacian matrix of the graph . We propose a new graph metric that complements the effective graph resistance and that specifies the heterogeneity of the nodal spreading capacity in a graph. Various formulas and bounds for the diagonal element 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 based on the complement of the graph .
Keywords
This publication has 36 references indexed in Scilit:
- Geometry of complex networks and topological centralityPhysica A: Statistical Mechanics and its Applications, 2013
- The correlation of metrics in complex networks with applications in functional brain networksJournal of Statistical Mechanics: Theory and Experiment, 2011
- Identification of influential spreaders in complex networksNature Physics, 2010
- Influence of assortativity and degree-preserving rewiring on the spectra of networksThe European Physical Journal B, 2010
- Metric and ultrametric spaces of resistancesDiscrete Applied Mathematics, 2010
- Betweenness centrality in a weighted networkPhysical Review E, 2008
- Characterization of complex networks: A survey of measurementsAdvances in Physics, 2007
- Complex networks: Structure and dynamicsPhysics Reports, 2006
- Resistance distanceJournal of Mathematical Chemistry, 1993
- New Foundation of Euclidean GeometryAmerican Journal of Mathematics, 1931