Extreme Value Analysis for a Markov Additive Process Driven by a Nonirreducible Background Chain

Q1 Mathematics Stochastic Systems Pub Date : 2022-01-26 DOI:10.1287/stsy.2021.0086
Lucas van Kreveld, M. Mandjes, Jan-Pieter L. Dorsman
{"title":"Extreme Value Analysis for a Markov Additive Process Driven by a Nonirreducible Background Chain","authors":"Lucas van Kreveld, M. Mandjes, Jan-Pieter L. Dorsman","doi":"10.1287/stsy.2021.0086","DOIUrl":null,"url":null,"abstract":"A common assumption in the vast literature on the extremes of spectrally one-sided Markov additive processes (MAPs) is that the continuous-time Markov chain that serves as the background process is irreducible. In the present paper, we consider, motivated by, for example, applications in credit risk, the case in which the irreducibility condition has been lifted, thus allowing the presence of one or more transient classes. More specifically, we consider the distribution of the maximum when the MAP under study has only positive jumps (the spectrally positive case) or negative jumps (the spectrally negative case). The methodology used relies on two crucial previous results: (i) the Wiener–Hopf decomposition for Lévy processes and, in particular, its explicit form in spectrally one-sided cases and (ii) a result on the number of singularities of the matrix exponent of a spectrally one-sided MAP. In both the spectrally positive and negative cases, we derive a system of linear equations of which the solution characterizes the distribution of the maximum of the process. As a by-product of our results, we develop a procedure for calculating the maximum of a spectrally one-sided Lévy process over a phase-type distributed time interval.","PeriodicalId":36337,"journal":{"name":"Stochastic Systems","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Stochastic Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/stsy.2021.0086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2

Abstract

A common assumption in the vast literature on the extremes of spectrally one-sided Markov additive processes (MAPs) is that the continuous-time Markov chain that serves as the background process is irreducible. In the present paper, we consider, motivated by, for example, applications in credit risk, the case in which the irreducibility condition has been lifted, thus allowing the presence of one or more transient classes. More specifically, we consider the distribution of the maximum when the MAP under study has only positive jumps (the spectrally positive case) or negative jumps (the spectrally negative case). The methodology used relies on two crucial previous results: (i) the Wiener–Hopf decomposition for Lévy processes and, in particular, its explicit form in spectrally one-sided cases and (ii) a result on the number of singularities of the matrix exponent of a spectrally one-sided MAP. In both the spectrally positive and negative cases, we derive a system of linear equations of which the solution characterizes the distribution of the maximum of the process. As a by-product of our results, we develop a procedure for calculating the maximum of a spectrally one-sided Lévy process over a phase-type distributed time interval.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
不可约背景链驱动的马尔可夫加性过程的极值分析
在大量关于谱单侧马尔可夫加性过程(MAPs)极值的文献中,一个常见的假设是作为背景过程的连续时间马尔可夫链是不可约的。在本文中,我们考虑到,例如,信用风险中的应用,在这种情况下,不可约条件已经解除,从而允许存在一个或多个暂态类。更具体地说,我们考虑了当所研究的MAP只有正跳跃(谱正情况)或负跳跃(谱负情况)时最大值的分布。所使用的方法依赖于先前的两个关键结果:(i) lsamvy过程的Wiener-Hopf分解,特别是它在频谱单侧情况下的显式形式;(ii)频谱单侧MAP的矩阵指数的奇点数的结果。在谱正和谱负两种情况下,我们导出了一个线性方程组,其解表征了过程最大值的分布。作为我们的结果的副产品,我们开发了一个程序,用于计算在相位型分布的时间间隔上光谱单侧lsamvy过程的最大值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Stochastic Systems
Stochastic Systems Decision Sciences-Statistics, Probability and Uncertainty
CiteScore
3.70
自引率
0.00%
发文量
18
期刊最新文献
Sharp Waiting-Time Bounds for Multiserver Jobs Asymptotic Optimality of Switched Control Policies in a Simple Parallel Server System Under an Extended Heavy Traffic Condition Distributionally Robust Observable Strategic Queues The BAR Approach for Multiclass Queueing Networks with SBP Service Policies Ergodic Control of Bipartite Matching Queues with Class Change and Matching Failure
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1