SearcharxivSearch

arXiv · 2412.15116

Log-concavity in one-dimensional Coulomb gases and related ensembles

Abstract

We prove log-concavity of the lengths of the top rows of Young diagrams under Poissonized Plancherel measure. This is the first known positive result towards a 2008 conjecture of Chen that the length of the top row of a Young diagram under the Plancherel measure is log-concave. This is done by showing that the ordered elements of several discrete ensembles have log-concave distributions. In particular, we show the log-concavity of passage times in last passage percolation with geometric weights, using their connection to Meixner ensembles. In the continuous setting, distributions of the maximal elements of beta ensembles with convex potentials on the real line are shown to be log-concave. As a result, log-concavity of the Tracy-Widom distributions for all parameters $\beta>0$ follows, confirming a folklore conjecture that was partially proved by Deift for $\beta=2$. Furthermore, we also obtain log-concavity and positive association for the joint distribution of the $k$ smallest eigenvalues of the stochastic Airy operator. Our methods also show the log-concavity of the Airy-2 process and the Airy distribution. A log-concave distribution with full-dimensional support must have density, a fact that was apparently not known for some of these examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Jnaneshwar Baslingker, Manjunath Krishnapur, Mokshay Madiman. 2024-12-19. Log-concavity in one-dimensional Coulomb gases and related ensembles. https://arxiv.org/abs/2412.15116

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