Cosimla with General Regeneration Set to Compute Markov Chain Stationary Expectations.

Winter Simulation Conference(2023)

引用 0|浏览1
暂无评分
摘要
We extend the COSIMLA approach (short for "COmbined SIMulation and Linear Algebra") recently developed in Zheng, Infanger, and Glynn (2022) to compute stationary expectations for Markov chains with large or infinite discrete state space. Our work follows the idea of combing the best of linear algebra and simulation—using linear algebra to compute the "center" of the state space and using simulation to compute the contributions from outside of the "center". Different from Zheng, Infanger, and Glynn (2022) that needed to fix a single regeneration state, our work develops a new method that allows the use of a flexible regeneration set with a finite number of states. We show that this new method allows more efficient computation for the COSIMLA approach.
更多
查看译文
关键词
Markov Chain,State Space,Single State,Discrete Space,Linear Algebra,Large State Space,Discrete State Space,Finite Number Of States,Mean Square Error,Monte Carlo Simulation,Mean Time,Column Vector,Linear System,Stationary Distribution,Linear Solver,Computation Tasks,Reward Function,System Of Linear Equations,Queueing System,Wall-clock Time,Discrete Markov Chain,One-dimensional Chain,Mean Total Time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要