arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0708.1116cs.CEcond-mat.stat-mech
收藏

反冲增长算法的一种变体,用于生成多聚合物体系

A variant of the Recoil Growth algorithm to generate multi-polymer systems

Florian Simatos

摘要:

Recoil Growth算法由Consta等人于1999年提出,是文献中可用于从多聚合物体系中取样的最有效的算法之一。这些问题与自回避路径的生成密切相关。在本文中,我们研究了原始反冲增长算法的一个变体,在这里我们限制生成一个新的聚合物发生在一个特定的一类图。这使得有可能在计算成本和成功率之间做出很好的权衡。此外,我们给出了一个简单的证明,该下界的不可约性的新算法,这也适用于原算法。

英文摘要:

The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. Such problems are closely related to the generation of self-avoiding paths. In this paper, we study a variant of the original Recoil Growth algorithm, where we constrain the generation of a new polymer to take place on a specific class of graphs. This makes it possible to make a fine trade-off between computational cost and success rate. We moreover give a simple proof for a lower bound on the irreducibility of this new algorithm, which applies to the original algorithm as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