Asymptotic behavior of the length of the longest increasing subsequences of random walks

preprint2020arXivOpen access

Abstract

We numerically estimate the leading asymptotic behavior of the length LnL_{n} of the longest increasing subsequence of random walks with step increments following Student's tt-distribution with parameter in the range 1/2≤ν≤51/2 \leq ν\leq 5. We find that the expected value E(Ln)∼nθln⁡n\mathbb{E}(L_{n}) \sim n^θ\ln{n} with θθ decreasing from θ(ν=1/2)≈0.70θ(ν=1/2) \approx 0.70 to θ(ν≥5/2)≈0.50θ(ν\geq 5/2) \approx 0.50. For random walks with distribution of step increments of finite variance (ν>2ν> 2), this confirms previous observation of E(Ln)∼nln⁡n\mathbb{E}(L_{n}) \sim \sqrt{n}\ln{n} to leading order. We note that this asymptotic behavior (including the subleading term) resembles that of the largest part of random integer partitions under the uniform measure and that, curiously, both random variables seem to follow Gumbel statistics. We also provide more refined estimates for the asymptotic behavior of E(Ln)\mathbb{E}(L_{n}) for random walks with step increments of finite variance.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.