IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v49y2020i19p4737-4750.html
   My bibliography  Save this article

On the functional central limit theorem for first passage time of nonlinear semi-Markov reward processes

Author

Listed:
  • Omid Chatrabgoun
  • Alireza Daneshkhah
  • Gholamali Parham

Abstract

In this article we examine the functional central limit theorem for the first passage time of reward processes defined over a finite state space semi-Markov process. In order to apply this process for a wider range of real-world applications, the reward functions, considered in this work, are assumed to have general forms instead of the constant rates reported in the other studies. We benefit from the martingale theory and Poisson equations to prove and establish the convergence of the first passage time of reward processes to a zero mean Brownian motion. Necessary conditions to derive the results presented in this article are the existence of variances for sojourn times in each state and second order integrability of reward functions with respect to the distribution of sojourn times. We finally verify the presented methodology through a numerical illustration.

Suggested Citation

  • Omid Chatrabgoun & Alireza Daneshkhah & Gholamali Parham, 2020. "On the functional central limit theorem for first passage time of nonlinear semi-Markov reward processes," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(19), pages 4737-4750, October.
  • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:19:p:4737-4750
    DOI: 10.1080/03610926.2019.1606917
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2019.1606917
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2019.1606917?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:49:y:2020:i:19:p:4737-4750. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.