Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 36 tok/s
GPT-5 High 40 tok/s Pro
GPT-4o 99 tok/s
GPT OSS 120B 461 tok/s Pro
Kimi K2 191 tok/s Pro
2000 character limit reached

Tightness of discrete Gibbsian line ensembles (2112.05110v2)

Published 9 Dec 2021 in math.PR, math-ph, and math.MP

Abstract: A discrete Gibbsian line ensemble $\mathfrak{L} = (L_1,\dots,L_N)$ consists of $N$ independent random walks on the integers conditioned not to cross one another, i.e., $L_1 \geq \cdots \geq L_N$. In this paper we provide sufficient conditions for convergence of a sequence of suitably scaled discrete Gibbsian line ensembles $fN = (f_1N,\dots,f_NN)$ as the number of curves $N$ tends to infinity. Assuming log-concavity and a KMT-type coupling for the random walk jump distribution, we prove that under mild control of the one-point marginals of the top curves with a global parabolic shift, the full sequence $(fN)$ is tight in the topology of uniform convergence over compact sets, and moreover any weak subsequential limit possesses the Brownian Gibbs property. If in addition the top curves converge in finite-dimensional distributions to the parabolic $\mathrm{Airy}_2$ process, then a result of arXiv:2002.00684 implies that $(fN)$ converges to the parabolically shifted Airy line ensemble. These results apply to a broad class of discrete jump distributions, including geometric as well as any log-concave distribution whose support forms a compact integer interval.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)