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} }
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.
Topics from this paper
2 Citations
Robustness Analysis of Bipartite Task Assignment Networks: A Case Study in Hospital Logistics System
- Computer Science
- IEEE Access
- 2019
- 1
- Highly Influenced
Bipartite graphs in systems biology and medicine: a survey of methods and applications
- Computer Science, Medicine
- GigaScience
- 2018
- 38
- PDF
References
SHOWING 1-5 OF 5 REFERENCES
The Anatomy of a Large-Scale Hypertextual Web Search Engine
- Computer Science
- Comput. Networks
- 1998
- 14,737
- PDF