Matching exponential-based and resolvent-based centrality measures

@article{Aprahamian2016MatchingEA,
  title={Matching exponential-based and resolvent-based centrality measures},
  author={Mary Aprahamian and Desmond J. Higham and Nicholas J. Higham},
  journal={J. Complex Networks},
  year={2016},
  volume={4},
  pages={157-176}
}
The relative importance of nodes in a network can be quantified via functions of the adjacency matrix. Two popular choices of function are the exponential, which is parameter-free, and the resolvent function , which yields the Katz centrality measure. Katz centrality can be the more computationally efficient, especially for large directed networks, and has… CONTINUE READING