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

@article{Daugulis2012ANO,
  title={A note on a generalization of eigenvector centrality for bipartite graphs and applications},
  author={P. Daugulis},
  journal={Networks},
  year={2012},
  volume={59},
  pages={261-264}
}
  • P. Daugulis
  • Published 2012
  • Mathematics, Computer Science
  • Networks
  • 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. 
    2 Citations

    References

    SHOWING 1-5 OF 5 REFERENCES
    The Structure and Function of Complex Networks
    • M. Newman
    • Physics, Computer Science
    • SIAM Rev.
    • 2003
    • 13,535
    • PDF
    Handbook of Linear Algebra
    • 496
    The Anatomy of a Large-Scale Hypertextual Web Search Engine
    • 14,737
    • PDF
    The Jordan forms of AB and BA
    • 8
    • PDF