A central limit theorem for stochastic recursive sequences of topical operators

From MaRDI portal
Publication:2467606

DOI10.1214/105051607000000168zbMATH Open1220.60016arXivmath/0606668OpenAlexW3102897010MaRDI QIDQ2467606FDOQ2467606

Glenn Merlet

Publication date: 28 January 2008

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: Let (An)ninmathbbN 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)ninmathbbN has the memory loss property, (x(n,x0))ninmathbbN satisfies a strong law of large numbers. We show that it also satisfies the CLT if (An)ninmathbbN 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.


Full work available at URL: https://arxiv.org/abs/math/0606668





Cites Work


Cited In (2)


   Recommendations





This page was built for publication: A central limit theorem for stochastic recursive sequences of topical operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467606)