Mathematical Expectation of a Random Variable

Size: px
Start display at page:

Download "Mathematical Expectation of a Random Variable"

Transcription

1 Mathematical ectation of a Random Variable

2 Idea: mean value of a random variable Definition: Weighted mean of the values of the random variable P Condition for the eistence: P < Note: Infinite sets can yield aradoes

3 Idea: mean value of a random variable Definition: Weighted mean of the values of the random variable P f ˆ ˆ * P white observation/ comosition of theurn Urn: 3 White 7 Black Observation P comosition of the urn/ whiteobservation * 3

4 Sum of random variables amle: sum of oints of n dice P htt://mathworld.wolfram.com/dice.html 4

5 Mistakes of intuition Intuition corresonds to ratio. Convergence on ratio. Difference gets as bigger! favorable favorable unfavorable favorableunfavorable 5

6 Idea: mean value of a random variable Note that it is robabilistic interretation of the common sense concet of mean. Two samles of the height of a oulation with a real mean of 80 cm. 5 Mean N

7 Idea: mean value of a random variable Note that it is robabilistic interretation of the common sense concet of mean. Note that if all ossible samles are equally robable, they are equivalent. P P N Mean N

8 Idea: center of mass/equilibrium If the robability P is interreted as mass, and the random variable as distance, the mathematical eectation is the center of mass of the object. P 8

9 amle: Roulette What is the ayoff given by the casino? Roulette selects at random a number between and Players can bet on 8,,9,6,4,3,, number. A Bet over k numbers has a robability of success of k/36 and of getting a ayment from the casino or lossing a. ected value is A fair game would imly k k P { Win, Loss} a k a 9

10 amle: Roulette What is the ayoff given by the casino? The roulette has 37 slots to 36 the 0 slot In a Real game the casino the odds are 35: 7: :3 P < { Win, Loss} 0 36 k a k 37 a k 37 a 37 We need to model the variability 0

11 amle: Parking ticket Which is the eected value of not aying the arking ticket? Parking ticket 3 euros Parking fine 50 euros Prob. of getting caught 0.05 P { Win, Loss} 3* *

12 amle: Parking ticket Which is the eected value of not aying the arking ticket? Imortant issues: Subjective value: 3 euros vs. 50 euros P { Win, Loss} Variability of the savings Possible runs of fines 3* *

13 ected value of a geometric random variable Random Varible {Number of trials until a success} P i n 0 i for How do we sum this series? i,,3,l 3 4 L n n 3 3

14 ected value of a geometric random variable How do we sum this series? 4

15 ected value of a geometric random variable How do we sum this series? 5

16 6 ected value of a geometric random variable How do we sum this series? Series Geometric n n k k n n n n L L L

17 7 ected value of a geometric random variable How do we sum this series? Another way Series Geometric b b d d a a d d b b a d d d d k S d d S k k k k

18 ected value of a geometric random variable Random Varible {Number of trials until a success} P i i for i,,3,l n 0 n n L

19 Relation of eectaition and other statistical measures Skew distribution vs. symetric distribution Mode Median Mean Mode Median Mean Full House: The Sread of cellence from Plato to Darwin by Stehen Jay Gould 9

20 0 Proerty of lineality The eectation of a linear combination of random variables is the linear combination of eectations. Y P Y P P Y Y Y Y β α ω ω β ω ω α ω ω β ω α β α β α β α ω ω ω Ω Ω Ω

21 Finding the maimum Suose that n children of differing heights are laced in line at random. You select the first child from the line and walk with her/him along the line until you encounter a child who is taller or until you have reached the end of the line. If you do encounter a taller child, you reeat the rocess. What is the eected value of the number of children selected from the line? Taken fromtijms, Understanding robability

22 Finding the maimum We define the variable as the number of children selected from the line. We will define the indicator variable: i if the i-th child is selected from the line 0 otherwise Now the number of selected children will be: L n

23 Finding the maimum The robability that the ith child is the tallest among the first i children is /i Therefore: i i i 0 for i,, Ln i L ln n L n n n 3

24 ected number of distinct birthdays What is the eected number of distinct birthdays within a randomly formed grou of 00 ersons. We define the random variable i if the birthday is on day i 0 otherwise The number of birthdays is L 3 Taken fromtijms, Understanding robability 4

25 ected number of distinct birthdays What is the eected number of distinct birthdays within a randomly formed grou of 00 ersons. For each day we have: P P i i P The eected number of distinct birthdays is L i 0 5

