1 / 68

Lecture 6 Discrete Random Variables: Definition and Probability Mass Function

Lecture 6 Discrete Random Variables: Definition and Probability Mass Function. Last Time Families of DRVs Cumulative Distribution Function (CDF) Averages Functions of RDV Reading Assignment : Sections 2.1-2.7. Probability & Stochastic Processes

kadkins
Download Presentation

Lecture 6 Discrete Random Variables: Definition and Probability Mass Function

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 6 Discrete Random Variables: Definition and Probability Mass Function Last Time Families of DRVs Cumulative Distribution Function (CDF) Averages Functions of RDV Reading Assignment: Sections 2.1-2.7 Probability & Stochastic Processes Yates & Goodman (2nd Edition) NTUEE SCC_03_2008

  2. Lecture 6: DRV: CDF, Functions, Exp. Values Today • Discrete Random Variables • Functions of DRV (cont.) • Expectation of DRV • Variance and Standard Deviation • Conditional Probability Mass Function • Continuous Random Variables (CRVs) • CDF Tomorrow • Probability Density Functions (PDF) • Expected Values Probability & Stochastic Processes Yates & Goodman (2nd Edition) NTUEE SCC_03_2008

  3. Lecture 6: Next Week • Discrete Random Variables • Variance and Standard Deviation • Conditional Probability Mass Function • Continuous Random Variables (CRVs) • CDF • Probability Density Functions (PDF) • Expected Values • Families of CRVs Reading Assignment: Sections 2.8-3.4 Probability & Stochastic Processes Yates & Goodman (2nd Edition) NTUEE SCC_03_2008 6- 3

  4. What have you learned? • Clarifications • Axiom 3 • Pascal PMF Pascal RV.doc • Limit to exponential Limit to Exponential.doc Probability & Stochastic Processes Yates & Goodman (2nd Edition) NTUEE SCC_03_2008 6- 4

  5. St. Petersburg Paradox A paradox presented to the St Petersburg Academy in 1738 by the Swiss mathematician and physicist Daniel Bernoulli (1700–82). A coin tossed if it falls heads then the player is paid one rouble and the game ends. If it falls tails then it is tossed again, and this time if it falls heads the player is paid two roubles and the game ends. This process continues, with the payoff doubling each time, until heads comes up and the player wins something, and then it ends.

  6. St. Petersburg Paradox: Discussion Q: How much should a player be willing to pay for the opportunity to play this game? the game's expected value = (½)(1) + (¼)(2) + (⅛)(4) +… = ? Q: Do you want to play? • Probably not! •  a high probability of losing everything • For example, 50 %chance of losing it on the very first toss • the principle of maximizing expected value • Bernoulli's introduction of ‘moral worth’(and later utility (1).)

  7. Tank Number Estimation Tank Example Tank Example.doc

More Related