Abstract
Informally, a family \({\cal F} \subseteq S_{n}\) of permutations is k-restricted min-wise independent if for any X ⊆ [0,n − 1] with |X| ≤ k, each x ∈ X is mapped to the minimum among π(X) equally likely, and a family \({\cal F} \subseteq S_{n}\) of permutations is k-rankwise independent if for any X ⊆ [0,n − 1] with |X| ≤ k, all elements in X are mapped in any possible order equally likely. It has been shown that if a family \({\cal F} \subseteq S_{n}\) of permutations is k-restricted min-wise (resp. k-rankwise) independent, then \(|{\cal F}| = \Omega(n^{\lfloor{(k-1)/2}\rfloor})\) (resp. \(|{\cal F}| = \Omega(n^{\lfloor{k/2}\rfloor})\)). In this paper, we construct families \({\cal F} \subseteq S_{n}\) of permutations of which size are close to those lower bounds for k=3,4, i.e., we construct a family \({\cal F} \subseteq S_{n}\) of 3-restricted (resp. 4-restricted) min-wise independent permutations such that \(|{\cal F}| = O(n\lg^{2}n)\) (resp. \(|{\cal F}| = O(n\lg^{3}n)\)) by applying the affine plane AG(2,q), and a family \({\cal F} \subseteq S_{n}\) of 4-rankwise independent permutations such that \(|{\cal F}| = O(n^{3} \lg^{6}n)\) by applying the projective plane PG(2,q). Note that if a family \({\cal F} \subseteq S_{n}\) of permutations is 4-rankwise independent, then \(|{\cal F}| = \Omega(n^{2})\). Since a family \({\cal F} \subseteq S_{n}\) of 4-rankwise independent permutations is 4-restricted min-wise independent, our family \({\cal F} \subseteq S_{n}\) of 4-restricted min-wise independent permutations is the witness that properly separates the notion of 4-rankwise independence and that of 4-restricted min-wise independence.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Babai, L., Itai, A.: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. of Algorithms 7, 567–583 (1986)
Broder, A.: On the Resemblance and Containment of Documents. In: Proc. of Compression and Complexity of Sequences, pp. 21–29 (1998)
Broder, A., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-Wise Independent Permutations. In: Proc. of the 30th Annual ACM Symposium on Theory of Computing, pp. 327–336 (1998)
Broder, A., Charikar, M., Mitzenmacher, M.: A Derandomization Using Min-Wise Independent Permutations. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 15–24. Springer, Heidelberg (1998)
Broder, A., Mitzenmacher, M.: Completeness and Robustness Properties of Min-Wise Independent Permutations. Random Structures and Algorithms 18, 18–30 (2001)
Itoh, T., Takei, Y., Tarui, J.: On Permutations with Limited Independence. In: Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 137–146 (2000)
Itoh, T., Takei, Y., Tarui, J.: On the Sample Size k-Restricted Min-Wise Independent Permutations and Other k-Wise Distributions. In: Proc. of the 35th Annual ACM Symposium on Theory of Computing, pp. 710–719 (2003)
Graham, R., Grötschel, M., Lovász, L.: Handbook of Combinatorics. North-Holland, Amsterdam (1995)
Mulmuley, K.: Randomized Geometric Algorithms and Pseudorandom Generators. Algorithmica 16, 450–463 (1996)
Matoušek, J., Stojaković, M.: On Restricted Min-Wise Independence of Permutations (preprint) (2002), http://kam.mff.cuni.cz/~matousek/preprints.html/
Norin, S.: A Polynomial Lower Bound for the Size of any k-Min-Wise Independent Set of Permutation. Zapiski Nauchnyh Seminarov POMI, 277,104–116 (2001) (in Russian), http://www.pdmi.ras.ru/znsl/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tarui, J., Itoh, T., Takei, Y. (2003). A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds) Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. RANDOM APPROX 2003 2003. Lecture Notes in Computer Science, vol 2764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45198-3_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-45198-3_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40770-6
Online ISBN: 978-3-540-45198-3
eBook Packages: Springer Book Archive