Hostname: page-component-7b9c58cd5d-bslzr Total loading time: 0.001 Render date: 2025-03-13T15:36:02.111Z Has data issue: false hasContentIssue false
  • English
  • Français

An Almost m-wise Independent Random Permutation of the Cube

Published online by Cambridge University Press:  12 September 2008

W. T. Gowers
W. T. Gowers
Affiliation:
Department of Mathematics, University College London, Gower Street, London WC1E 6BT, UK
Get access Rights & Permissions [Opens in a new window]

Abstract

We describe a very simple method of randomly permuting the cube {0, 1}n such that the sample space is very small, but, given any m distinct points in {0, 1}n, the images of those points under the random permutation are approximately uniformly distributed over all sequences of m distinct points.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 5 , Issue 2 , June 1996 , pp. 119 - 130
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Alon, N., Goldreich, O., Hastad, J. and Peralta, R. (1992) Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3 289–304.CrossRefGoogle Scholar
[2]Diaconis, P. and Stroock, D. (1991) Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability 1 36–61.CrossRefGoogle Scholar
[3]Impagliazzo, R., Nisan, N. and Wigderson, A. Pseudorandomness for network algorithms. Preprint.Google Scholar
[4]Jerrum, M. and Sinclair, A. (1988) Fast uniform generation of regular graphs. Theoretical Computer Science 73 91–100.CrossRefGoogle Scholar
[5]Jerrum, M. and Sinclair, A. (1989) Approximating the permanent. SIAM Journal of Computing 18 1149–1178.CrossRefGoogle Scholar
[6]Linial, N. and Nisan, N. (1990) Approximate inclusion-exclusion. Combinatorica 10 349–365.CrossRefGoogle Scholar
[7]Luby, M. and Rackoff, C. (1988) How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing 17 373–386.CrossRefGoogle Scholar
[8]Nisan, N. (1991) Pseudorandom bits for constant depth circuits. Combinatorica 11 63–70.CrossRefGoogle Scholar
[9]Nisan, N. (1992) Pseudorandom generators for space-bounded computation. Combinatorica 12 449–461.CrossRefGoogle Scholar
[10]Sinclair, A. (1992) Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing 1 351–370.CrossRefGoogle Scholar