Law of Large Numbers for products of random matrices with coefficients in the max-plus semi-ring
Glenn Merlet
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 -∞.
Create a lesson
Related papers
Distribution-constrained optimal multiple stopping: the Root-type solution
Shuoqing Deng, Daxin Huang
Universality and sharp thresholds for ellipsoid fitting
Frederic Koehler, Youngtak Sohn
Local Laws and Edge Universality for Noncentral Sample Covariance Matrices
Can Hu, Jiang Hu, Zhidong Bai
Well-posedness and regularity of stochastic heat equations on moving domains
Chongyang Ren, Tusheng Zhang
Traveling Waves in Equity Markets with Rank-Based Entry and Exit
Graeme Baker, Caroline Smyth
An approximate zero bias transformation for random sums: Applications to sampling with outliers, auto insurance, and generative AI
Wasamon Jantai, Nathakhun Wiroonsri