LEVEL-WISE SUBGEOMETRIC CONVERGENCE OF THE LEVEL-INCREMENT TRUNCATION APPROXIMATION OF M/G/1-TYPE MARKOV CHAINS

Katsuhisa Ouchi, H. Masuyama
{"title":"LEVEL-WISE SUBGEOMETRIC CONVERGENCE OF THE LEVEL-INCREMENT TRUNCATION APPROXIMATION OF M/G/1-TYPE MARKOV CHAINS","authors":"Katsuhisa Ouchi, H. Masuyama","doi":"10.15807/jorsj.65.198","DOIUrl":null,"url":null,"abstract":"This paper considers the level-increment (LI) truncation approximation of M/G/1-type Markov chains. The LI truncation approximation is useful for implementing the M/G/1 paradigm, which is the framework for computing the stationary distribution of M/G/1-type Markov chains. The main result of this paper is a subgeometric convergence formula for the total variation distance between the original stationary distribution and its LI truncation approximation. Suppose that the equilibrium level-increment distribution is subexponential, and that the downward transition matrix is rank one. We then show that the convergence rate of the total variation error of the LI truncation approximation is equal to that of the tail of the equilibrium level-increment distribution and that of the tail of the original stationary distribution.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Operations Research Society of Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15807/jorsj.65.198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 2

Abstract

This paper considers the level-increment (LI) truncation approximation of M/G/1-type Markov chains. The LI truncation approximation is useful for implementing the M/G/1 paradigm, which is the framework for computing the stationary distribution of M/G/1-type Markov chains. The main result of this paper is a subgeometric convergence formula for the total variation distance between the original stationary distribution and its LI truncation approximation. Suppose that the equilibrium level-increment distribution is subexponential, and that the downward transition matrix is rank one. We then show that the convergence rate of the total variation error of the LI truncation approximation is equal to that of the tail of the equilibrium level-increment distribution and that of the tail of the original stationary distribution.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
M/G/1-型马尔可夫链的级增量截断逼近的级次几何收敛性
研究M/G/1型马尔可夫链的水平递增截断近似。LI截断近似有助于实现M/G/1范式,M/G/1范式是计算M/G/1型马尔可夫链平稳分布的框架。本文的主要结果是原始平稳分布与其LI截断近似之间的总变异距离的一个亚几何收敛公式。设均衡水平增量分布为次指数分布,向下转移矩阵为第一级。然后,我们证明了LI截断近似的总变异误差的收敛速度等于平衡水平增量分布尾部的收敛速度和原始平稳分布尾部的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of the Operations Research Society of Japan
Journal of the Operations Research Society of Japan 管理科学-运筹学与管理科学
CiteScore
0.70
自引率
0.00%
发文量
12
审稿时长
12 months
期刊介绍: The journal publishes original work and quality reviews in the field of operations research and management science to OR practitioners and researchers in two substantive categories: operations research methods; applications and practices of operations research in industry, public sector, and all areas of science and engineering.
期刊最新文献
IMPLEMENTING ARROW–DEBREU EQUILIBRIA IN APPROXIMATELY COMPLETE SECURITY MARKETS A RIEMANNIAN-GEOMETRICAL APPROACH TO STRICTLY CONVEX QUADRATIC PROGRAMMING WITH CONVEXITY-PRESERVING METRIC PARAMETERIZATION A SUBGEOMETRIC CONVERGENCE FORMULA FOR TOTAL-VARIATION ERROR OF THE LEVEL-INCREMENT TRUNCATION APPROXIMATION OF M/G/1-TYPE MARKOV CHAINS MIXED-INTEGER DC PROGRAMMING BASED ALGORITHMS FOR THE CIRCULAR PACKING PROBLEM A HYBRID ALGORITHM FOR THE ADWORDS PROBLEM
×
引用
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