Abstract
Permuting at random is the following problem: given n items on n input positions, choose uniformly at random a permutation π ∈ S n and deliver the items to n output positions so that the ith item is given at output position π(i), for i ≤ n For the sake of simplicity of notation, we shall assume throughout the paper that the collection of items to be permuted at random is 1,2,…,n.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Aldous, Random walks of finite groups and rapidly mixing Markov chains, in Séminaire de Probabilités XVII 1981/82, (Springer Verlag, Lecture Notes in Mathematics 986, Berlin, 1983 ), 243–297.
P. Beame, M. Kik, and M. Kutylowski, Broadcasting information by exclusive read PRAMs, Parallel Processing Letters, 4 (1&2) (1994), 159–169.
R. Bubley and M. Dyer, Path coupling: A technique for proving rapid mixing in Markov chains, in Proceedings of the 38th Symposium on Foundations of Computer Science, FOCS’97, ( IEEE Computer Society Press, Los Alamitos, 1997 ), 223–231.
R. Bubley and M. Dyer, Faster random generation of linear extensions, in Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, SODA’98, ( SIAM, Philadelphia, 1998 ), 350–354.
R. Bubley, M. Dyer, and C. Greenhill, Beating the 2A bound for approximately counting colourings: A computer-assisted proof of rapid mixing, in Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, SODA’98, ( SIAM, Philadelphia, 1998 ), 355–363.
D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM24 (1985), 84–88.
S. Cook, C. Dwork, R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM Journal on Computing, 15 (1) (1986), 87–97.
A. Czumaj, Recovery time of dynamic allocation processes, in Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA’98, ( ACM Press, New York, 1998 ), 202–211.
A. Czumaj, P. Kanarek, M. Kutylowski, and K. Loryg, Fast generation of random permutations via network simulation, Algorithmica 21 (1998), 2–20. A preliminary version appeared in Proceedings of the 4th Annual European Symposium on Algorithms, ESA’96, (Springer Verlag, Lecture Notes in Computer Science 1136, Heidelberg, 1996 ), 246–260.
A. Czumaj, P. Kanarek, M. Kutylowski, and K. Loryg, Delayed path coupling and generating random permutations via distributed stochastic processes, Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, SODA’99, (SIAM 1999 ), 271–280.
A. Czumaj and M. Kutylowski, Generating random permutations and delayed path coupling method for mixing time of Markov chains, Random Structures and Algorithms 17 (2000), 238–259.
P. Diaconis, Group Representations in Probability and Statistics, Lecture Notes Monograph Series, vol. 11, Institute of Mathematical Statistics, Hayward, CA, 1988.
M. Dyer, L. A. Goldberg, C. Greenhill, M. Jerrum, and M. Mitzenmacher. An extension of path coupling and its application to the Glauber dynamics for graph colourings. Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, SODA’2000, (SIAM 2000), 616–624.
M. Dyer and C. Greenhill, A genuinely polynomial-time algorithm for sampling two-rowed contingency tables, in Proceedings of the 25th Annual International Colloquium on Automata, Languages and Programming, ICALP’98, (Springer-Verlag, Lecture Notes in Computer Science, vol. 1443, Berlin, 1998 ), 339–350.
M. Dyer and C. Greenhill, A more rapidly mixing Markov chain for graph colourings. Random Structures and Algorithms, 13(3–4) (1998), 285–317.
M. Dyer and C. Greenhill, Random walks on combinatorial objects, in J. D. Lamb and D. A. Preece, editors, Surveys in Combinatorics, London Mathematical Society Lecture Note Series, vol. 267, 101–136, Cambridge University Press, 1999.
F. Fich, The Complexity of Computation on the Parallel Random Access Machine, in Synthesis of Parallel Algorithms, Morgan Kaufmann, San Mateo, CA, 1993, 843–900.
T. Hagerup, Fast parallel generation of random permutations, in Proceedings of the 18th Annual International Colloquium on Automata, Languages and Programming, ICALP’91, (Springer Verlag, Lecture Notes in Computer Science 510, Heidelberg, 1991 ), 405–416.
F. T. Leighton, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann Publishers, San Mateo, 1992.
T. Leighton and C. G. Plaxton, Hypercubic sorting networks, SIAM Journal on Computing 27 (1998), 1–47. A preliminary version appeared in Proceedings of the 31st Symposium on Foundations of Computer Science, FOCS’90, (IEEE Computer Society Press, Los Alamitos, 1990), 264–274, under the title “A (fairly) simple circuit that (usually) sorts.”
T. Lindvall, Lectures on the Coupling Method, Wiley series in Probability and Mathematical Statistics, John Wiley & Sons, New York, 1992.
M. Molloy, The probabilistic method, in M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed (Eds.), Probabilistic Methods for Algorithmic Discrete Mathematics, Algorithms and Combinatorics, 1–35. Springer-Verlag, Berlin, 1998.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, 1995.
C. Rackoff and D. R. Simon, Cryptographic defense against traffic analysis, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC’93, ( ACM Press, New York, 1993 ), 672–681.
D. R. Simon, private communication, October 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this chapter
Cite this chapter
Czumaj, A., Kanarek, P., Loryś, K., Kutylowski, M. (2001). Switching Networks for Generating Random Permutations. In: Du, D.Z., Ngo, H.Q. (eds) Switching Networks: Recent Advances. Network Theory and Applications, vol 5. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0281-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0281-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7976-8
Online ISBN: 978-1-4613-0281-0
eBook Packages: Springer Book Archive