LIMIT SHAPES AND THEIR ANALYTIC PARAMETERIZATIONS

R. Kenyon
{"title":"LIMIT SHAPES AND THEIR ANALYTIC PARAMETERIZATIONS","authors":"R. Kenyon","doi":"10.1142/9789813272880_0175","DOIUrl":null,"url":null,"abstract":"A “limit shape” is a form of the law of large numbers, and happens when a large random system, typically consisting of many interacting particles, can be described, after an appropriate normalization, by a certain nonrandom object. Limit shapes occur in, for example, random integer partitions or in random interface models such as the dimer model. Typically limit shapes can be described by some variational formula based on a large deviations estimate. We discuss limit shapes for certain 2-dimensional interface models, and explain how their underlying analytic structure is related to a (conjectural in some cases) conformal invariance property for the models. 1 Limit shapes: integer partitions We illustrate the notion of limit shape with a fundamental example. Given a uniform random integer partition of n for n large, a theorem of Vershik and Kerov [1981] asserts that, when both axes are scaled by p n, the graph of (that is, the Young diagram associated to ) converges with probability tending to 1 to a nonrandom curve, given by the equation e cx + e cy = 1, with c = p 2/6, see Figure 1. This is an example (in fact, one of the first examples) of a limit shape theorem: in the limit of large system size, the typical random object will, when appropriately scaled, concentrate on a fixed nonrandom shape. One way to make a more precise formulation of this statement is say that for each n, the random partition of n defines a certain probability measure n (on the space of nonincreasing functions f : [0; 1) ! [0; 1) of integral 1) and as n ! 1 this sequence of measures converges in probability1 to a point mass on the Vershik-Kerov curve. MSC2010: 82B20. 1 The topology of convergence for the sequence of random functions can be taken to be uniform convergence on compact subsets of (0; 1).","PeriodicalId":318252,"journal":{"name":"Proceedings of the International Congress of Mathematicians (ICM 2018)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Congress of Mathematicians (ICM 2018)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789813272880_0175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

A “limit shape” is a form of the law of large numbers, and happens when a large random system, typically consisting of many interacting particles, can be described, after an appropriate normalization, by a certain nonrandom object. Limit shapes occur in, for example, random integer partitions or in random interface models such as the dimer model. Typically limit shapes can be described by some variational formula based on a large deviations estimate. We discuss limit shapes for certain 2-dimensional interface models, and explain how their underlying analytic structure is related to a (conjectural in some cases) conformal invariance property for the models. 1 Limit shapes: integer partitions We illustrate the notion of limit shape with a fundamental example. Given a uniform random integer partition of n for n large, a theorem of Vershik and Kerov [1981] asserts that, when both axes are scaled by p n, the graph of (that is, the Young diagram associated to ) converges with probability tending to 1 to a nonrandom curve, given by the equation e cx + e cy = 1, with c = p 2/6, see Figure 1. This is an example (in fact, one of the first examples) of a limit shape theorem: in the limit of large system size, the typical random object will, when appropriately scaled, concentrate on a fixed nonrandom shape. One way to make a more precise formulation of this statement is say that for each n, the random partition of n defines a certain probability measure n (on the space of nonincreasing functions f : [0; 1) ! [0; 1) of integral 1) and as n ! 1 this sequence of measures converges in probability1 to a point mass on the Vershik-Kerov curve. MSC2010: 82B20. 1 The topology of convergence for the sequence of random functions can be taken to be uniform convergence on compact subsets of (0; 1).
极限形状及其解析参数化
“极限形状”是大数定律的一种形式,当一个大的随机系统,通常由许多相互作用的粒子组成,经过适当的规范化后,可以用某个非随机对象来描述时,就会发生这种情况。例如,极限形状出现在随机整数分区或随机接口模型(如二聚体模型)中。通常,极限形状可以用一些基于大偏差估计的变分公式来描述。我们讨论了某些二维界面模型的极限形状,并解释了它们的底层解析结构如何与模型的共形不变性有关(在某些情况下是推测的)。我们用一个基本的例子来说明极限形状的概念。对于n大,给定n的一致随机整数划分,Vershik和Kerov[1981]的一个定理断言,当两个轴都按pn缩放时,图(即与关联的Young图)以倾向于1的概率收敛于一条非随机曲线,方程为e cx + e cy = 1,其中c = p 2/6,见图1。这是极限形状定理的一个例子(实际上是最早的例子之一):在大系统尺寸的极限下,典型的随机对象在适当缩放后将集中于固定的非随机形状。一种更精确的表述方式是,对于每一个n, n的随机划分在非递增函数f的空间上定义了一个概率测度n (: [0;1) ![0;1)的积分(1)和n !1这一系列测度在概率上收敛于Vershik-Kerov曲线上的一个质点。b20 MSC2010: 82。1随机函数序列的收敛拓扑可以取为在紧子集(0;1).
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信