A central limit theorem for stochastic recursive sequences of topical operators

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/105051607000000168 in the Annals of Applied Probability (http://www.imstat.org/aap/) by

Scientific paper

10.1214/105051607000000168

Let $(A_n)_{n\in\mathbb{N}}$ be a stationary sequence of topical (i.e., isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n+1,x_0)=A_nx(n,x_0)$. It can model a wide range of systems including train or queuing networks, job-shop, timed digital circuits or parallel processing systems. When $(A_n)_{n\in\mathbb{N}}$ has the memory loss property, $(x(n,x_0))_{n\in\mathbb{N}}$ satisfies a strong law of large numbers. We show that it also satisfies the CLT if $(A_n)_{n\in \mathbb{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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A central limit theorem for stochastic recursive sequences of topical operators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A central limit theorem for stochastic recursive sequences of topical operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A central limit theorem for stochastic recursive sequences of topical operators will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-572428

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.