A bound on the scrambling index of a primitive matrix using Boolean rank
From MaRDI portal
Publication:732085
Abstract: The scrambling index of an primitive matrix is the smallest positive integer such that , where denotes the transpose of and denotes the all ones matrix. For an Boolean matrix , its {it Boolean rank} is the smallest positive integer such that for some Boolean matrix and Boolean matrix . In this paper, we give an upper bound on the scrambling index of an primitive matrix in terms of its Boolean rank . Furthermore we characterize all primitive matrices that achieve the upper bound.
Recommendations
- The primitive Boolean matrices with the second largest scrambling index by Boolean rank.
- The scrambling index of primitive digraphs
- On the second largest scrambling index of primitive matrices.
- A bound on the exponent of a primitive matrix using Boolean rank
- On extremal matrices of second largest exponent by Boolean rank
Cites work
- A bound on the exponent of a primitive matrix using Boolean rank
- Coefficients of ergodicity and the scrambling index
- Combinatorial matrix theory
- On extremal matrices of second largest exponent by Boolean rank
- On the exponent of a primitive digraph
- Primitive digraphs with the largest scrambling index
- Unzerlegbare, nicht negative Matrizen
Cited in
(16)- Characterization of irreducible Boolean matrices with the largest generalized competition index
- The scrambling index of symmetric primitive matrices
- On the second largest scrambling index of primitive matrices.
- Bounds on the generalized \(\mu \)-scrambling indices of primitive digraphs
- Characteristic matrix of covering and its application to Boolean matrix decomposition
- scientific article; zbMATH DE number 6863760 (Why is no real title available?)
- A bound on the exponent of a primitive matrix using Boolean rank
- Scrambling index set of primitive digraphs
- Generalized scrambling indices of a primitive digraph
- The primitive Boolean matrices with the second largest scrambling index by Boolean rank.
- The scrambling index of primitive digraphs
- Some bounds of the generalized \(\mu \)-scrambling indices of primitive digraphs with \(d\) loops
- A bound on the generalized competition index of a primitive matrix using Boolean rank
- Upper bounds on scrambling index for non-primitive digraphs
- Generalized competition index of an irreducible Boolean matrix
- Generalized competition index of primitive digraphs
This page was built for publication: A bound on the scrambling index of a primitive matrix using Boolean rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732085)