26 ected number of distinct birthdays For an arbitrary number of ersons. 365 n ected number of distinct birthdays Number of ersons 6

27 Other Proerties If is a non negative random variable, then Also Y then Y 7

28 Other Proerties What do we mean by Y then Y? Y : Ω R :Ω R 0. Y. 0 P PY P 8

29 Caveats of intuition Does the eectation always eist? Mean N Samle mean always eists P P λ λ e! ectation erhas gives an infinite value!!!! P α htt://hysicsweb.org/articles/world/4/7/9/#w40709 The hysics of the Web 9

30 Caveats of intuition Does the eectation always eist? amle: A Cauchy random variable Mean N P P π < < P α htt://hysicsweb.org/articles/world/4/7/9/#w40709 The hysics of the Web 30

31 3 Caveats of intuition Why is infinite? Divergent series Note that for high values of P π α P >> >> π π π

32 3 Caveats of intuition Why is infinite? Value of the harmonic series N > > L L L RPASSAR

33 ected waiting times Geometric Pareto gausian 33

34 ected value of a Binomial 34

Chapter 7 Sampling and Sampling Distributions. Introduction. Selecting a Sample. Introduction. Sampling from a Finite Population

Chapter 7 Sampling and Sampling Distributions. Introduction. Selecting a Sample. Introduction. Sampling from a Finite Population Chater 7 and s Selecting a Samle Point Estimation Introduction to s of Proerties of Point Estimators Other Methods Introduction An element is the entity on which data are collected. A oulation is a collection

More information

BERNOULLI TRIALS and RELATED PROBABILITY DISTRIBUTIONS

BERNOULLI TRIALS and RELATED PROBABILITY DISTRIBUTIONS BERNOULLI TRIALS and RELATED PROBABILITY DISTRIBUTIONS A BERNOULLI TRIALS Consider tossing a coin several times It is generally agreed that the following aly here ) Each time the coin is tossed there are

More information

Expected Value 7/7/2006

Expected Value 7/7/2006 Expected Value 7/7/2006 Definition Let X be a numerically-valued discrete random variable with sample space Ω and distribution function m(x). The expected value E(X) is defined by E(X) = x Ω x m(x), provided

More information

Classical AI and ML research ignored this phenomena Another example

Classical AI and ML research ignored this phenomena Another example Wat is tis? Classical AI and ML researc ignored tis enomena Anoter eamle you want to catc a fligt at 0:00am from Pitt to SF, can I make it if I leave at 8am and take a Marta at Gatec? artial observability

More information

Conditioning and Independence

Conditioning and Independence Discrete Random Variables: Joint PMFs Conditioning and Indeendence Berlin Chen Deartment of Comuter Science & Information ngineering National Taiwan Normal Universit Reference: - D. P. Bertsekas J. N.

More information

Errata List for the Second Printing

Errata List for the Second Printing Errata List for the Second Printing The Second Revised Edition has had two printings, and it also exists on the web. The second printing can be distinguished from the first printing by the fact that on

More information

6 Stationary Distributions

6 Stationary Distributions 6 Stationary Distributions 6. Definition and Examles Definition 6.. Let {X n } be a Markov chain on S with transition robability matrix P. A distribution π on S is called stationary (or invariant) if π

More information

1 Probability Spaces and Random Variables

1 Probability Spaces and Random Variables 1 Probability Saces and Random Variables 1.1 Probability saces Ω: samle sace consisting of elementary events (or samle oints). F : the set of events P: robability 1.2 Kolmogorov s axioms Definition 1.2.1

More information

1 Random Experiments from Random Experiments

1 Random Experiments from Random Experiments Random Exeriments from Random Exeriments. Bernoulli Trials The simlest tye of random exeriment is called a Bernoulli trial. A Bernoulli trial is a random exeriment that has only two ossible outcomes: success

More information

8 STOCHASTIC PROCESSES

8 STOCHASTIC PROCESSES 8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular

More information

Random variables. Lecture 5 - Discrete Distributions. Discrete Probability distributions. Example - Discrete probability model

Random variables. Lecture 5 - Discrete Distributions. Discrete Probability distributions. Example - Discrete probability model Random Variables Random variables Lecture 5 - Discrete Distributions Sta02 / BME02 Colin Rundel Setember 8, 204 A random variable is a numeric uantity whose value deends on the outcome of a random event

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

