Growth models, random matrices and Painlevé transcendents
Growth models, random matrices and Painlevé transcendents
复制标题
增长模型、随机矩阵和 Painlevé 超越数
DOI:
10.1088/0951-7715/16/6/201
复制
发表时间:
2003
期刊:
影响因子:
--
通讯作者:
P. Forrester
中科院分区:
文献类型:
--
作者:
P. Forrester
The Hammersley process relates to the statistical properties of the maximum length of all up/right paths connecting random points of a given density in the unit square from (0, 0) to (1, 1). This process can also be interpreted in terms of the height of the polynuclear growth model, or the length of the longest increasing subsequence in a random permutation. The cumulative distribution of the longest path length can be written in terms of an average over the unitary group. Versions of the Hammersley process in which the points are constrained to have certain symmetries of the square allow similar formulae. The derivation of these formulae is reviewed. Generalizing the original model to have point sources along two boundaries of the square, and appropriately scaling the parameters gives a model in the Kardar–Parisi–Zhang universality class. Following works of Baik and Rains, and Prahofer and Spohn, we review the calculation of the scaled cumulative distribution, in which a particular Painleve II transcendent plays a prominent role.