The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
The Perron-Frobenius theorem: some of its applications
Abstract
The Perron-Frobenius theorem provides a simple characterization of the eigenvectors and eigenvalues of certain types of matrices with nonnegative entries. The importance of the Perron-Frobenius theorem stems from the fact that eigenvalue problems on these types of matrices frequently arise in many different fields of science and engineering. In this article, the authors discuss the applications of this theorem in diverse areas such as steady state behavior of Markov chains, power control in wireless networks, commodity pricing models in economics, population growth models, and Web search engines. The article starts with a review and discussion of the mathematical foundations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Probability, Random Variables, and Stochastic Processes
Miller, I. (1966) · Technometrics · doi:10.1080/00401706.1966.10490365 · Cited by 8,452
Probability, Random Variables, and Stochastic Processes
Papoulis, A., & Hoffman, J. G. (1967) · Physics Today · doi:10.1063/1.3034123 · Cited by 4,107
A New Status Index Derived from Sociometric Analysis
Katz, L. (1953) · Psychometrika · doi:10.1007/bf02289026 · Cited by 3,866
Nonnegative Matrices in the Mathematical Sciences
Berman, A., & Plemmons, R. J. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971262 · Cited by 3,573
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Garfield, E. (1972) · Science · doi:10.1126/science.178.4060.471 · Cited by 2,788
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Haveliwala, T. H. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1208999 · Cited by 1,052
Other-cell interference in cellular power-controlled CDMA
Viterbi, A. J., Viterbi, A. M., & Zehavi, E. (1994) · IEEE Transactions on Communications · doi:10.1109/tcomm.1994.582830 · Cited by 370
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
Richardson, M., & Domingos, P. (2001) · Cited by 356
Design and implementation of a high-performance distributed Web crawler
Shkapenyuk, V., & Suel, T. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994750 · Cited by 328
Self-citation(1999) · Cited by 293
Breadth-first crawling yields high-quality pages
Najork, M., & Wiener, J. L. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.371965 · Cited by 265
Matrix Algebra and Its Applications to Statistics and Econometrics
Rao, C. R., & Rao, M. B. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/3599 · Cited by 218
Link Analysis, Eigenvectors and Stability
Ng, A. Y., Zheng, A. X., & Jordan, M. I. (2001) · Cited by 206
A large-scale study of the evolution of web pages
Fetterly, D., Manasse, M., Najork, M., & Wiener, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775246 · Cited by 189
Breadth-First Search Crawling Yields High-Quality Pages
Najork, M., & Wiener, J. L. (2001) · Cited by 182
Recognizing Nepotistic Links on the Web
Davison, B. D. (2000) · Cited by 152
Matrix Algebra and its Applications to Statistics and Econometrics
Rao, C. R., & Rao, M. B. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812779281 · Cited by 87
I/O-efficient techniques for computing pagerank
Chen, Y.-Y., Gan, Q., & Suel, T. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584882 · Cited by 59
Self-citation
Cited by
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
Optimal Design of Energy-Efficient Multi-User MIMO Systems: Is Massive MIMO the Answer?
Bjornson, E., Sanguinetti, L., Hoydis, J., & Debbah, M. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2015.2400437 · Cited by 828
Sayed, A. H. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2306253 · Cited by 587
Sayed, A. H., Tu, S.-Y., Chen, J., Zhao, X., & Towfic, Z. J. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2231991 · Cited by 494
Adaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
Metadata
- Authors
- Pillai, S. U., Suel, T., & Cha, S.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2005-03
- Volume
- 22
- Issue
- 2
- Pages
- 62-75
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W1979112316
- Cited by
- 338
- References
- 25
- FWCI
- 7.22
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.