Law of Large Numbers for products of random matrices with coefficients in the max-plus semi-ring
Abstract
We analyze the asymptotic behavior of random variables x(n,x\0) defined by x(0,x\0)=x\0 and x(n+1,x\0)=A(n)x(n,x\0), where is a stationary and ergodic sequence of random matrices with entries in the semi-ring \-∞\ whose addition is the and whose multiplication is +. Such sequences modelize a large class of discrete event systems, among which timed event graphs, 1-bounded Petri nets, some queuing networks, train or computer networks. We give necessary conditions for (1nx(n,x\0))\n∈ to converge almost surely. Then, we prove a general scheme to give partial converse theorems. When \A\ij(0)≠ -∞|A\ij(0)| is integrable, it allows us: - to give a necessary and sufficient condition for the convergence of (1nx(n,0))\n∈ when the sequence (A(n))\n∈ is i.i.d., - to prove that, if (A(n) )\n∈ satisfy a condition of reinforced ergodicity and a condition of fixed structure (i.e. (A\ij(0)=-∞)∈\0,1\), then (1nx(n,0))\n∈ converges almost-surely, - and to reprove the convergence of (1nx(n,0))\n∈ if the diagonal entries are never -∞.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.