A central limit theorem for stochastic recursive sequences of topical operators

Abstract

Let (An)n∈N be a stationary sequence of topical (i.e., isotone and additively homogeneous) operators. Let x(n,x0) be defined by x(0,x0)=x0 and x(n+1,x0)=Anx(n,x0). It can model a wide range of systems including train or queuing networks, job-shop, timed digital circuits or parallel processing systems. When (An)n∈N has the memory loss property, (x(n,x0))n∈N satisfies a strong law of large numbers. We show that it also satisfies the CLT if (An)n∈ N fulfills the same mixing and integrability assumptions that ensure the CLT for a sum of real variables in the results by P. Billingsley and I. Ibragimov.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…