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

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.

Published in Networks: Peteris Daugulis: A note on a generalization of eigenvector centrality for bipartite graphs and applications. Networks 59(2): 261-264 (2012)