A Stirling-type formula for the distribution of the length of longest increasing subsequences, applied to finite size corrections to the random matrix limit

06/19/2022
by   Folkmar Bornemann, et al.
0

The discrete distribution of the length of longest increasing subsequences in random permutations of order n is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of the distribution of the largest level of the large matrix limit of GUE. As a numerical approximation, however, this asymptotics is inaccurate for small lengths and has a slow convergence rate, conjectured to be just of order n^-1/3. Here, we suggest a different type of approximation, based on Hayman's generalization of Stirling's formula. Such a formula gives already a couple of correct digits of the length distribution for n as small as 20 but allows numerical evaluations, with a uniform error of apparent order n^-3/4, for n as large as 10^12; thus closing the gap between a table of exact values (that has recently been compiled for up to n=1000) and the random matrix limit. Being much more efficient and accurate than Monte-Carlo simulations for larger n, the Stirling-type formula allows for a precise numerical understanding of the first few finite size correction terms to the random matrix limit, a study that has recently been initiated by Forrester and Mays, who visualized the form of the first such term. We display also the second one, of order n^-2/3, and derive (heuristically) expansions of expected value and variance of the length, exhibiting several more terms than previously known.

READ FULL TEXT

page 2

page 4

research
07/13/2019

On the convergence rate of some nonlocal energies

We study the rate of convergence of some nonlocal functionals recently c...
research
02/22/2019

Convergence Rate of Empirical Spectral Distribution of Random Matrices from Linear Codes

It is known that the empirical spectral distribution of random matrices ...
research
08/16/2023

Expected Euler characteristic method for the largest eigenvalue: (Skew-)orthogonal polynomial approach

The expected Euler characteristic (EEC) method is an integral-geometric ...
research
10/25/2019

Convergence Analysis of the Randomized Newton Method with Determinantal Sampling

We analyze the convergence rate of the Randomized Newton Method (RNM) in...
research
08/04/2021

The volume-of-tube method for Gaussian random fields with inhomogeneous variance

The tube method or the volume-of-tube method approximates the tail proba...
research
02/28/2020

Criteria for the numerical constant recognition

The need for recognition/approximation of functions in terms of elementa...
research
08/13/2020

The Slow Deterioration of the Generalization Error of the Random Feature Model

The random feature model exhibits a kind of resonance behavior when the ...

Please sign up or login with your details

Forgot password? Click here to reset