arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.0881math.PRcond-mat.stat-mechmath-phmath.MP
收藏

随机增长模型

Random Growth Models

Patrik L. Ferrari, Herbert Spohn

摘要:

在1999年Baik、Deift和Johansson关于随机置换的最长递增子序列的长度的著名文章中,建立了一类特殊的增长过程和随机矩阵之间的联系。在过去的十年中,这种联系已经被详细地研究出来,并导致了对一维增长模型的大尺度性质的更好理解。读者可以在最后找到一个注释的参考文献列表。我们的目标是提供一个介绍突出随机矩阵。从一开始就应该强调,这种联系是脆弱的。只有在某些方面,并且只有对于特定的模型,增长过程可以用随机矩阵理论中也出现的分拆函数来重新表示。

英文摘要:

The link between a particular class of growth processes and random matrices was established in the now famous 1999 article of Baik, Deift, and Johansson on the length of the longest increasing subsequence of a random permutation. During the past ten years, this connection has been worked out in detail and led to an improved understanding of the large scale properties of one-dimensional growth models. The reader will find a commented list of references at the end. Our objective is to provide an introduction highlighting random matrices. From the outset it should be emphasized that this connection is fragile. Only certain aspects, and only for specific models, the growth process can be reexpressed in terms of partition functions also appearing in random matrix theory.

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

↑