Empirical scaling of the length of the longest increasing subsequences of random walks
J. Ricardo G. Mendon\c{c}a

TL;DR
This paper empirically investigates how the length of the longest increasing subsequences in random walks scales with the number of steps, revealing a range of scaling exponents depending on the step length distribution.
Contribution
It provides Monte Carlo estimates of the scaling behavior of the LIS length for various step distributions, proposing new conjectures and highlighting universality aspects.
Findings
Scaling exponent for heavy-tailed distributions: 0.60 to 0.69.
For finite variance steps, $L_n$ scales as $ ext{sqrt}(n) imes ext{log} n$.
Distribution of $L_n$ follows a universal scaling form for finite variance cases.
Abstract
We provide Monte Carlo estimates of the scaling of the length of the longest increasing subsequences of -steps random walks for several different distributions of step lengths, short and heavy-tailed. Our simulations indicate that, barring possible logarithmic corrections, with the leading scaling exponent for the heavy-tailed distributions of step lengths examined, with values increasing as the distribution becomes more heavy-tailed, and for distributions of finite variance, irrespective of the particular distribution. The results are consistent with existing rigorous bounds for , although in a somewhat surprising manner. For random walks with step lengths of finite variance, we conjecture that the correct asymptotic behavior of is given by , and also propose the…
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.
