SearcharxivSearch

arXiv · 2006.11448

Interlacing and scaling exponents for the geodesic watermelon in last passage percolation

Abstract

In discrete planar last passage percolation (LPP), random values are assigned independently to each vertex in $\mathbb Z^2$, and each finite upright path in $\mathbb Z^2$ is ascribed the weight given by the sum of values of its vertices. The weight of a collection of disjoint paths is the sum of its members' weights. The notion of a geodesic, a maximum weight path between two vertices, has a natural generalization concerning several disjoint paths: a $k$-geodesic watermelon in $[1,n]^2\cap\mathbb Z^2$ is a collection of $k$ disjoint paths contained in this square that has maximum weight among all such collections. While the weights of such collections are known to be important objects, the maximizing paths have been largely unexplored beyond the $k=1$ case. For exactly solvable models, such as exponential and geometric LPP, it is well known that for $k=1$ the exponents that govern fluctuation in weight and transversal distance are $1/3$ and $2/3$; that is, typically, the weight of the geodesic on the route $(1,1) \to (n,n)$ fluctuates around a dominant linear growth of the form $\mu n$ by the order of $n^{1/3}$; and the maximum Euclidean distance of the geodesic from the diagonal has order $n^{2/3}$. Assuming a strong but local form of convexity and one-point moderate deviation bounds for the geodesic weight profile---which are available in all known exactly solvable models---we establish that, typically, the $k$-geodesic watermelon's weight falls below $\mu nk$ by order $k^{5/3}n^{1/3}$, and its transversal fluctuation is of order $k^{1/3}n^{2/3}$. Our arguments crucially rely on, and develop, a remarkable deterministic interlacing property that the watermelons admit. Our methods also yield sharp rigidity estimates for naturally associated point processes, which improve on estimates obtained via tools from the theory of determinantal point processes available in the integrable setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Riddhipratim Basu, Shirshendu Ganguly, Alan Hammond, Milind Hegde. 2020-06-20. Interlacing and scaling exponents for the geodesic watermelon in last passage percolation. https://arxiv.org/abs/2006.11448

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR