Non-universality for longest increasing subsequence of a random walk

preprint2016arXivOpen access

Abstract

The longest increasing subsequence of a random walk with mean zero and finite variance is known to be n1/2+o(1)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 n0.690n^{0.690} and at most n0.815n^{0.815}. An exponent strictly greater than 1/21/2 is also shown for the symmetric stable-αα distribution when αα is sufficiently small.

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.