Hypothesis Test-Confidence Interval connection

Hypothesis Test-Confidence Interval connection Hyothesis Test-Confidence Interval connection Hyothesis tests for mean Tell whether observed data are consistent with μ = μ. More secifically An hyothesis test with significance level α will reject the

More information

Solutions to In Class Problems Week 15, Wed.

Solutions to In Class Problems Week 15, Wed. Massachusetts Institute of Technology 6.04J/18.06J, Fall 05: Mathematics for Comuter Science December 14 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised December 14, 005, 1404 minutes Solutions

More information

Discrete Mathematics for CS Spring 2006 Vazirani Lecture 22

Discrete Mathematics for CS Spring 2006 Vazirani Lecture 22 CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 22 Random Variables and Expectation Question: The homeworks of 20 students are collected in, randomly shuffled and returned to the students.

More information

7.2 Inference for comparing means of two populations where the samples are independent

7.2 Inference for comparing means of two populations where the samples are independent Objectives 7.2 Inference for comaring means of two oulations where the samles are indeendent Two-samle t significance test (we give three examles) Two-samle t confidence interval htt://onlinestatbook.com/2/tests_of_means/difference_means.ht

More information

1 Gambler s Ruin Problem

1 Gambler s Ruin Problem Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins

More information

ECON 4130 Supplementary Exercises 1-4

ECON 4130 Supplementary Exercises 1-4 HG Set. 0 ECON 430 Sulementary Exercises - 4 Exercise Quantiles (ercentiles). Let X be a continuous random variable (rv.) with df f( x ) and cdf F( x ). For 0< < we define -th quantile (or 00-th ercentile),

More information

V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE

V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE V. RANDOM VARIABLES, PROBABILITY DISTRIBUTIONS, EXPECTED VALUE A game of chance featured at an amusement park is played as follows: You pay $ to play. A penny a nickel are flipped. You win $ if either

More information

Measuring center and spread for density curves. Calculating probabilities using the standard Normal Table (CIS Chapter 8, p 105 mainly p114)

Measuring center and spread for density curves. Calculating probabilities using the standard Normal Table (CIS Chapter 8, p 105 mainly p114) Objectives Density curves Measuring center and sread for density curves Normal distributions The 68-95-99.7 (Emirical) rule Standardizing observations Calculating robabilities using the standard Normal

More information

Chapter 1: PROBABILITY BASICS

Chapter 1: PROBABILITY BASICS Charles Boncelet, obability, Statistics, and Random Signals," Oxford University ess, 0. ISBN: 978-0-9-0005-0 Chater : PROBABILITY BASICS Sections. What Is obability?. Exeriments, Outcomes, and Events.

More information

Power Series. Part 1. J. Gonzalez-Zugasti, University of Massachusetts - Lowell

Power Series. Part 1. J. Gonzalez-Zugasti, University of Massachusetts - Lowell Power Series Part 1 1 Power Series Suppose x is a variable and c k & a are constants. A power series about x = 0 is c k x k A power series about x = a is c k x a k a = center of the power series c k =

More information

Practice Exam 1: Long List 18.05, Spring 2014

Practice Exam 1: Long List 18.05, Spring 2014 Practice Eam : Long List 8.05, Spring 204 Counting and Probability. A full house in poker is a hand where three cards share one rank and two cards share another rank. How many ways are there to get a full-house?

More information

The Binomial Approach for Probability of Detection

The Binomial Approach for Probability of Detection Vol. No. (Mar 5) - The e-journal of Nondestructive Testing - ISSN 45-494 www.ndt.net/?id=7498 The Binomial Aroach for of Detection Carlos Correia Gruo Endalloy C.A. - Caracas - Venezuela www.endalloy.net

More information

Econ 101A Midterm 2 Th 8 April 2009.

Econ 101A Midterm 2 Th 8 April 2009. Econ A Midterm Th 8 Aril 9. You have aroximately hour and minutes to answer the questions in the midterm. I will collect the exams at. shar. Show your work, and good luck! Problem. Production (38 oints).

More information

Econometrica Supplementary Material

Econometrica Supplementary Material Econometrica Sulementary Material SUPPLEMENT TO WEAKLY BELIEF-FREE EQUILIBRIA IN REPEATED GAMES WITH PRIVATE MONITORING (Econometrica, Vol. 79, No. 3, May 2011, 877 892) BY KANDORI,MICHIHIRO IN THIS SUPPLEMENT,

