Longest weakly increasing subsequences of discrete random walks on the integers with heavy tailed distribution of increments
Jos\'e Ricardo G. Mendon\c{c}a, Marcelo V. Freire

TL;DR
This paper studies the length of the longest weakly increasing subsequences in heavy-tailed random walks on integers, revealing different scaling behaviors depending on the tail heaviness of the increment distribution.
Contribution
It provides empirical analysis of how the longest weakly increasing subsequence length scales with n for heavy-tailed increments, extending previous results and proposing a lognormal approximation.
Findings
For finite variance increments, the average length scales as √n log n.
For infinite variance increments, the length scales as n^θ with θ > 0.5.
The distribution of L_n is well-approximated by a lognormal distribution.
Abstract
We investigate the behavior of the length of the longest weakly increasing subsequences (weak LIS) of -step random walks with nonzero integer increments given by a zero-mean, symmetric heavy tailed mass distribution proportional to for several values of the real parameter together with that of the simple random walk (), to which the -step heavy tailed random walks tends when . By means of exploratory fits, weighted nonlinear least squares, and ANOVA model comparison, we found that the sample average length scales like when the distribution of increments has finite variance () and with a varying exponent when the variance is infinite ().…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
