arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0802.2592math.PR
收藏

关于多米诺骨牌的洗牌算法

On the Shuffling Algorithm for Domino Tilings

Eric Nordenstam

摘要:

我们研究了一个相互作用的粒子的特定离散模型的动力学,该模型来自于对阿兹特克钻石的随机平铺进行采样的所谓洗牌算法。事实证明,转移概率有一个特别方便的行列式形式。乔恩·沃伦(Jon Warren)最近在研究交错布朗运动的某些模型时得到了一个连续情形下的类似公式,它可以用来构造Dyson的不相交布朗运动.我们猜想Warren模型可以作为我们的离散模型的标度极限恢复,并证明了这方面的一些部分结果。作为一个应用程序,这些结果之一,我们用它来重新推导已知的结果,随机平铺的阿兹特克钻石,适当地重新缩放附近的一个转折点,收敛到GUE未成年人的过程。

英文摘要:

We study the dynamics of a certain discrete model of interacting particles that comes from the so called shuffling algorithm for sampling a random tiling of an Aztec diamond. It turns out that the transition probabilities have a particularly convenient determinantal form. An analogous formula in a continuous setting has recently been obtained by Jon Warren studying certain model of interlacing Brownian motions which can be used to construct Dyson's non-intersecting Brownian motion. We conjecture that Warren's model can be recovered as a scaling limit of our discrete model and prove some partial results in this direction. As an application to one of these results we use it to rederive the known result that random tilings of an Aztec diamond, suitably rescaled near a turning point, converge to the GUE minor process.

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

↑