More information

Sampling. Inferential statistics draws probabilistic conclusions about populations on the basis of sample statistics

Sampling. Inferential statistics draws probabilistic conclusions about populations on the basis of sample statistics Samling Inferential statistics draws robabilistic conclusions about oulations on the basis of samle statistics Probability models assume that every observation in the oulation is equally likely to be observed

More information

Measuring center and spread for density curves. Calculating probabilities using the standard Normal Table (CIS Chapter 8, p 105 mainly p114)

Measuring center and spread for density curves. Calculating probabilities using the standard Normal Table (CIS Chapter 8, p 105 mainly p114) Objectives 1.3 Density curves and Normal distributions Density curves Measuring center and sread for density curves Normal distributions The 68-95-99.7 (Emirical) rule Standardizing observations Calculating

More information

1 The Basic Counting Principles

1 The Basic Counting Principles 1 The Basic Counting Principles The Multiplication Rule If an operation consists of k steps and the first step can be performed in n 1 ways, the second step can be performed in n ways [regardless of how

More information

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Fall 203 Vazirani Note 2 Random Variables: Distribution and Expectation We will now return once again to the question of how many heads in a typical sequence

More information

Introduction to Probability for Graphical Models

Introduction to Probability for Graphical Models Introduction to Probability for Grahical Models CSC 4 Kaustav Kundu Thursday January 4, 06 *Most slides based on Kevin Swersky s slides, Inmar Givoni s slides, Danny Tarlow s slides, Jaser Snoek s slides,

More information

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 14. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 14. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Fall 202 Vazirani Note 4 Random Variables: Distribution and Expectation Random Variables Question: The homeworks of 20 students are collected in, randomly

More information

CH 3 P1. Two fair dice are rolled. What is the conditional probability that at least one lands on 6 given that the dice land on different numbers?

CH 3 P1. Two fair dice are rolled. What is the conditional probability that at least one lands on 6 given that the dice land on different numbers? CH 3 P1. Two fair dice are rolled. What is the conditional probability that at least one lands on 6 given that the dice land on different numbers? P7. The king comes from a family of 2 children. what is

More information

1,1 1,2 1,3 1,4 1,5 1,6 2,1 2,2 2,3 2,4 2,5 2,6 3,1 3,2 3,3 3,4 3,5 3,6 4,1 4,2 4,3 4,4 4,5 4,6 5,1 5,2 5,3 5,4 5,5 5,6 6,1 6,2 6,3 6,4 6,5 6,6

1,1 1,2 1,3 1,4 1,5 1,6 2,1 2,2 2,3 2,4 2,5 2,6 3,1 3,2 3,3 3,4 3,5 3,6 4,1 4,2 4,3 4,4 4,5 4,6 5,1 5,2 5,3 5,4 5,5 5,6 6,1 6,2 6,3 6,4 6,5 6,6 Name: Math 4 ctivity 9(Due by EOC Dec. 6) Dear Instructor or Tutor, These problems are designed to let my students show me what they have learned and what they are capable of doing on their own. Please

More information

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu Home Work: 1 1. Describe the sample space when a coin is tossed (a) once, (b) three times, (c) n times, (d) an infinite number of times. 2. A coin is tossed until for the first time the same result appear

More information

arxiv: v1 [physics.data-an] 26 Oct 2012

arxiv: v1 [physics.data-an] 26 Oct 2012 Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch

More information

Pretest (Optional) Use as an additional pacing tool to guide instruction. August 21

Pretest (Optional) Use as an additional pacing tool to guide instruction. August 21 Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 8 focus on multilication. Daily Unit 1: Rational vs. Irrational

More information

LECTURE 7 NOTES. x n. d x if. E [g(x n )] E [g(x)]

LECTURE 7 NOTES. x n. d x if. E [g(x n )] E [g(x)] LECTURE 7 NOTES 1. Convergence of random variables. Before delving into the large samle roerties of the MLE, we review some concets from large samle theory. 1. Convergence in robability: x n x if, for

More information

Learning Sequence Motif Models Using Gibbs Sampling

Learning Sequence Motif Models Using Gibbs Sampling Learning Sequence Motif Models Using Gibbs Samling BMI/CS 776 www.biostat.wisc.edu/bmi776/ Sring 2018 Anthony Gitter gitter@biostat.wisc.edu These slides excluding third-arty material are licensed under

More information

What is the probability of getting a heads when flipping a coin

What is the probability of getting a heads when flipping a coin Chapter 2 Probability Probability theory is a branch of mathematics dealing with chance phenomena. The origins of the subject date back to the Italian mathematician Cardano about 1550, and French mathematicians

More information

Chapter 7: Special Distributions

Chapter 7: Special Distributions This chater first resents some imortant distributions, and then develos the largesamle distribution theory which is crucial in estimation and statistical inference Discrete distributions The Bernoulli

More information

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar 15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider

More information

Math 143 Final Review - Version B page 1

Math 143 Final Review - Version B page 1 Math Final Review - Version B age. Simlif each of the following. cos a) + sin cos (log = log ) c) log (log ) log d) log log log e) cos sin cos f) sin cos + cos sin g) log sin h) sin tan i) + tan log j)

