Search arXivSearch

arXiv · 2108.07484

Tightness of $(H, H^{RW})$-Gibbsian line ensembles

Abstract

We develop a black-box theory, which can be used to show that a sequence of Gibbsian line ensembles is tight, provided that the one-point marginals of the lowest labeled curves of the ensembles are tight and globally approximate an inverted parabola. Our theory is applicable under certain technical assumptions on the nature of the Gibbs property and the underlying random walk measure. As a particular application of our general framework we show that a certain sequence of Gibbsian line ensembles, which naturally arises in the log-gamma polymer, is tight in the ubiquitous KPZ class $1/3: 2/3$ scaling, and also that all subsequential limits satisfy the Brownian Gibbs property, introduced by Corwin and Hammond in (Invent. Math. 195, 441-508, 2014). One of the core results proved in the paper, which underlies many of our arguments, is the construction of a continuous grand monotone coupling of Gibbsian line ensembles with respect to their boundary data (entrance and exit values, and bounding curves). Continuous means that the Gibbsian line ensemble measure varies continuously as one varies the boundary data, grand means that all uncountably many measures (one for each boundary data) are coupled to the same probability space, and monotone means that raising the values of the boundary data likewise raises the associated measure. Our continuous grand monotone coupling generalizes an analogous construction, which was recently implemented by Barraquand, Corwin and Dimitrov in (arXiv:2101.03045), from line ensembles with a single curve to ones with an arbitrary finite number of curves.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Evgeni Dimitrov, Xuan Wu. 2021-09-28. Tightness of $(H, H^{RW})$-Gibbsian line ensembles. https://arxiv.org/abs/2108.07484

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR