ScholarQuill logoScholarQuillUniversity Notes
  • Notes
  • Past Papers
  • Blogs
  • Todo
Login
ScholarQuill logoScholarQuillUniversity Notes
Login
NotesPast PapersBlogsTodo
More
SubjectsDiscussionCGPA CalculatorGPA CalculatorStudent PortalCourse Outline
About
About usPrivacy PolicyReportContact
Notes
Past Papers
Blogs
Todo
Analytics
    Current Subject
    🧩
    Probability and Statistics
    MS-251
    Progress0 / 36 topics
    Topics
    1. Introduction: Statistics and Data Analysis2. Statistical Inference3. Samples, Populations, and the Role of Probability4. Sampling Procedures5. Discrete and Continuous Data6. Statistical Modeling7. Types of Statistical Studies8. Probability: Sample Space, Events, Counting Sample Points9. Probability of an Event10. Additive Rules11. Conditional Probability12. Independence and the Product Rule13. Bayes’ Rule14. Random Variables and Probability Distributions15. Mathematical Expectation: Mean of a Random Variable16. Variance and Covariance of Random Variables17. Means and Variances of Linear Combinations of Random Variables18. Chebyshev’s Theorem19. Discrete Probability Distributions20. Continuous Probability Distributions21. Fundamental Sampling Distributions22. Sampling Distributions and Data Descriptions23. Random Sampling24. Sampling Distributions25. Sampling Distribution of Means and the Central Limit Theorem26. Sampling Distribution of S227. t-Distribution28. F-Quantile and Probability Plots29. Single Sample & One- and Two-Sample Estimation Problems30. Single Sample & One- and Two-Sample Tests of Hypotheses31. The Use of P-Values for Decision Making in Testing Hypotheses32. Regression: Linear Regression and Correlation33. Least Squares and the Fitted Model34. Multiple Linear Regression and Certain Nonlinear Regression Models35. Linear Regression Model Using Matrices36. Properties of the Least Squares Estimators
    MS-251›Discrete Probability Distributions
    Probability and StatisticsTopic 19 of 36

    Discrete Probability Distributions

    10 minread
    1,711words
    Intermediatelevel

    Discrete Probability Distributions

    A discrete probability distribution is a probability distribution that describes the likelihood of outcomes for a discrete random variable. A discrete random variable is one that can take on a finite or countably infinite number of possible values. For example, the number of heads in a series of coin tosses or the number of cars passing through a toll booth in an hour are discrete random variables.

    A probability distribution specifies the probability of each possible value of the random variable. In the case of a discrete random variable, the probability distribution is typically represented in one of two ways: a probability mass function (PMF) or a probability table.


    Key Properties of Discrete Probability Distributions

    1. The Random Variable Takes Discrete Values:

      • A discrete random variable XXX can take a finite or countably infinite number of values. For example, XXX could represent the number of heads in 10 coin tosses, which can take any integer value from 0 to 10.
    2. The Sum of Probabilities is 1:

      • The total probability for all possible outcomes must sum to 1. This is a fundamental property of any probability distribution, meaning that one of the outcomes must occur.
      ∑xP(X=x)=1\sum_{x} P(X = x) = 1x∑​P(X=x)=1

      where xxx represents all possible values the random variable XXX can take.

    3. Non-Negative Probabilities:

      • The probability of each possible outcome is always a non-negative number, meaning that P(X=x)≥0P(X = x) \geq 0P(X=x)≥0 for all possible values xxx of the random variable.

    Common Types of Discrete Probability Distributions

    There are several commonly used discrete probability distributions in statistics and probability theory:

    1. Binomial Distribution

    The binomial distribution describes the number of successes in a fixed number of independent Bernoulli trials (experiments with two outcomes, often called "success" and "failure"). It is defined by two parameters:

    • nnn: the number of trials,
    • ppp: the probability of success on a single trial.

    The probability mass function (PMF) for the binomial distribution is given by:

    P(X=k)=(nk)pk(1−p)n−kP(X = k) = \binom{n}{k} p^k (1 - p)^{n-k}P(X=k)=(kn​)pk(1−p)n−k

    Where:

    • (nk)\binom{n}{k}(kn​) is the binomial coefficient, representing the number of ways to choose kkk successes from nnn trials.
    • pkp^kpk is the probability of having exactly kkk successes.
    • (1−p)n−k(1-p)^{n-k}(1−p)n−k is the probability of having n−kn-kn−k failures.

    Example: If you flip a fair coin 5 times, the number of heads XXX follows a binomial distribution with parameters n=5n = 5n=5 and p=0.5p = 0.5p=0.5. The probability of getting exactly 3 heads is:

    P(X=3)=(53)(0.5)3(0.5)2=10×0.125×0.25=0.3125P(X = 3) = \binom{5}{3} (0.5)^3 (0.5)^2 = 10 \times 0.125 \times 0.25 = 0.3125P(X=3)=(35​)(0.5)3(0.5)2=10×0.125×0.25=0.3125

    2. Poisson Distribution

    The Poisson distribution models the number of events occurring in a fixed interval of time or space, where the events occur independently and at a constant average rate. The distribution is defined by a single parameter λ\lambdaλ, which is the average number of events in the interval.

    The probability mass function for the Poisson distribution is:

    P(X=k)=λke−λk!P(X = k) = \frac{\lambda^k e^{-\lambda}}{k!}P(X=k)=k!λke−λ​

    Where:

    • kkk is the number of events (can be 0, 1, 2, …),
    • λ\lambdaλ is the average rate of occurrence (mean number of events),
    • eee is Euler's number (approximately 2.71828).

    Example: If the average number of cars passing through a toll booth is 3 per hour (λ=3\lambda = 3λ=3), the probability of exactly 4 cars passing in one hour is:

    P(X=4)=34e−34!=81e−324≈0.168P(X = 4) = \frac{3^4 e^{-3}}{4!} = \frac{81 e^{-3}}{24} \approx 0.168P(X=4)=4!34e−3​=2481e−3​≈0.168

    3. Geometric Distribution

    The geometric distribution models the number of trials required to get the first success in a sequence of independent Bernoulli trials. It is defined by the probability of success on each trial, ppp.

    The probability mass function is:

    P(X=k)=(1−p)k−1pP(X = k) = (1 - p)^{k-1} pP(X=k)=(1−p)k−1p

    Where:

    • kkk is the number of trials until the first success (can be 1, 2, 3, …),
    • ppp is the probability of success on each trial.

    Example: If the probability of getting heads on a coin flip is p=0.5p = 0.5p=0.5, the probability that the first heads appears on the 3rd flip is:

    P(X=3)=(1−0.5)2×0.5=0.25×0.5=0.125P(X = 3) = (1 - 0.5)^{2} \times 0.5 = 0.25 \times 0.5 = 0.125P(X=3)=(1−0.5)2×0.5=0.25×0.5=0.125

    4. Hypergeometric Distribution

    The hypergeometric distribution is similar to the binomial distribution, but it applies when sampling is done without replacement. It models the probability of kkk successes in a sample of size nnn drawn from a population of size NNN containing KKK successes.

    The probability mass function is:

    P(X=k)=(Kk)(N−Kn−k)(Nn)P(X = k) = \frac{\binom{K}{k} \binom{N-K}{n-k}}{\binom{N}{n}}P(X=k)=(nN​)(kK​)(n−kN−K​)​

    Where:

    • NNN is the total population size,
    • KKK is the number of successes in the population,
    • nnn is the sample size,
    • kkk is the number of successes in the sample.

    Example: In a population of 20 people, 8 are students. If 5 people are selected randomly without replacement, the probability that 3 of the selected people are students is:

    P(X=3)=(83)(122)(205)=56×6615504≈0.239P(X = 3) = \frac{\binom{8}{3} \binom{12}{2}}{\binom{20}{5}} = \frac{56 \times 66}{15504} \approx 0.239P(X=3)=(520​)(38​)(212​)​=1550456×66​≈0.239

    5. Negative Binomial Distribution

    The negative binomial distribution generalizes the geometric distribution. It models the number of trials needed to achieve a fixed number of successes. It is defined by two parameters:

    • rrr: the number of successes,
    • ppp: the probability of success on each trial.

    The probability mass function is:

    P(X=k)=(k−1r−1)pr(1−p)k−rP(X = k) = \binom{k-1}{r-1} p^r (1-p)^{k-r}P(X=k)=(r−1k−1​)pr(1−p)k−r

    Where kkk is the total number of trials needed to achieve rrr successes.


    Expectation and Variance of Discrete Distributions

    1. Expectation (Mean): The expectation (or mean) of a discrete random variable XXX is the weighted average of all possible values of XXX, weighted by their probabilities:

      E[X]=∑xxP(X=x)E[X] = \sum_{x} x P(X = x)E[X]=x∑​xP(X=x)
    2. Variance: The variance of XXX measures the spread or dispersion of the distribution, and is given by:

      Var(X)=E[(X−μ)2]=∑x(x−μ)2P(X=x)\text{Var}(X) = E[(X - \mu)^2] = \sum_{x} (x - \mu)^2 P(X = x)Var(X)=E[(X−μ)2]=x∑​(x−μ)2P(X=x)

      Where μ=E[X]\mu = E[X]μ=E[X] is the mean.


    Summary

    • Discrete probability distributions describe the probability of outcomes for discrete random variables, and they can be represented by a probability mass function (PMF).
    • Common discrete distributions include the binomial, Poisson, geometric, hypergeometric, and negative binomial distributions.
    • These distributions have applications in various fields, including quality control, reliability testing, and modeling rare events.
    • The expectation and variance of a discrete random variable can be computed from the probability distribution, providing important measures of central tendency and dispersion.
    Previous topic 18
    Chebyshev’s Theorem
    Next topic 20
    Continuous Probability Distributions

    Past Papers

    Open this section to load past papers

    Click on Show Past Papers to see past papers.
    On This Page
      Reading Stats
      Est. reading time10 min
      Word count1,711
      Code examples0
      DifficultyIntermediate