More information

University of California, Los Angeles Department of Statistics. Exam 1 21 October 2011

University of California, Los Angeles Department of Statistics. Exam 1 21 October 2011 University of California, Los Angeles Department of Statistics Statistics 00A Instructor: Nicolas Christou Exam 2 October 20 Name: Problem (20 points) a. Let X follow the Poisson distribution with parameter

More information

Potential Theory JWR. Monday September 17, 2001, 5:00 PM

Potential Theory JWR. Monday September 17, 2001, 5:00 PM Potential Theory JWR Monday Setember 17, 2001, 5:00 PM Theorem 1 (Green s identity). Let be a bounded oen region in R n with smooth boundary and u, v : R be smooth functions. Then ( ( ) u v v u dv = u

More information

Split the integral into two: [0,1] and (1, )

Split the integral into two: [0,1] and (1, ) . A continuous random variable X has the iecewise df f( ) 0, 0, 0, where 0 is a ositive real number. - (a) For any real number such that 0, rove that the eected value of h( X ) X is E X. (0 ts) Solution:

More information

Conditional Probability

Conditional Probability Conditional Probability Idea have performed a chance experiment but don t know the outcome (ω), but have some partial information (event A) about ω. Question: given this partial information what s the

More information

16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes

16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes Infinite Series 6. Introduction We extend the concet of a finite series, met in section, to the situation in which the number of terms increase without bound. We define what is meant by an infinite series

More information

Introduction to Probability and Statistics

Introduction to Probability and Statistics Introduction to Probability and Statistics Chater 8 Ammar M. Sarhan, asarhan@mathstat.dal.ca Deartment of Mathematics and Statistics, Dalhousie University Fall Semester 28 Chater 8 Tests of Hyotheses Based

More information

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations EECS 70 Discrete Mathematics and Probability Theory Fall 204 Anant Sahai Note 5 Random Variables: Distributions, Independence, and Expectations In the last note, we saw how useful it is to have a way of

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 16. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 16. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Spring 206 Rao and Walrand Note 6 Random Variables: Distribution and Expectation Example: Coin Flips Recall our setup of a probabilistic experiment as

More information

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B).

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B). Lectures 7-8 jacques@ucsdedu 41 Conditional Probability Let (Ω, F, P ) be a probability space Suppose that we have prior information which leads us to conclude that an event A F occurs Based on this information,

More information

A Solution for the Dark Matter Mystery based on Euclidean Relativity

A Solution for the Dark Matter Mystery based on Euclidean Relativity Long Beach 2010 PROCEEDINGS of the NPA 1 A Solution for the Dark Matter Mystery based on Euclidean Relativity Frédéric Lassiaille Arcades, Mougins 06250, FRANCE e-mail: lumimi2003@hotmail.com The study

More information

Probability Theory. 1 Review Questions in Combinatorics. Exercises

Probability Theory. 1 Review Questions in Combinatorics. Exercises Probability Theory Exercises 1 Review Questions in Combinatorics 1. Car license plates consist of 5 digits and 5 letters. How many different license plates are possible (a) if all digits precede the letters?

More information

Probability Experiments, Trials, Outcomes, Sample Spaces Example 1 Example 2

Probability Experiments, Trials, Outcomes, Sample Spaces Example 1 Example 2 Probability Probability is the study of uncertain events or outcomes. Games of chance that involve rolling dice or dealing cards are one obvious area of application. However, probability models underlie

More information

Preliminary Round Question Booklet

