𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient random variables

✍ Scribed by Bezalel Peleg


Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
538 KB
Volume
2
Category
Article
ISSN
0304-4068

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Fuzzy random variables
✍ Madan L Puri; Dan A Ralescu πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 674 KB
Convex fuzzy random variables
✍ William E. Stein; Kirit Talati πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 649 KB
Gaussian fuzzy random variables
✍ Yuhu Feng πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 101 KB

In this paper we deΓΏne the concepts of a Gaussian fuzzy random variable and a Gaussian fuzzy random vector and discuss their properties. The covariance operator, the characteristic functional and the linear transformation of a Gaussian fuzzy random variable are investigated.

Discrete stable random variables
✍ Gerd Christoph; Karina Schreiber πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 220 KB

In Steutel and van Ham (1979) a discrete analogue of stable random variables was introduced. In the present note we consider some explicit and asymptotic formulae for the probabilities of discrete stable random variables and give rates for the convergence of sequences of certain discrete stable rand

Simulating Bessel random variables
✍ Luc Devroye πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 115 KB

In this paper, we discuss e cient exact random variate generation for the Bessel distribution. The expected time of the algorithm is uniformly bounded over all choices of the parameters, and the algorithm avoids any computation of Bessel functions or Bessel ratios.

Computability on random variables
✍ Norbert Th. MΓΌller πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 834 KB

In this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are "natural" as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-c