IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v40y1992i1p29-43.html
   My bibliography  Save this article

Uniform Cesaro limit theorems for synchronous processes with applications to queues

Author

Listed:
  • Glynn, Peter
  • Sigman, Karl

Abstract

Let X={X(t):t[greater-or-equal, slanted]0} be a positive recurrent synchronous process (PRS), that is, a process for which there exists an increasing sequence of random times [tau]={[tau](k)} such that for each k the distribution of is the same and the cycle lengths have finite first moment. Such processes (in general) do not converge to steady-state weakly (or in total variation) even when regularity conditions are placed on the cycles (such as non-lattice, spread-out, or mixing). Nonetheless, in the present paper we first show that the distributions of {[theta]sX:s > 0} are tight in the function space . Then we investigate conditions under which the Cesaro averaged functionals converge uniformly (over a class of functions) to [pi]([latin small letter f with hook]), where [pi] is the stationary distribution of X. We show that uniformly over [latin small letter f with hook] satisfying ||[latin small letter f with hook]||[infinity][less-than-or-equals, slant]1 (total variation convergence). We also show that to obtain uniform convergence over all [latin small letter f with hook] satisfying [latin small letter f with hook][less-than-or-equals, slant]g (g[epsilon]L+1([pi]) fixed) requires placing further conditions on the PRS. This is in sharp contrast to both classical regenerative processes and discrete time Harris recurrent Markov chains (where renewal theory can be applied) where such uniform convergence holds without any further conditions. For continuous time positive Harris recurrent Markov processes (where renewal theory cannot be applied) we show that these further conditions are in fact automatically satisfied. In this context, applications to queueing models are given.

Suggested Citation

  • Glynn, Peter & Sigman, Karl, 1992. "Uniform Cesaro limit theorems for synchronous processes with applications to queues," Stochastic Processes and their Applications, Elsevier, vol. 40(1), pages 29-43, February.
  • Handle: RePEc:eee:spapps:v:40:y:1992:i:1:p:29-43
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(92)90135-D
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Karl Sigman & Ward Whitt, 2019. "Marked point processes in discrete time," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 47-81, June.
    2. Nieuwenhuis, G., 1996. "Ergodicity Conditions and Cesaro Limit Results for Marked Point Processes," Research Memorandum 736, Tilburg University, School of Economics and Management.
    3. Bazsa-Oldenkamp, E.M. & den Iseger, P., 2003. "Wide sense one-dependent processes with embedded Harris chains and their applications in inventory management," Econometric Institute Research Papers EI 2002-44, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. Olav Kallenberg, 2002. "Ergodic Properties of Palm and Spacing Measures," Journal of Theoretical Probability, Springer, vol. 15(1), pages 77-96, January.
    5. Thorisson, Hermann, 1995. "On time- and cycle-stationarity," Stochastic Processes and their Applications, Elsevier, vol. 55(2), pages 183-209, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:40:y:1992:i:1:p:29-43. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.