Preliminary Round Question Booklet First Annual Pi Day Mathematics Cometition Question Booklet 016 goes on and on, and e is just as cursed. Iwonder,howdoes begin When its digits are reversed? -MartinGardner Pi Day Mathematics Cometition

More information

MATH 3C: MIDTERM 1 REVIEW. 1. Counting

MATH 3C: MIDTERM 1 REVIEW. 1. Counting MATH 3C: MIDTERM REVIEW JOE HUGHES. Counting. Imagine that a sports betting pool is run in the following way: there are 20 teams, 2 weeks, and each week you pick a team to win. However, you can t pick

More information

Exercises in Probability Theory Paul Jung MA 485/585-1C Fall 2015 based on material of Nikolai Chernov

Exercises in Probability Theory Paul Jung MA 485/585-1C Fall 2015 based on material of Nikolai Chernov Exercises in Probability Theory Paul Jung MA 485/585-1C Fall 2015 based on material of Nikolai Chernov Many of the exercises are taken from two books: R. Durrett, The Essentials of Probability, Duxbury

More information

Towards New Probabilistic Assumptions in Business Intelligence. University of Information Technology and Management in Rzeszow, Poland

Towards New Probabilistic Assumptions in Business Intelligence. University of Information Technology and Management in Rzeszow, Poland Studia Humana Volume 3:4 (2014),. 11 21 DOI: 10.1515/sh-2015-0003 Towards New robabilistic Assumtions in Business Intelligence Andrew Schumann University of Information Technology and Management in Rzeszow,

More information

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete

More information

CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules

CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules. Introduction: The is widely used in industry to monitor the number of fraction nonconforming units. A nonconforming unit is

More information

CHAPTER 2. Solution to Problem 2.1. the weekend. We have. Let X be the number of points the MIT team earns over

CHAPTER 2. Solution to Problem 2.1. the weekend. We have. Let X be the number of points the MIT team earns over CHAPTER 2 Solution to Problem 2.1. the wee. We have Let X be the number of points the MIT team earns over P(X =0)=0.6 0.3 =0.18, P(X =1)=0.4 0.5 0.3+0.6 0.5 0.7 =0.27, P(X =2)=0.4 0.5 0.3+0.6 0.5 0.7+0.4

More information

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models

Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu

More information

1 Martingales. Martingales. (Ω, B, P ) is a probability space.

1 Martingales. Martingales. (Ω, B, P ) is a probability space. Martingales January 8, 206 Debdee Pati Martingales (Ω, B, P ) is a robability sace. Definition. (Filtration) filtration F = {F n } n 0 is a collection of increasing sub-σfields such that for m n, we have

More information

3. Show that if there are 23 people in a room, the probability is less than one half that no two of them share the same birthday.

3. Show that if there are 23 people in a room, the probability is less than one half that no two of them share the same birthday. N12c Natural Sciences Part IA Dr M. G. Worster Mathematics course B Examles Sheet 1 Lent erm 2005 Please communicate any errors in this sheet to Dr Worster at M.G.Worster@damt.cam.ac.uk. Note that there

More information

Random Variables Example:

Random Variables Example: Random Variables Example: We roll a fair die 6 times. Suppose we are interested in the number of 5 s in the 6 rolls. Let X = number of 5 s. Then X could be 0, 1, 2, 3, 4, 5, 6. X = 0 corresponds to the

More information

A Game Theoretic Investigation of Selection Methods in Two Population Coevolution

A Game Theoretic Investigation of Selection Methods in Two Population Coevolution A Game Theoretic Investigation of Selection Methods in Two Poulation Coevolution Sevan G. Ficici Division of Engineering and Alied Sciences Harvard University Cambridge, Massachusetts 238 USA sevan@eecs.harvard.edu

More information

Objectives. Estimating with confidence Confidence intervals.

Objectives. Estimating with confidence Confidence intervals. Objectives Estimating with confidence Confidence intervals. Sections 6.1 and 7.1 in IPS. Page 174-180 OS3. Choosing the samle size t distributions. Further reading htt://onlinestatbook.com/2/estimation/t_distribution.html

More information

Objectives. 6.1, 7.1 Estimating with confidence (CIS: Chapter 10) CI)

Objectives. 6.1, 7.1 Estimating with confidence (CIS: Chapter 10) CI) Objectives 6.1, 7.1 Estimating with confidence (CIS: Chater 10) Statistical confidence (CIS gives a good exlanation of a 95% CI) Confidence intervals. Further reading htt://onlinestatbook.com/2/estimation/confidence.html

