Diameter, covering index, covering radius and eigenvalues
European Journal of Combinatorics
Stratified random walks on the n-cube
Random Structures & Algorithms
A new family of Cayley expanders (?)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Mathematical Aspects of Mixing Times in Markov Chains (Foundations and Trends(R) in Theoretical Computer Science)
| Hi-index | 0.00 |
We study the composition of random permutations drawn from asmall family of O(n3) simple permutationson {0,1}n. Specifically, we ask how many randomlyselected simple permutations need be composed to yield apermutation that is close to k-wise independent. We improveon the results of Gowers (Combin Probab Comput 5 (1996) 119130) andHoory et al. (Presented at 31st ICALP 2004) and show that itsuffices to composemin(O(n3k2),Õ(n2k2)) random permutations fromthis family for any n e 3 and k d2n - 2. The Õ notation suppresses apolylogarithmic factor in k and n. © 2007 WileyPeriodicals, Inc. Random Struct. Alg., 2008