A numerical investigation into the scaling behavior of the longest increasing subsequences of the symmetric ultra-fat tailed random walk

05/30/2020
by   J. Ricardo G. Mendonça, et al.
0

The longest increasing subsequence (LIS) of a sequence of correlated random variables is a basic quantity with potential applications that has started to receive proper attention only recently. Here we investigate the behavior of the length of the LIS of the so-called symmetric ultra-fat tailed random walk, introduced earlier in an abstract setting in the mathematical literature. After explicit constructing the ultra-fat tailed random walk, we found numerically that the expected length L_n of its LIS scales with the length n of the walk like ⟨ L_n⟩∼ n^0.716, indicating that, indeed, as far as the behavior of the LIS is concerned the ultra-fat tailed distribution can be thought of as equivalent to a very heavy tailed α-stable distribution. We also found that the distribution of L_n seems to be universal, in agreement with results obtained for other heavy tailed random walks.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro