arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/9801066math.CO
收藏

有限分配格的随机元生成

Generating Random Elements of Finite Distributive Lattices

James Propp

摘要:

这篇综述文章描述了一种从任何有限集中随机均匀选择的方法,该有限集合的对象可以被视为构成一个分配格。该方法基于作者和David Wilson的想法,使用“过去的耦合”来消除Monte Carlo随机化的初始化偏差。本文介绍了几个应用程序的特定种类的组合对象,如平铺,约束格路径,和交替符号矩阵。

英文摘要:

This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using ``coupling from the past'' to remove initialization bias from Monte Carlo randomization. The article describes several applications to specific kinds of combinatorial objects such as tilings, constrained lattice paths, and alternating-sign matrices.

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

↑