Results 1 - 10 of 38,904

Discrete Random Variables: Basics

by Berlin Chen, D. P. Bertsekas, J. N. Tsitsiklis, Introduction To Probability
"... • Given an experiment and the corresponding set of possible outcomes (the sample space), a random variable associates a particular number with each ..."
Abstract - Add to MetaCart
• Given an experiment and the corresponding set of possible outcomes (the sample space), a random variable associates a particular number with each

Problem with Discrete Random Variables

by Emre Yamangila , 2012
"... R u t c o r ..."
Abstract - Add to MetaCart
R u t c o r

Discrete Random Variables Over Domains

by M. W. Mislove
"... Abstract. In this paper we explore discrete random variables over domains. We show that these lead to a continuous endofunctor on the categories RB (domains that are retracts of bifinite domains), and FS (domains where the identity map is the directed supremum of deflations finitely separated from t ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract. In this paper we explore discrete random variables over domains. We show that these lead to a continuous endofunctor on the categories RB (domains that are retracts of bifinite domains), and FS (domains where the identity map is the directed supremum of deflations finitely separated from

Optimal Algorithms for Generating Discrete Random Variables With . . .

by T. Hagerup, K. Mehlhorn, I. Munro - IN PROCEEDINGS20 TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGESAND PROGRAMMING,VOLUME 700 OF LECTURE NOTES IN COMPUTER SCIENCE , 1992
"... We give optimal algorithms for generating discrete random variables for changing distributions. We discuss two models of how distributions may change. In both models, we obtain a solution with constant update time, constant expected generate time, and linear space. ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
We give optimal algorithms for generating discrete random variables for changing distributions. We discuss two models of how distributions may change. In both models, we obtain a solution with constant update time, constant expected generate time, and linear space.

Geometric constructions with discretized random variables

by Hans-Peter Schröcker, Johannes Wallner - RELIABLE COMPUTING , 2006
"... We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimensional settings. In order to minimize both the influence of the coordinate frame and information loss we suggest a nested ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
We generalize the DEnv (Distribution envelope determination) method for bounding the result of arithmetic operations on random variables with unknown dependence to higher-dimensional settings. In order to minimize both the influence of the coordinate frame and information loss we suggest a nested

Algorithms for Computing the Distributions of Sums of Discrete Random Variables

by D. L. Evans, L. M. Leemis , 2003
"... Abstract—We present algorithms for computing the probablity density function of the sum of two independent discrete random variables, along with an implementation of the algorithm in a computer algebra system. Some examples illustrate the utility of this algorithm. c ○ 2004 Elsevier Science Ltd. All ..."
Abstract - Add to MetaCart
Abstract—We present algorithms for computing the probablity density function of the sum of two independent discrete random variables, along with an implementation of the algorithm in a computer algebra system. Some examples illustrate the utility of this algorithm. c ○ 2004 Elsevier Science Ltd

Discrete Random Variables: Basics Reference:

by Berlin Chen, D. P. Bertsekas, J. N. Tsitsiklis, Introduction To Probability, Probability-berlin Chen
"... • Given an experiment and the corresponding set of possible outcomes (the sample space), a random ..."
Abstract - Add to MetaCart
• Given an experiment and the corresponding set of possible outcomes (the sample space), a random

Extremal Limit Laws for Discrete Random Variables

by unknown authors
"... If X1,X2,...,Xn are independent and identically distributed discrete random variables and Mn = max(X1,...,Xn) we examine the limiting behavior of (Mn − b(n))/a(n) as n→∞. It is well known that for discrete distributions such as Poisson and geometric the limiting distribution is not non-degenerate. H ..."
Abstract - Add to MetaCart
If X1,X2,...,Xn are independent and identically distributed discrete random variables and Mn = max(X1,...,Xn) we examine the limiting behavior of (Mn − b(n))/a(n) as n→∞. It is well known that for discrete distributions such as Poisson and geometric the limiting distribution is not non

Entropy bounds for discrete random variables via coupling

by Igal Sason, Senior Member , 2012
"... ar ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
Abstract not found

Uniformly Generating Distribution Functions for Discrete Random Variables

by Bruno Caprile , 2000
"... An algorithm is presented which, with optimal efficiency, solves the problem of uniform random generation of distribution functions for an n-valued random variable. 1 ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
An algorithm is presented which, with optimal efficiency, solves the problem of uniform random generation of distribution functions for an n-valued random variable. 1
Results 1 - 10 of 38,904