arXiv · 1602.02207
Non-universality for longest increasing subsequence of a random walk
Abstract
The longest increasing subsequence of a random walk with mean zero and finite variance is known to be $n^{1/2 + o(1)}$. We show that this is not universal for symmetric random walks. In particular, the symmetric Ultra-fat tailed random walk has a longest increasing subsequence that is asymptotically at least $n^{0.690}$ and at most $n^{0.815}$. An exponent strictly greater than $1/2$ is also shown for the symmetric stable-$\alpha$ distribution when $\alpha$ is sufficiently small.
Explore related subjects
Keep this discovery
Robin Pemantle, Yuval Peres. 2016-02-06. Non-universality for longest increasing subsequence of a random walk. https://arxiv.org/abs/1602.02207
Cite the original work for its findings. Save a collection to share your selection of sources.