Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications
From MaRDI portal
Publication:5741743
DOI10.1137/1.9781611973105.35zbMath1422.90013arXiv1308.5915OpenAlexW4234574620MaRDI QIDQ5741743
Erez Kantor, Zvi Lotker, Y. Haddad, Chen Avin, Michael Borokhovich, David Peleg, Merav Parter
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.5915
Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26) Communication networks in operations research (90B18) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (2)
Testing the irreducibility of nonsquare Perron-Frobenius systems ⋮ The Collatz-Wielandt quotient for pairs of nonnegative operators.
This page was built for publication: Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications
