منابع مشابه
The Local Limit Theorem: A Historical Perspective
The local limit theorem describes how the density of a sum of random variables follows the normal curve. However the local limit theorem is often seen as a curiosity of no particular importance when compared with the central limit theorem. Nevertheless the local limit theorem came first and is in fact associated with the foundation of probability theory by Blaise Pascal and Pierre de Fer...
متن کاملA local limit theorem for QuickSort key comparisons via multi-round smoothing
It is a well-known result, due independently to Régnier [8] and Rösler [10], that the number of key comparisons required by the randomized sorting algorithm QuickSort to sort a list of n distinct items (keys) satisfies a global distributional limit theorem. We resolve an open problem of Fill and Janson from 2002 by using a multi-round smoothing technique to establish the corresponding local lim...
متن کاملPerfect simulation from the Quicksort limit distribution
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect random variate generation from this distribution.
متن کاملA Limit Theorem for Copulas
We characterize convergence of a sequence of d-dimensional random vectors by convergence of the one-dimensional margins and of the copula. The result is applied to the approximation of portfolios modelled by t-copulas with large degrees of freedom, and to the convergence of certain dependence measures of bivariate distributions. AMS 2000 Subject Classifications: primary: 60F05, 62H05 secondary:...
متن کاملExact L-distance from the Limit for Quicksort
Using a recursive approach, we obtain a simple exact expression for the L-distance from the limit in Régnier’s [5] classical limit theorem for the number of key comparisons required by QuickSort. A previous study by Fill and Janson [1] using a similar approach found that the d2-distance is of order between n −1 logn and n−1/2, and another by Neininger and Ruschendorf [4] found that the Zolotare...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1991
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1991250100851