A Functional Central Limit Theorem for a Markov-Modulated Infinite-Server Queue
Author:
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Statistics and Probability
Link
http://link.springer.com/content/pdf/10.1007/s11009-014-9405-8.pdf
Reference26 articles.
1. Anderson D, Kurtz T (2011) Continuous-time Markov chain models for chemical reaction networks. In: Koeppl H, et al. (eds)Design and analysis of biomolecular circuits: engineering approaches to systems and synthetic biology. Springer, New York, pp 3–42
2. Arazia A, Ben-Jacob E, Yechiali U (2004) Bridging genetic networks and queueing theory. Physica A 332:585–616
3. Asmussen S (2003) Applied probability and queues, 2nd edn. Springer, New York
4. Ball K, Kurtz T, Popovic L, Rempala G (2006) Asymptotic analysis of multi-scale approximations to reaction networks. Ann Appl Probab 16:1925–1961
5. Bhattacharya R N (1982) On the functional central limit theorem and the law of the iterated logarithm for Markov processes. Z. Wahrscheinlichkeitstheorie verw. Gebiete 60:185–201
Cited by 24 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adaptive minimax estimation of service time distribution in the $$M_t/G/\infty $$ queue from departure data;Queueing Systems;2024-07-27
2. A Moment Approach for a Conditional Central Limit Theorem of Infinite-Server Queue: A Case of M/MX/∞ Queue;Mathematics;2023-04-27
3. Diffusion approximation of an infinite-server queue under Markovian environment with rapid switching;Statistics & Probability Letters;2023-04
4. Retrial queues with generally distributed retrial times;Queueing Systems;2022-04
5. A Numerical Approach for Evaluating the Time-Dependent Distribution of a Quasi Birth-Death Process;Methodology and Computing in Applied Probability;2021-07-15
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3