We develop a new approach for characterizing k-primitive matrix families. Such families generalize the notion of a primitive matrix. They have been intensively studied in the recent literature due to applications to Markov chains, linear dynamical systems, and graph theory. We prove, under some mild assumptions, that a set of k nonnegative matrices is either k-primitive or there exists a nontrivial partition of the set of basis vectors, on which these matrices act as commuting permutations. This gives a convenient classification of k-primitive families and a polynomial-time algorithm to recognize them. This also extends some results of Perron-Frobenius theory to nonnegative matrix families. Copyright © 2013 by SIAM.

Classification of k-primitive sets of matrices

PROTASOV, Vladimir
2013-01-01

Abstract

We develop a new approach for characterizing k-primitive matrix families. Such families generalize the notion of a primitive matrix. They have been intensively studied in the recent literature due to applications to Markov chains, linear dynamical systems, and graph theory. We prove, under some mild assumptions, that a set of k nonnegative matrices is either k-primitive or there exists a nontrivial partition of the set of basis vectors, on which these matrices act as commuting permutations. This gives a convenient classification of k-primitive families and a polynomial-time algorithm to recognize them. This also extends some results of Perron-Frobenius theory to nonnegative matrix families. Copyright © 2013 by SIAM.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11697/111803
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 6
social impact