Pairwise Independent Random Walks can be Slightly Unbounded

07/13/2018
by   Shyam Narayanan, et al.
0

A family of problems that have been studied in the context of various streaming algorithms are generalizations of the fact that the expected maximum distance of a 4-wise independent random walk on a line over n steps is O(√(n)). For small values of k, there exist k-wise independent random walks that can be stored in much less space than storing n random bits, so these properties are often useful for lowering space bounds. In this paper, we show that for all of these examples, 4-wise independence is required by demonstrating a pairwise independent random walk with steps uniform in ± 1 and expected maximum distance O(√(n) n) from the origin. We also show that this bound is tight for the first and second moment, i.e. the expected maximum square distance of a 2-wise independent random walk is always O(n ^2 n). Also, for any even k > 4, we show that the kth moment of the maximum distance of any k-wise independent random walk is O(n^k/2). The previous two results generalize to random walks tracking insertion-only streams, and provide higher moment bounds than currently known. We also prove a generalization of Kolmogorov's maximal inequality by showing an equivalent statement that requires only 4-wise independent random variables with bounded second moments, which also generalizes a result of [5].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2020

Arcsine laws for random walks generated from random permutations with applications to genomics

A classical result for the simple symmetric random walk with 2n steps is...
research
02/26/2018

Random Walks on Polytopes of Constant Corank

We show that the pivoting process associated with one line and n points ...
research
12/14/2021

Simulating Random Walks in Random Streams

The random order graph streaming model has received significant attentio...
research
04/14/2021

A Gaussian fixed point random walk

In this note, we design a discrete random walk on the real line which ta...
research
07/25/2019

How to Store a Random Walk

Motivated by storage applications, we study the following data structure...
research
06/25/2020

A random walk on Area Restricted Search

These notes from a graduate class at the Unuversidad Autonoma de Madrid ...

Please sign up or login with your details

Forgot password? Click here to reset