More information

What does independence look like?

What does independence look like? What does independence look like? Independence S AB A Independence Definition 1: P (AB) =P (A)P (B) AB S = A S B S B Independence Definition 2: P (A B) =P (A) AB B = A S Independence? S A Independence

More information

1 Random Variables and Probability Distributions

1 Random Variables and Probability Distributions 1 Random Variables and Probability Distributions 1.1 Random Variables 1.1.1 Discrete random variables A random variable X is called discrete if the number of values that X takes is finite or countably

More information

Chapter 7 Rational and Irrational Numbers

Chapter 7 Rational and Irrational Numbers Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers

More information

Important Concepts Read Chapter 2. Experiments. Phenomena. Probability Models. Unpredictable in detail. Examples

Important Concepts Read Chapter 2. Experiments. Phenomena. Probability Models. Unpredictable in detail. Examples Probability Models Important Concepts Read Chapter 2 Probability Models Examples - The Classical Model - Discrete Spaces Elementary Consequences of the Axioms The Inclusion Exclusion Formulas Some Indiscrete

More information

Example 1. The sample space of an experiment where we flip a pair of coins is denoted by:

Example 1. The sample space of an experiment where we flip a pair of coins is denoted by: Chapter 8 Probability 8. Preliminaries Definition (Sample Space). A Sample Space, Ω, is the set of all possible outcomes of an experiment. Such a sample space is considered discrete if Ω has finite cardinality.

More information

CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 7 Probability. Outline. Terminology and background. Arthur G.

CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 7 Probability. Outline. Terminology and background. Arthur G. CISC 1100/1400 Structures of Comp. Sci./Discrete Structures Chapter 7 Probability Arthur G. Werschulz Fordham University Department of Computer and Information Sciences Copyright Arthur G. Werschulz, 2017.

More information

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability Chapter 2 Conditional Probability and Independence 2.1 Conditional Probability Probability assigns a likelihood to results of experiments that have not yet been conducted. Suppose that the experiment has

More information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

The genome encodes biology as patterns or motifs. We search the genome for biologically important patterns.

The genome encodes biology as patterns or motifs. We search the genome for biologically important patterns. Curriculum, fourth lecture: Niels Richard Hansen November 30, 2011 NRH: Handout pages 1-8 (NRH: Sections 2.1-2.5) Keywords: binomial distribution, dice games, discrete probability distributions, geometric

More information

Lecture 4 - Random walk, ruin problems and random processes

Lecture 4 - Random walk, ruin problems and random processes Lecture 4 - Random walk, ruin problems and random processes Jan Bouda FI MU April 19, 2009 Jan Bouda (FI MU) Lecture 4 - Random walk, ruin problems and random processesapril 19, 2009 1 / 30 Part I Random

More information

Senior Math Circles November 19, 2008 Probability II

Senior Math Circles November 19, 2008 Probability II University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles November 9, 2008 Probability II Probability Counting There are many situations where

More information

f(x) p(x) =p(b)... d. A function can have two different horizontal asymptotes...

f(x) p(x) =p(b)... d. A function can have two different horizontal asymptotes... Math Final Eam, Fall. ( ts.) Mark each statement as either true [T] or false [F]. f() a. If lim f() =and lim g() =, then lim does not eist......................!5!5!5 g() b. If is a olynomial, then lim!b

More information

AEROBICS TRAINING MODE BASED ON PLS REGRESSION MODEL

AEROBICS TRAINING MODE BASED ON PLS REGRESSION MODEL Journal of heoretical Alied Information echnolog st March 0 Vol 49 No 005-0 JAI & LLS All rights reserved ISSN: 99-8645 wwwjatitorg -ISSN: 87-95 AROBICS RAINING MOD BASD ON PLS RGRSSION MODL BNAN YUAN,

More information

Operations Management

Operations Management Universidade Nova de Lisboa Faculdade de Economia Oerations Management Winter Semester 009/010 First Round Exam January, 8, 009, 8.30am Duration: h30 RULES 1. Do not searate any sheet. Write your name

More information

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability

Chapter 2. Conditional Probability and Independence. 2.1 Conditional Probability Chapter 2 Conditional Probability and Independence 2.1 Conditional Probability Example: Two dice are tossed. What is the probability that the sum is 8? This is an easy exercise: we have a sample space

More information

A Social Welfare Optimal Sequential Allocation Procedure

