Increasing subsequences of random walks
arXiv:1407.2860 · doi:10.1017/S0305004116000797
Abstract
Given a sequence of real numbers , we consider the longest weakly increasing subsequence, namely with and maximal. When the elements are i.i.d. uniform random variables, Vershik and Kerov, and Logan and Shepp proved that . We consider the case when is a random walk on with increments of mean zero and finite (positive) variance. In this case, it is well known (e.g., using record times) that the length of the longest increasing subsequence satisfies . Our main result is an upper bound , establishing the leading asymptotic behavior. If is a simple random walk on , we improve the lower bound by showing that . We also show that if is a simple random walk in , then there is a subsequence of of expected length at least that is increasing in each coordinate. The above one-dimensional result yields an upper bound of . The problem of determining the correct exponent remains open.
18 pages, 2 figures
References in corpus (2)
Cited by in corpus (6)
- Large deviations of the length of the longest increasing subsequence of random permutations and random walks
- How many longest increasing subsequences are there?
- Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences
- Asymptotic behavior 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
- Longest weakly increasing subsequences of discrete random walks on the integers with heavy tailed distribution of increments