 Semi-stationary clearing processesRichard Serfozo and Shaler Stidham Stochastic Processes and their Applications, 1978, vol. 6, issue 2, 165-178 Abstract: A clearing process describes the net quantity in a service system (e.g. a batch service queue or dam) which receives an exogenous random input over time. and has an output mechanism that intermittently clears random quantities from the system. A semistationary clearing process is strictly stationary over its random clearing epochs. We describe the asymptotic distribution of such processes and show how it arises in limits of certain functionals of these processes. An asymptotic distribution is different from a limiting distribution, but it has some similar properties. We then identify some clearing processes whose asymptotic distribution is uniform. This is true for modulo c clearing with a stationary input if the Palm probability is used rather than the usual probability. Our results on this give a partial answer to an anomaly in the classical economic lot size inventory model. We also present a functional central limit law and law of the iterated logorithm for clearing processes, as well as a result on the convergence of a sequence of such processes. Date: 1978 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:6:y:1978:i:2:p:165-178 Ordering information: This journal article can be ordered from Access Statistics for this article Stochastic Processes and their Applications is currently edited by T. Mikosch More articles in Stochastic Processes and their Applications from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.