A Social Welfare Optimal Sequential Allocation Procedure A Social Welfare Otimal Sequential Allocation Procedure Thomas Kalinowsi Universität Rostoc, Germany Nina Narodytsa and Toby Walsh NICTA and UNSW, Australia May 2, 201 Abstract We consider a simle sequential

More information

ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables

ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Random Variable Discrete Random

More information

15-451/651: Design & Analysis of Algorithms October 23, 2018 Lecture #17: Prediction from Expert Advice last changed: October 25, 2018

15-451/651: Design & Analysis of Algorithms October 23, 2018 Lecture #17: Prediction from Expert Advice last changed: October 25, 2018 5-45/65: Design & Analysis of Algorithms October 23, 208 Lecture #7: Prediction from Exert Advice last changed: October 25, 208 Prediction with Exert Advice Today we ll study the roblem of making redictions

More information

Weakly Short Memory Stochastic Processes: Signal Processing Perspectives

Weakly Short Memory Stochastic Processes: Signal Processing Perspectives Weakly Short emory Stochastic Processes: Signal Processing Persectives by Garimella Ramamurthy Reort No: IIIT/TR/9/85 Centre for Security, Theory and Algorithms International Institute of Information Technology

More information

ECE 6960: Adv. Random Processes & Applications Lecture Notes, Fall 2010

ECE 6960: Adv. Random Processes & Applications Lecture Notes, Fall 2010 ECE 6960: Adv. Random Processes & Alications Lecture Notes, Fall 2010 Lecture 16 Today: (1) Markov Processes, (2) Markov Chains, (3) State Classification Intro Please turn in H 6 today. Read Chater 11,

More information

Introduction to Probability, Fall 2013

Introduction to Probability, Fall 2013 Introduction to Probability, Fall 2013 Math 30530 Section 01 Homework 4 Solutions 1. Chapter 2, Problem 1 2. Chapter 2, Problem 2 3. Chapter 2, Problem 3 4. Chapter 2, Problem 5 5. Chapter 2, Problem 6

More information

Week 04 Discussion. a) What is the probability that of those selected for the in-depth interview 4 liked the new flavor and 1 did not?

Week 04 Discussion. a) What is the probability that of those selected for the in-depth interview 4 liked the new flavor and 1 did not? STAT Wee Discussion Fall 7. A new flavor of toothpaste has been developed. It was tested by a group of people. Nine of the group said they lied the new flavor, and the remaining 6 indicated they did not.

More information

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 1

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 1 IEOR 3106: Introduction to Operations Research: Stochastic Models Professor Whitt SOLUTIONS to Homework Assignment 1 Probability Review: Read Chapters 1 and 2 in the textbook, Introduction to Probability

More information

Advance Selling in the Presence of Experienced Consumers

Advance Selling in the Presence of Experienced Consumers Advance Selling in the Presence of Eerienced Consumers Oksana Loginova X. Henry Wang Chenhang Zeng June 30, 011 Abstract The advance selling strategy is imlemented when a firm offers consumers the oortunity

More information

Use of Transformations and the Repeated Statement in PROC GLM in SAS Ed Stanek

Use of Transformations and the Repeated Statement in PROC GLM in SAS Ed Stanek Use of Transformations and the Reeated Statement in PROC GLM in SAS Ed Stanek Introduction We describe how the Reeated Statement in PROC GLM in SAS transforms the data to rovide tests of hyotheses of interest.

More information

The non-stochastic multi-armed bandit problem

The non-stochastic multi-armed bandit problem Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at

More information

4 Branching Processes

4 Branching Processes 4 Branching Processes Organise by generations: Discrete time. If P(no offspring) 0 there is a probability that the process will die out. Let X = number of offspring of an individual p(x) = P(X = x) = offspring

More information

16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes

16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes Infinite Series 6.2 Introduction We extend the concet of a finite series, met in Section 6., to the situation in which the number of terms increase without bound. We define what is meant by an infinite

More information

Brownian Motion and Random Prime Factorization

Brownian Motion and Random Prime Factorization Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion.................... 2 2.. Measure Saces and Borel Sigma-Algebras.........

More information

Probability Theory: Homework problems

Probability Theory: Homework problems June 22, 2018 Homework 1. Probability Theory: Homework problems 1. A traditional three-digit telephone area code is constructed as follows. The first digit is from the set {2, 3, 4, 5, 6, 7, 8, 9}, the

More information