Ranking hubs and authorities using matrix functions

  title={Ranking hubs and authorities using matrix functions},
  author={Michele Benzi and Ernesto Estrada and Christine Klymko},
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of undirected networks. In this paper we propose an extension of these measures to directed networks, and we apply them to the problem of ranking hubs and authorities. The extension is achieved by bipartization, i.e., the directed network is mapped onto a bipartite undirected network with twice as many nodes in order to… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS

14 Figures & Tables



Citations per Year

77 Citations

Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.