Somewhat stochastic matrices
Branko \'Curgus, Robert I. Jewett

TL;DR
This paper generalizes the classical theorem on regular stochastic matrices to include matrices without sign restrictions, replacing the regularity condition with a new condition based on the -distance between columns.
Contribution
It introduces a new condition based on -distance that extends the regularity theorem to a broader class of stochastic matrices without sign restrictions.
Findings
Generalization of the regular stochastic matrix theorem.
Condition based on -distance between columns.
Maintains column sum equal to 1.
Abstract
The standard theorem for regular stochastic matrices is generalized to matrices with no sign restriction on the entries. The condition that column sums be equal to 1 is kept, but the regularity condition is replaced by a condition on the -distances between columns.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Advanced Topics in Algebra
