A note on a generalization of eigenvector centrality for bipartite graphs and applications

  • Authors:

  • Peteris Daugulis

  • Affiliations:

  • Department of Mathematics, Daugavpils University, Daugavpils, Parades 1, Latvia

  • Venue:
  • Networks
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector centrality invariant is defined which is motivated by the need to design rating systems for bipartite graph models of time-sensitive and other processes. The linear algebra connection and some applications are described. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.