Products of irreducible random matrices in the (Max,+) Algebra

@article{Mairesse1993ProductsOI,
  title={Products of irreducible random matrices in the (Max,+) Algebra},
  author={Jean Mairesse},
  journal={CoRR},
  year={1993},
  volume={abs/0707.3672}
}
We consider the recursive equation \x(n + 1) = A(n) x(n)" where x(n + 1) and x(n) are Rk -valued vectors and A(n) is an irreducible random matrix of size k k. The matrix-vector multiplication in the (max,+) algebra is de ned by (A(n) x(n))i = 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… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Ergodic Theory of Stochastic Petri Networks

  • F. Baccelli
  • Annals of Probability,
  • 1992
Highly Influential
12 Excerpts

Convergence of Probability Measures

  • P. Billingsley
  • 1968
Highly Influential
3 Excerpts

On Coupling and Weak Convergence to Stationarity

  • S. Asmussen
  • Annals of Applied Probability,
  • 1992
Highly Influential
6 Excerpts

Applied Probability and Queues

  • S. Asmussen
  • 1987
Highly Influential
6 Excerpts

On a Class of Stochastic Recursive Equations Arising in Queueing Theory

  • F. Baccelli, Z. Liu
  • Annals of Probability,
  • 1992
2 Excerpts

Asymptotic Behavior of Random Discrete Event Systems, Stoch

  • J. Resing, R. de Vries, G. Hooghiemstra, M. Keane, G. J. Olsder
  • Processes and their Applications,
  • 1990
1 Excerpt

Asymptotic Methods in Queueing

  • A. Borovkov
  • 1984
1 Excerpt

On the ergodicity of a closed queuing network, Research Report, AMS 1980: 60K25

  • H. Kaspi, A. Mandelbaum
  • 1980
1 Excerpt

Similar Papers

Loading similar papers…