About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Random Structures and Algorithms
Paper
Simple permutations mix even better
Abstract
We study the composition of random permutations drawn from a small family of O(n3) simple permutations on (0, 1)n. Specifically, we ask how many randomly selected simple permutations need be composed to yield a permutation that is close to k-wise independent. We improve on the results of Cowers (Combin Probab Comput 5 (1996) 119-130) and Hoory et al. (Presented at 31st ICALP 2004) and show that it suffices to compose min(O(n3k 2), Õ(n2k2)) random permutations from this family for any n ≥ 3 and k ≤ 2n - 2. The Õ notation suppresses a poly logarithmic factor in k and n. © 2007 Wiley Periodicals, Inc.