依赖水平的准出生-死亡过程中极值和相关命中概率的计算方法

IF 4.4 2区 数学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Mathematics and Computers in Simulation Pub Date : 2024-08-24 DOI:10.1016/j.matcom.2024.08.019
A. Di Crescenzo , A. Gómez-Corral , D. Taipe
{"title":"依赖水平的准出生-死亡过程中极值和相关命中概率的计算方法","authors":"A. Di Crescenzo ,&nbsp;A. Gómez-Corral ,&nbsp;D. Taipe","doi":"10.1016/j.matcom.2024.08.019","DOIUrl":null,"url":null,"abstract":"<div><p>This paper analyzes the dynamics of a level-dependent quasi-birth–death process <span><math><mrow><mi>X</mi><mo>=</mo><mrow><mo>{</mo><mrow><mo>(</mo><mi>I</mi><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow><mo>,</mo><mi>J</mi><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>:</mo><mi>t</mi><mo>≥</mo><mn>0</mn><mo>}</mo></mrow></mrow></math></span>, i.e., a bi-variate Markov chain defined on the countable state space <span><math><mrow><msubsup><mrow><mo>∪</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>∞</mi></mrow></msubsup><mi>l</mi><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></mrow></math></span> with <span><math><mrow><mi>l</mi><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow><mo>=</mo><mrow><mo>{</mo><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow><mo>:</mo><mi>j</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>M</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>}</mo></mrow><mo>}</mo></mrow></mrow></math></span>, for integers <span><math><mrow><msub><mrow><mi>M</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∈</mo><msub><mrow><mi>N</mi></mrow><mrow><mn>0</mn></mrow></msub></mrow></math></span> and <span><math><mrow><mi>i</mi><mo>∈</mo><msub><mrow><mi>N</mi></mrow><mrow><mn>0</mn></mrow></msub></mrow></math></span>, which has the special property that its <span><math><mi>q</mi></math></span>-matrix has a block-tridiagonal form. Under the assumption that the first passage to the subset <span><math><mrow><mi>l</mi><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow></mrow></math></span> occurs in a finite time with certainty, we characterize the probability law of <span><math><mrow><mo>(</mo><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>,</mo><msub><mrow><mi>I</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>,</mo><mi>J</mi><mrow><mo>(</mo><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>)</mo></mrow><mo>)</mo></mrow></math></span>, where <span><math><msub><mrow><mi>I</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span> is the running maximum level attained by process <span><math><mi>X</mi></math></span> before its first visit to states in <span><math><mrow><mi>l</mi><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow></mrow></math></span>, <span><math><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span> is the first time that the level process <span><math><mrow><mo>{</mo><mi>I</mi><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow><mo>:</mo><mi>t</mi><mo>≥</mo><mn>0</mn><mo>}</mo></mrow></math></span> reaches the running maximum <span><math><msub><mrow><mi>I</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span>, and <span><math><mrow><mi>J</mi><mrow><mo>(</mo><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>)</mo></mrow></mrow></math></span> is the phase at time <span><math><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span>. Our methods rely on the use of restricted Laplace–Stieltjes transforms of <span><math><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span> on the set of sample paths <span><math><mrow><mo>{</mo><msub><mrow><mi>I</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>=</mo><mi>i</mi><mo>,</mo><mi>J</mi><mrow><mo>(</mo><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>)</mo></mrow><mo>=</mo><mi>j</mi><mo>}</mo></mrow></math></span>, and related processes under taboo of certain subsets of states. The utility of the resulting computational algorithms is demonstrated in two epidemic models: the SIS model for horizontally and vertically transmitted diseases; and the SIR model with constant population size.</p></div>","PeriodicalId":49856,"journal":{"name":"Mathematics and Computers in Simulation","volume":"228 ","pages":"Pages 211-224"},"PeriodicalIF":4.4000,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0378475424003215/pdfft?md5=ec529de84353f32482eeacc5cffbcd11&pid=1-s2.0-S0378475424003215-main.pdf","citationCount":"0","resultStr":"{\"title\":\"A computational approach to extreme values and related hitting probabilities in level-dependent quasi-birth–death processes\",\"authors\":\"A. Di Crescenzo ,&nbsp;A. Gómez-Corral ,&nbsp;D. Taipe\",\"doi\":\"10.1016/j.matcom.2024.08.019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper analyzes the dynamics of a level-dependent quasi-birth–death process <span><math><mrow><mi>X</mi><mo>=</mo><mrow><mo>{</mo><mrow><mo>(</mo><mi>I</mi><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow><mo>,</mo><mi>J</mi><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow><mo>)</mo></mrow><mo>:</mo><mi>t</mi><mo>≥</mo><mn>0</mn><mo>}</mo></mrow></mrow></math></span>, i.e., a bi-variate Markov chain defined on the countable state space <span><math><mrow><msubsup><mrow><mo>∪</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>∞</mi></mrow></msubsup><mi>l</mi><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></mrow></math></span> with <span><math><mrow><mi>l</mi><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow><mo>=</mo><mrow><mo>{</mo><mrow><mo>(</mo><mi>i</mi><mo>,</mo><mi>j</mi><mo>)</mo></mrow><mo>:</mo><mi>j</mi><mo>∈</mo><mrow><mo>{</mo><mn>0</mn><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>M</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>}</mo></mrow><mo>}</mo></mrow></mrow></math></span>, for integers <span><math><mrow><msub><mrow><mi>M</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>∈</mo><msub><mrow><mi>N</mi></mrow><mrow><mn>0</mn></mrow></msub></mrow></math></span> and <span><math><mrow><mi>i</mi><mo>∈</mo><msub><mrow><mi>N</mi></mrow><mrow><mn>0</mn></mrow></msub></mrow></math></span>, which has the special property that its <span><math><mi>q</mi></math></span>-matrix has a block-tridiagonal form. Under the assumption that the first passage to the subset <span><math><mrow><mi>l</mi><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow></mrow></math></span> occurs in a finite time with certainty, we characterize the probability law of <span><math><mrow><mo>(</mo><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>,</mo><msub><mrow><mi>I</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>,</mo><mi>J</mi><mrow><mo>(</mo><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>)</mo></mrow><mo>)</mo></mrow></math></span>, where <span><math><msub><mrow><mi>I</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span> is the running maximum level attained by process <span><math><mi>X</mi></math></span> before its first visit to states in <span><math><mrow><mi>l</mi><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow></mrow></math></span>, <span><math><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span> is the first time that the level process <span><math><mrow><mo>{</mo><mi>I</mi><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow><mo>:</mo><mi>t</mi><mo>≥</mo><mn>0</mn><mo>}</mo></mrow></math></span> reaches the running maximum <span><math><msub><mrow><mi>I</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span>, and <span><math><mrow><mi>J</mi><mrow><mo>(</mo><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>)</mo></mrow></mrow></math></span> is the phase at time <span><math><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span>. Our methods rely on the use of restricted Laplace–Stieltjes transforms of <span><math><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub></math></span> on the set of sample paths <span><math><mrow><mo>{</mo><msub><mrow><mi>I</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>=</mo><mi>i</mi><mo>,</mo><mi>J</mi><mrow><mo>(</mo><msub><mrow><mi>τ</mi></mrow><mrow><mo>max</mo></mrow></msub><mo>)</mo></mrow><mo>=</mo><mi>j</mi><mo>}</mo></mrow></math></span>, and related processes under taboo of certain subsets of states. The utility of the resulting computational algorithms is demonstrated in two epidemic models: the SIS model for horizontally and vertically transmitted diseases; and the SIR model with constant population size.</p></div>\",\"PeriodicalId\":49856,\"journal\":{\"name\":\"Mathematics and Computers in Simulation\",\"volume\":\"228 \",\"pages\":\"Pages 211-224\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0378475424003215/pdfft?md5=ec529de84353f32482eeacc5cffbcd11&pid=1-s2.0-S0378475424003215-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics and Computers in Simulation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0378475424003215\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics and Computers in Simulation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0378475424003215","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本文分析了与水平相关的准出生-死亡过程 X={(I(t),J(t)):t≥0}的动力学,即定义在可数状态空间∪i=0∞l(i)上的双变量马尔可夫链、一个定义在可数状态空间∪i=0∞l(i)上的双变量马尔可夫链,对于整数 Mi∈N0 和 i∈N0,l(i)={(i,j):j∈{0,...,Mi}}。假设第一次访问子集 l(0)是在有限时间内确定发生的,我们将描述(τmax,Imax,J(τmax))的概率规律,其中 Imax 是进程 X 在第一次访问 l(0)中的状态之前达到的运行最大水平,τmax 是水平进程 {I(t):t≥0} 第一次达到运行最大 Imax 的时间,J(τmax) 是τmax 时间的相位。我们的方法依赖于在样本路径集 {Imax=i,J(τmax)=j} 上使用τmax 的受限拉普拉斯-斯蒂尔杰斯变换,以及在某些状态子集禁忌下的相关过程。由此产生的计算算法的实用性在两个流行病模型中得到了证明:横向和纵向传播疾病的 SIS 模型;以及人口规模恒定的 SIR 模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A computational approach to extreme values and related hitting probabilities in level-dependent quasi-birth–death processes

This paper analyzes the dynamics of a level-dependent quasi-birth–death process X={(I(t),J(t)):t0}, i.e., a bi-variate Markov chain defined on the countable state space i=0l(i) with l(i)={(i,j):j{0,,Mi}}, for integers MiN0 and iN0, which has the special property that its q-matrix has a block-tridiagonal form. Under the assumption that the first passage to the subset l(0) occurs in a finite time with certainty, we characterize the probability law of (τmax,Imax,J(τmax)), where Imax is the running maximum level attained by process X before its first visit to states in l(0), τmax is the first time that the level process {I(t):t0} reaches the running maximum Imax, and J(τmax) is the phase at time τmax. Our methods rely on the use of restricted Laplace–Stieltjes transforms of τmax on the set of sample paths {Imax=i,J(τmax)=j}, and related processes under taboo of certain subsets of states. The utility of the resulting computational algorithms is demonstrated in two epidemic models: the SIS model for horizontally and vertically transmitted diseases; and the SIR model with constant population size.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematics and Computers in Simulation
Mathematics and Computers in Simulation 数学-计算机:跨学科应用
CiteScore
8.90
自引率
4.30%
发文量
335
审稿时长
54 days
期刊介绍: The aim of the journal is to provide an international forum for the dissemination of up-to-date information in the fields of the mathematics and computers, in particular (but not exclusively) as they apply to the dynamics of systems, their simulation and scientific computation in general. Published material ranges from short, concise research papers to more general tutorial articles. Mathematics and Computers in Simulation, published monthly, is the official organ of IMACS, the International Association for Mathematics and Computers in Simulation (Formerly AICA). This Association, founded in 1955 and legally incorporated in 1956 is a member of FIACC (the Five International Associations Coordinating Committee), together with IFIP, IFAV, IFORS and IMEKO. Topics covered by the journal include mathematical tools in: •The foundations of systems modelling •Numerical analysis and the development of algorithms for simulation They also include considerations about computer hardware for simulation and about special software and compilers. The journal also publishes articles concerned with specific applications of modelling and simulation in science and engineering, with relevant applied mathematics, the general philosophy of systems simulation, and their impact on disciplinary and interdisciplinary research. The journal includes a Book Review section -- and a "News on IMACS" section that contains a Calendar of future Conferences/Events and other information about the Association.
期刊最新文献
An innovative fractional grey system model and its application Large time solution for collisional breakage model: Laplace transformation based accelerated homotopy perturbation method Efficient second-order accurate exponential time differencing for time-fractional advection–diffusion–reaction equations with variable coefficients Multi-objective optimization of the appendages of a sailing yacht using the Normal Boundary Intersection method Dynamic analysis and data-driven inference of a fractional-order SEIHDR epidemic model with variable parameters
×
引用
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