Approximating inverse cumulative distribution functions to produce approximate random variables
نویسندگان
چکیده
For random variables produced through the inverse transform method, approximate are introduced, which using approximations to a distribution’s cumulative distribution function. These designed be computationally inexpensive, and much cheaper than library functions exact within machine precision, thus highly suitable for use in Monte Carlo simulations. The approximation errors they introduce can then eliminated of multilevel method. Two presented Gaussian distribution: piecewise constant on equally spaced intervals, linear geometrically decaying intervals. bounded convergence demonstrated, computational savings measured C C++ implementations. Implementations tailored Intel Arm hardware inspected, alongside agnostic implementations built OpenMP. incorporated into nested framework with Euler-Maruyama scheme exploit speed ups without losing accuracy, offering by factor 5–7. ideas empirically extended Milstein scheme, non-central χ 2 Cox-Ingersoll-Ross process, 250 or more.
منابع مشابه
Random variables, joint distribution functions, and copulas
If G is an n-dimensional joint distribution function with 1-dimensional margins F1,...,Fn, then there exists a function C (called an "w-copula") from the unit »-cube to the unit interval such that G(xx, ..., xn) = C(F1(x1), ..., Fn(xn)) for all real n-tuples (xlt ..., xn). The paper is devoted to an investigation of the structure and properties of n-copulas and their connection with random vari...
متن کاملOn cumulative jump random variables
Stochastic models for phenomena that can exhibit sudden changes involve the use of processes whose sample functions may have discontinuities. This report provides some tools for working with such processes. We develop a sample path formula for the cumulative jump height over a given time interval. From this formula an expression for the expected value of the cumulative jump random variable is d...
متن کاملFormulas for approximating pseudo-Boolean random variables
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximating a pseudo-Boolean random variable by a linear function if the measure is permutation-invariant, and by a function of degree at most k if the measure is a product measure. These formulas generalize results due to Ham...
متن کاملUniformly Generating Distribution Functions for Discrete Random Variables
An algorithm is presented which, with optimal efficiency, solves the problem of uniform random generation of distribution functions for an n-valued random variable.
متن کاملLimit Distribution of the Maximum and Minimum of Successive Cumulative Sums of Random Variables
as iV—> 00. In the particular case when JUJV = 0 and a = 6, the limit values of (1.2) and (1.3) were recently obtained by Erdös and Kac [ l ] . 1 The case when [INT^O, especially when /i^iV converges to a finite value, is of particular importance in the theory of sequential tests of statistical hypotheses. I t will be seen in §3 that the limit distribution of the number of observations required...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2023
ISSN: ['0098-3500', '1557-7295']
DOI: https://doi.org/10.1145/3604935