Upper bounds on scrambling index for non-primitive digraphs
From MaRDI portal
Publication:5158089
Recommendations
Cites work
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- A bound on the scrambling index of a primitive matrix using Boolean rank
- Additive maps preserving the scrambling index are bijective
- Coefficients of ergodicity and the scrambling index
- Combinatorial matrix theory
- Depth-First Search and Linear Graph Algorithms
- Double centralizing theorem with respect to \(q\)-commutativity relation
- Generalized exponents of primitive directed graphs
- Generalized scrambling indices of a primitive digraph
- Maps preserving matrices of extremal scrambling index
- Maps preserving scrambling index
- Non-negative matrices and Markov chains. 2nd ed
- Preserving \(\lambda\)-scrambling matrices
- Primitive digraphs with the largest scrambling index
- Scrambling index set of primitive digraphs
- The scrambling index of primitive digraphs
- The scrambling index of symmetric primitive matrices
Cited in
(10)- On the second largest scrambling index of primitive matrices.
- Nonnegative chainable matrices
- Coefficients of ergodicity and the scrambling index
- Primitive digraphs with the largest scrambling index
- scientific article; zbMATH DE number 6863760 (Why is no real title available?)
- Scrambling index set of primitive digraphs
- Generalized scrambling indices of a primitive digraph
- The scrambling index of primitive digraphs
- Ergodic theory of diagonal orthogonal covariant quantum channels
- Preserving \(\lambda\)-scrambling matrices
This page was built for publication: Upper bounds on scrambling index for non-primitive digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158089)