Discretization of Continuous Markov Chains and Markov Chain Monte Carlo Convergence Assessment
连续状态马尔可夫链的离散化与 MCMC 收敛评估AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于通用 MCMC 计算与诊断理论,未明确联系所列计量细分领域。
反馈分类问题连续状态马尔可夫链的离散化与 MCMC 收敛评估AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We show that continuous state-space Markov chains can be rigorously discretized into finite Markov chains. The idea is to subsample the continuous chain at renewal times related to small sets that control the discretization. Once a finite Markov chain is derived from the Markov chain Monte Carlo output, general convergence properties on finite state spaces can be exploited for convergence assessment in several directions. Our choice is based on a divergence criterion derived from Kemeny and Snell, which is first evaluated on parallel chains with a stopping time and then implemented, more efficiently, on two parallel chains only, using Birkhoff's pointwise ergodic theorem for stopping rules. The performance of this criterion is illustrated on three standard examples.