Lower tail large deviations of the stochastic six vertex model
Abstract
In this paper, we study lower tail probabilities of the height function h(M,N) of the stochastic six-vertex model. We introduce a novel combinatorial approach to demonstrate that the tail probabilities P(h(M,N) r) are log-concave in a certain weak sense. We prove further that for each α>0 the lower tail of -h( α N , N) satisfies a Large Deviation Principle (LDP) with speed N2 and a rate function α(-), which is given by the infimal deconvolution between a certain energy integral and a parabola. Our analysis begins with a distributional identity from BO17 [arXiv:1608.01564], which relates the lower tail of the height function, after a random shift, with a multiplicative functional of the Schur measure. Tools from potential theory allow us to extract the LDP for the shifted height function. We then use our weak log-concavity result, along with a deconvolution scheme from our earlier paper [arXiv:2307.01179], to convert the LDP for the shifted height function to the LDP for the stochastic six-vertex model height function.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.