Random permutation statistics: Permutation Group, Random Permutation, Selection Algorithm, Fundamental Theorem of Combinatorial Enumeration, Generating Function, Formal Power Series
 |
|
Описание:
High Quality Content by WIKIPEDIA articles! The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example, that we are using quickselect (a cousin of quicksort) to select a random element of a random permutation. Quickselect will perform a partial sort on the array, as it partitions the array according to the pivot. Hence a permutation will be less disordered after quickselect has been performed. The amount of disorder that remains may be analysed with generating functions. These generating functions depend in a fundamental way on the generating functions of random permutation statistics. Hence it is of vital importance to compute these generating functions.Похожие книги
 | Permutation group algorithms Автор: Ákos Seress Год: 2002 |
| The Universal Generating Function in Reliability Analysis and Optimization (Springer Series in Reliability Engineering) Автор: Gregory Levitin Год: 2005 |
| Theory of Probability and Random Processes (Universitext) Автор: Leonid Koralov, Yakov G. Sinai Год: 2007 |
| Gaussian Markov Random Fields. Theory and Applications Автор: Havard Rue Год: 2005 |
| Quantum Geometry - A Statistical Field Theory Approach Автор: Jan Ambjørn Год: 1997 |
| Limit Theorems for Associated Random Fields and Related Systems Автор: Alexander Bulinski Год: 2007 |