SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

C4: DISCRETE RANDOM VARIABLES

uriel avatar
uriel
8 diapositives · 343 Views · Jul 30, 2014

C4: DISCRETE RANDOM VARIABLES. CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics . 2007 Longin Jan Latecki. Discrete Random Variables. Discrete random variables are obtained by counting and have sample spaces which

C4: DISCRETE RANDOM VARIABLES - slide 1
01 / 8C4: DISCRETE RANDOM VARIABLES
1 / 17

Télécharger la présentation

C4: DISCRETE RANDOM VARIABLES
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. C4: DISCRETE RANDOM VARIABLES CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics. 2007 Longin Jan Latecki

  2. Discrete Random Variables Discrete random variables are obtained by counting and have sample spaces which Are countable. The values that represent each outcome are usually integers. Random variables are denoted by capital letters. X: is the number of times that we flip a coin until H comes up The possible outcomes are denoted by lower case letters: a=1, a=2, a=3...

  3. Probability Mass Function The probability mass function (pmf) of a discrete random variable maps each possible outcome in the sample space to it's corresponding probability. The sum of the probabilities of all possible outcomes will always be equal to 1.

  4. Probability Distribution Function The distribution function of a random variable X, also referred to as the cumulative distribution function (CDF) yields the probability that X will take a value less than or equal to a. Hence, the value of F(a) is equal to the sum of all probabilities of outcomes less than or equal to a: If we are given a CDF, we can get the pmf with the following formula: for some sufficiently small ε>0.

  5. Graphs of pmf and CDF Cumulative Distribution Function Probability Distribution Function

  6. Bernoulli Distribution • The Bernoulli distribution is used to model an experiment with only two outcomes, success and failure. The parameter p is the chance for success. • An example is flipping a coin, where “heads” may be success and “tails” may be failure.

  7. Binomial Distribution • The Binomial Distribution represents multiple Bernoulli trials. The parameter n is the number of trials, and the parameter p is the probability of success as in the Bernoulli distribution. • P(X=k) is the probability of k successful outcomes in n trials.

  8. Geometric Distribution • A geometric distribution gives information about the probability of success after k attempts. The parameter p is the probability of success on the kth try. • This means that all previous k-1 tries failed • An example of this would be finding the probability that you will hit a bullseye with a dart on your kth toss.