An Algorithm for Generating Random Numbers With Binomial Distribution
Dorin Bocu (2000)
The Yugoslav Journal of Operations Research
Similarity:
Displaying similar documents to “Perfect simulation from the quicksort limit distribution.”
An Algorithm for Generating Random Numbers With Binomial Distribution
Permutations without long decreasing subsequences and random matrices.
Śniady, Piotr (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generating random elements in finite groups.
Dixon, John D. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the median-of- version of Hoare’s selection algorithm
Rudolf Grübel (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Random time changes for sock-sorting and other stochastic process limit theorems.
Steinsaltz, David (1999)
Electronic Journal of Probability [electronic only]
Similarity:
Perfect simulation of Vervaat perpetuities.
Fill, James Allen, Huber, Mark L. (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Product replacement in the Monster.
Holmes, Petra E., Linton, Stephen A., Murray, Scott H. (2003)
Experimental Mathematics
Similarity:
A generalization of the global limit theorems of R. P. Agnew.
Rosalsky, Andrew (1988)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Sojourn times.
Takács, Lajos (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
On the Optimality of Sample-Based Estimates of the Expectation of the Empirical Minimizer
Peter L. Bartlett, Shahar Mendelson, Petra Philips (2010)
ESAIM: Probability and Statistics
Similarity:
We study sample-based estimates of the expectation of the function produced by the empirical minimization algorithm. We investigate the extent to which one can estimate the rate of convergence of the empirical minimizer in a data dependent manner. We establish three main results. First, we provide an algorithm that upper bounds the expectation of the empirical minimizer in a completely data-dependent manner. This bound is based on a structural result due to Bartlett and Mendelson, which...
Computing the reliability of systems with statistical dependent elements.
Perpelea, Doina (2009)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
A Note on Computing Extreme Tail Probabilities of the Noncentral -Distribution with Large Noncentrality Parameter
Viktor Witkovský (2013)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
The noncentral -distribution is a generalization of the Student’s-distribution. In this paper we suggest an alternative approach for computing the cumulative distribution function (CDF) of the noncentral-distribution which is based on a direct numerical integration of a well behaved function. With a double-precision arithmetic, the algorithm provides highly precise and fast evaluation of the extreme tail probabilities of the noncentral -distribution, even for large values of the...