Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T10:06:22.412Z Has data issue: false hasContentIssue false

Products of Irreducible Random Matrices in the (Max, +) Algebra

Published online by Cambridge University Press:  01 July 2016

Jean Mairesse*
Affiliation:
INRIA

Abstract

We consider the recursive equation x(n + 1)= A(n)⊗x(n), where x(n + 1) and x(n) are ℝk -valued vectors and A(n) is an irreducible random matrix of size k × k. The matrix-vector multiplication in the (max, +) algebra is defined by (A(n)⊗x(n))= maxj (Aij (n) + xj (n)). This type of equation can be used to represent the evolution of stochastic event graphs which include cyclic Jackson networks, some manufacturing models and models with general blocking (such as Kanban). Let us assume that the sequence {A(n), n ∈ ℕ} is i.i.d. or, more generally, stationary and ergodic. The main result of the paper states that the system couples in finite time with a unique stationary regime if and only if there exists a set of matrices such that and the matrices have a unique periodic regime.

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1997 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable