Longest weakly increasing subsequences of discrete random walks on the integers with heavy tailed distribution of increments

Abstract

We investigate the behavior of the length of the longest weakly increasing subsequences (weak LIS) of $n$-step random walks with nonzero integer increments $k=\pm 1,\pm 2,\dots$ given by a symmetric heavy tailed mass distribution proportional to $|k{|}^{-1-\alpha }$ for several values of the real parameter $\alpha >0$ together with that of the simple random walk ($k=\pm 1$), to which the $n$-step heavy tailed walks reduce when $\alpha$ grows large enough that step jumps beyond $\pm 1$ become essentially absent on the scale of $n$. By means of exploratory fits, weighted nonlinear least squares, and nested-model comparisons, we found that the sample average length $⟨L_n⟩$ scales like $⟨L_n⟩\sim \sqrt{n}\log n$ when the distribution of increments has finite variance ($\alpha >2$) and $⟨L_n⟩\sim n^{\theta }$ with a varying exponent $\theta >0.5$ when the variance is infinite ($\alpha \le 2$). Distributional diagnostics indicate that the bulk of the $L_n$ distribution is very well-approximated by a lognormal model, though systematic deviations are observed in the tails. Our results corroborate and expand upon previous results for the LIS of other types of heavy-tailed random walks and raise a conjecture as to whether the distribution of $L_n$ is given, or can be effectively described, by a lognormal distribution.

elsarticle style, 21 pages, 13 figures, 6 tables, 25 refs. Version v2 as published

References in corpus (3)

• Large deviations of the length of the longest increasing subsequence of random permutations and random walks
• Empirical scaling of the length of the longest increasing subsequences of random walks
• A numerical investigation into the scaling behavior of the longest increasing subsequences of the symmetric ultra-fat tailed random walk