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

The extremal behaviour over regenerative cycles for Markov additive processes with heavy tails

Author

Listed:
  • Hansen, Niels Richard
  • Jensen, Anders Tolver

Abstract

We consider the reflection of an additive process with negative drift controlled by a Markov chain on a finite state space. We determine the tail behaviour of the distribution of the maximum over a regenerative cycle in the case with subexponential increments. Based on this, the asymptotic distribution of the running maximum is derived. Applications of the results to Markov modulated single server queueing systems are given.

Suggested Citation

  • Hansen, Niels Richard & Jensen, Anders Tolver, 2005. "The extremal behaviour over regenerative cycles for Markov additive processes with heavy tails," Stochastic Processes and their Applications, Elsevier, vol. 115(4), pages 579-591, April.
    • Handle: RePEc:eee:spapps:v:115:y:2005:i:4:p:579-591
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(04)00168-1
    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.

    References listed on IDEAS

    as
    1. Asmussen, Søren & Kalashnikov, Vladimir & Konstantinides, Dimitrios & Klüppelberg, Claudia & Tsitsiashvili, Gurami, 2002. "A local limit theorem for random walk maxima with heavy tails," Statistics & Probability Letters, Elsevier, vol. 56(4), pages 399-404, February.
    2. Alsmeyer, Gerold, 1994. "On the Markov renewal theorem," Stochastic Processes and their Applications, Elsevier, vol. 50(1), pages 37-56, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Serguei Foss & Takis Konstantopoulos & Stan Zachary, 2007. "Discrete and Continuous Time Modulated Random Walks with Heavy-Tailed Increments," Journal of Theoretical Probability, Springer, vol. 20(3), pages 581-612, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alsmeyer, Gerold, 1996. "Superposed continuous renewal processes A Markov renewal approach," Stochastic Processes and their Applications, Elsevier, vol. 61(2), pages 311-322, February.
    2. Masakiyo Miyazawa, 2011. "Light tail asymptotics in multidimensional reflecting processes for queueing networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 233-299, December.
    3. Wang, Yuebao & Yang, Yang & Wang, Kaiyong & Cheng, Dongya, 2007. "Some new equivalent conditions on asymptotics and local asymptotics for random sums and their applications," Insurance: Mathematics and Economics, Elsevier, vol. 40(2), pages 256-266, March.
    4. Konstantinides, Dimitrios & Tang, Qihe & Tsitsiashvili, Gurami, 2002. "Estimates for the ruin probability in the classical risk model with constant interest force in the presence of heavy tails," Insurance: Mathematics and Economics, Elsevier, vol. 31(3), pages 447-460, December.
    5. Toshiro Watanabe & Kouji Yamamuro, 2010. "Local Subexponentiality and Self-decomposability," Journal of Theoretical Probability, Springer, vol. 23(4), pages 1039-1067, December.
    6. Jiang, Tao & Wang, Yuebao & Cui, Zhaolei & Chen, Yuxin, 2019. "On the almost decrease of a subexponential density," Statistics & Probability Letters, Elsevier, vol. 153(C), pages 71-79.
    7. Søren Asmussen & Serguei Foss & Dmitry Korshunov, 2003. "Asymptotics for Sums of Random Variables with Local Subexponential Behaviour," Journal of Theoretical Probability, Springer, vol. 16(2), pages 489-518, April.
    8. Yuebao Wang & Hui Xu & Dongya Cheng & Changjun Yu, 2018. "The local asymptotic estimation for the supremum of a random walk with generalized strong subexponential summands," Statistical Papers, Springer, vol. 59(1), pages 99-126, March.
    9. Basrak, Bojan & Conroy, Michael & Olvera-Cravioto, Mariana & Palmowski, Zbigniew, 2022. "Importance sampling for maxima on trees," Stochastic Processes and their Applications, Elsevier, vol. 148(C), pages 139-179.
    10. Barbe, Ph. & McCormick, W.P. & Zhang, C., 2007. "Tail expansions for the distribution of the maximum of a random walk with negative drift and regularly varying increments," Stochastic Processes and their Applications, Elsevier, vol. 117(12), pages 1835-1847, December.
    11. Denis Denisov, 2021. "Maximum on a random time interval of a random walk with infinite mean," Queueing Systems: Theory and Applications, Springer, vol. 98(3), pages 211-223, August.
    12. Gao, Qingwu & Wang, Yuebao, 2009. "Ruin probability and local ruin probability in the random multi-delayed renewal risk model," Statistics & Probability Letters, Elsevier, vol. 79(5), pages 588-596, March.
    13. Gobet, Emmanuel & Menozzi, Stéphane, 2010. "Stopped diffusion processes: Boundary corrections and overshoot," Stochastic Processes and their Applications, Elsevier, vol. 120(2), pages 130-162, February.
    14. Gobet, Emmanuel & Menozzi, Stéphane, 2004. "Exact approximation rate of killed hypoelliptic diffusions using the discrete Euler scheme," Stochastic Processes and their Applications, Elsevier, vol. 112(2), pages 201-223, August.
    15. Alsmeyer, Gerold & Hoefs, Volker, 2002. "Markov renewal theory for stationary (m+1)-block factors: convergence rate results," Stochastic Processes and their Applications, Elsevier, vol. 98(1), pages 77-112, March.
    16. Fuh, Cheng-Der, 2021. "Asymptotic behavior for Markovian iterated function systems," Stochastic Processes and their Applications, Elsevier, vol. 138(C), pages 186-211.
    17. Predrag R. Jelenković & Petar Momčilović, 2004. "Large Deviations of Square Root Insensitive Random Sums," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 398-406, May.
    18. Haas, Bénédicte & Stephenson, Robin, 2018. "Bivariate Markov chains converging to Lamperti transform Markov additive processes," Stochastic Processes and their Applications, Elsevier, vol. 128(10), pages 3558-3605.
    19. Dmitry Korshunov, 2008. "The Key Renewal Theorem for a Transient Markov Chain," Journal of Theoretical Probability, Springer, vol. 21(1), pages 234-245, March.
    20. Geluk, J.L. & Frenk, J.B.G., 2011. "Renewal theory for random variables with a heavy tailed distribution and finite variance," Statistics & Probability Letters, Elsevier, vol. 81(1), pages 77-82, January.

    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:115:y:2005:i:4:p:579-591. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.