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… (More)

@inproceedings{Mieghem2017PseudoinverseOT,
title={Pseudoinverse of the Laplacian and best spreader node in a network},
author={Piet Van Mieghem and K. Devriendt and Hale Cetinay},
year={2017}
}