Simple Permutations Mix Well


We study the random composition of a small family of O(n3) simple permutations on {0, 1}n. Specifically we ask what is the number of compositions needed to achieve a permutation that is close to k-wise independent. We improve on a result of Gowers [1] and show that up to a polylogarithmic factor, n3k3 compositions of random permutations from this family… (More)
DOI: 10.1007/978-3-540-27836-8_65


Cite this paper

@inproceedings{Hoory2004SimplePM, title={Simple Permutations Mix Well}, author={Shlomo Hoory and Avner Magen and Steven Myers and Charles Rackoff}, booktitle={ICALP}, year={2004} }