Skip to main content Accessibility help
×
Home
Hostname: page-component-768ffcd9cc-6vg6l Total loading time: 0.268 Render date: 2022-12-05T20:52:20.766Z Has data issue: true Feature Flags: { "useRatesEcommerce": false } hasContentIssue true

An Almost m-wise Independent Random Permutation of the Cube

Published online by Cambridge University Press:  12 September 2008

W. T. Gowers
Affiliation:
Department of Mathematics, University College London, Gower Street, London WC1E 6BT, UK

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
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 289304.CrossRefGoogle Scholar
[2]Diaconis, P. and Stroock, D. (1991) Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability 1 3661.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 91100.CrossRefGoogle Scholar
[5]Jerrum, M. and Sinclair, A. (1989) Approximating the permanent. SIAM Journal of Computing 18 11491178.CrossRefGoogle Scholar
[6]Linial, N. and Nisan, N. (1990) Approximate inclusion-exclusion. Combinatorica 10 349365.CrossRefGoogle Scholar
[7]Luby, M. and Rackoff, C. (1988) How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing 17 373386.CrossRefGoogle Scholar
[8]Nisan, N. (1991) Pseudorandom bits for constant depth circuits. Combinatorica 11 6370.CrossRefGoogle Scholar
[9]Nisan, N. (1992) Pseudorandom generators for space-bounded computation. Combinatorica 12 449461.CrossRefGoogle Scholar
[10]Sinclair, A. (1992) Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing 1 351370.CrossRefGoogle Scholar
14
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

An Almost m-wise Independent Random Permutation of the Cube
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

An Almost m-wise Independent Random Permutation of the Cube
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

An Almost m-wise Independent Random Permutation of the Cube
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *