3-wise Independent Random Walks can be Slightly Unbounded
Shyam Narayanan

TL;DR
This paper demonstrates that 3-wise independence is insufficient for certain random walk bounds, establishing the necessity of 4-wise independence for streaming algorithms, and extends maximal inequalities to broader independence settings.
Contribution
It proves the tightness of 4-wise independence for maximum distance bounds and generalizes maximal inequalities to k-wise independent variables with bounded moments.
Findings
3-wise independence leads to larger maximum distances than 4-wise independence.
The second moment of the maximum distance is bounded by the sum of squared steps for 4-wise independent variables.
The results imply stronger maximal inequalities under weaker independence assumptions.
Abstract
Recently, many streaming algorithms have utilized generalizations of the fact that the expected maximum distance of any -wise independent random walk on a line over steps is . In this paper, we show that -wise independence is required for all of these algorithms, by constructing a -wise independent random walk with expected maximum distance from the origin. We prove that this bound is tight for the first and second moment, and also extract a surprising matrix inequality from these results. Next, we consider a generalization where the steps are -wise independent random variables with bounded th moments. For general , we determine the (asymptotically) maximum possible th moment of the supremum of over . We highlight the case : here, we prove that the second moment of…
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.
