On the Spectral Region of n-Cycle Stochastic Matrices
Abstract
For every n≥3, we determine the union of the spectra of row-stochastic matrices supported on a directed n-cycle with self-loops and strictly positive cycle edges. These matrices describe progression through cyclic stages with geometric waiting times, and also arise by uniformization of unidirectional continuous-time reaction cycles. For the latter, the classification determines the minimum transition-rate bound required to realize a prescribed nonreal eigenvalue and provides rates attaining that bound. The angles m=Argλ and M=Arg(λ−1) reduce the nonreal eigenvalue problem to determining the range of a strictly convex logarithmic sum over angles with prescribed sum. Jensen's inequality gives its minimum, simplex vertices give its finite maximum, and connectedness makes these bounds sufficient for realization. The resulting branch graphs are strictly decreasing and their horizontal sections are ordered. This ordering gives the complete boundary, which alternates between uniform-cycle segments and one-loop algebraic arcs. We state a direct membership criterion and construct a realizing matrix for every spectral point; every nonreal point admits a realization with at most two distinct self-loop weights. The real spectral set is [−1,1] for even n and (0,1] for odd n. Allowing deleted cycle edges adds only $0$ in odd dimension and adds nothing in even dimension. We also apply the classification to a branching network with matched holding probabilities on parallel paths. The proofs are independent of Karpelevich's theorem.
Related
- On the Spectral Region of 4-Cycle Stochastic Matrices
- Binary X-rays of doubly stochastic matrices
- Recursive construction of spectral basis and its application to matrices
- Noise-Robust Distributed Optimization Over Directed Graphs With Row Stochastic Matrices
- A Note on the NP-Hardness on Quadratic Optimization over Doubly Stochastic Matrices and the Gromov-Wasserstein Problem
BibTeX
@misc{verbeken2026spectral,
title = {{On the Spectral Region of n-Cycle Stochastic Matrices}},
author = {Brecht F. Verbeken and Vincent Ginis},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2606.10143},
eprint = {2606.10143},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.10143},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On the Spectral Region of n-Cycle Stochastic Matrices
AU - Brecht F. Verbeken
AU - Vincent Ginis
PY - 2026
DA - 2026/09/14
PB - arXiv
DO - 10.48550/arxiv.2606.10143
UR - https://arxiv.org/abs/2606.10143
AB - For every n≥3, we determine the union of the spectra of row-stochastic matrices supported on a directed n-cycle with self-loops and strictly positive cycle edges. These matrices describe progression through cyclic stages with geometric waiting times, and also arise by uniformization of unidirectional continuous-time reaction cycles. For the latter, the classification determines the minimum transition-rate bound required to realize a prescribed nonreal eigenvalue and provides rates attaining that bound. The angles m=Argλ and M=Arg(λ−1) reduce the nonreal eigenvalue problem to determining the range of a strictly convex logarithmic sum over angles with prescribed sum. Jensen's inequality gives its minimum, simplex vertices give its finite maximum, and connectedness makes these bounds sufficient for realization. The resulting branch graphs are strictly decreasing and their horizontal sections are ordered. This ordering gives the complete boundary, which alternates between uniform-cycle segments and one-loop algebraic arcs. We state a direct membership criterion and construct a realizing matrix for every spectral point; every nonreal point admits a realization with at most two distinct self-loop weights. The real spectral set is [−1,1] for even n and (0,1] for odd n. Allowing deleted cycle edges adds only $0$ in odd dimension and adds nothing in even dimension. We also apply the classification to a branching network with matched holding probabilities on parallel paths. The proofs are independent of Karpelevich's theorem.
ER -