首页> 外文期刊>Mathematics and computers in simulation >Coupling from the past with randomized quasi-Monte Carlo
【24h】

Coupling from the past with randomized quasi-Monte Carlo

机译:过去与准蒙特卡洛随机耦合

获取原文
获取原文并翻译 | 示例
       

摘要

The coupling-from-the-past (CFTP) algorithm of Propp and Wilson permits one to sample exactly from the stationary distribution of an ergodic Markov chain. By using it n times independently, we obtain an independent sample from that distribution. A more representative sample can be obtained by creating negative dependence between these n replicates; other authors have already proposed to do this via antithetic variates, Latin hypercube sampling, and randomized quasi-Monte Carlo (RQMC). We study a new, often more effective, way of combining CFTP with RQMC, based on the array-RQMC algorithm. We provide numerical illustrations for Markov chains with both finite and continuous state spaces, and compare with the RQMC combinations proposed earlier.
机译:Propp和Wilson的过去耦合(CFTP)算法允许从遍历马尔可夫链的平稳分布中精确采样。通过独立使用n次,我们可以从该分布中获得一个独立的样本。通过在这n个重复之间建立负相关关系,可以获得更具代表性的样本。其他作者已经建议通过对立变量,拉丁超立方采样和随机准蒙特卡罗(RQMC)来实现此目的。我们研究了一种基于array-RQMC算法的,将CFTP与RQMC结合的,通常更有效的新方法。我们提供了具有有限状态空间和连续状态空间的Markov链的数值插图,并与之前提出的RQMC组合进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号