A note on a generalization of eigenvector centrality for bipartite   graphs and applications
  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. 
Peteris Daugulis
math.CO