Probability theory and mathematical statistics:

Similar documents
Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Sets and Probabilistic Models

Axioms of Measure Theory

UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15

Sets and Probabilistic Models

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Random Models. Tusheng Zhang. February 14, 2013

PUTNAM TRAINING PROBABILITY

The Random Walk For Dummies

CS 70 Second Midterm 7 April NAME (1 pt): SID (1 pt): TA (1 pt): Name of Neighbor to your left (1 pt): Name of Neighbor to your right (1 pt):

Lecture 2: April 3, 2013

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19

( ) = p and P( i = b) = q.

UC Berkeley Department of Electrical Engineering and Computer Sciences. EE126: Probability and Random Processes

Conditional Probability. Given an event M with non zero probability and the condition P( M ) > 0, Independent Events P A P (AB) B P (B)

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

STAT Homework 1 - Solutions

0, otherwise. EX = E(X 1 + X n ) = EX j = np and. Var(X j ) = np(1 p). Var(X) = Var(X X n ) =

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15

Downloaded from

CS284A: Representations and Algorithms in Molecular Biology

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Lecture Chapter 6: Convergence of Random Sequences

CS 171 Lecture Outline October 09, 2008

Math 104: Homework 2 solutions

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Lecture 2. The Lovász Local Lemma

On a Smarandache problem concerning the prime gaps

CS 330 Discussion - Probability

f X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36

Massachusetts Institute of Technology

An Introduction to Randomized Algorithms

STAT 516 Answers Homework 6 April 2, 2008 Solutions by Mark Daniel Ward PROBLEMS

Homework 9. (n + 1)! = 1 1

First Year Quantitative Comp Exam Spring, Part I - 203A. f X (x) = 0 otherwise

Chapter 6 Conditional Probability

The Boolean Ring of Intervals

Discrete probability distributions

Math 152. Rumbos Fall Solutions to Review Problems for Exam #2. Number of Heads Frequency

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

f X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36

Week 5-6: The Binomial Coefficients

SEQUENCES AND SERIES

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Section 5.1 The Basics of Counting

The multiplicative structure of finite field and a construction of LRC

Random Variables, Sampling and Estimation

Math Solutions to homework 6

Convergence of random variables. (telegram style notes) P.J.C. Spreij

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Chapter 4. Fourier Series

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

SEQUENCE AND SERIES NCERT

On Random Line Segments in the Unit Square

Expectation and Variance of a random variable

CS / MCS 401 Homework 3 grader solutions

Solutions of Homework 2.

2) 3 π. EAMCET Maths Practice Questions Examples with hints and short cuts from few important chapters

IIT JAM Mathematical Statistics (MS) 2006 SECTION A

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

Skip Lists. Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 S 3 S S 1

Math 155 (Lecture 3)

Probability and Statistics

Final Review for MATH 3510

Lecture 6 Simple alternatives and the Neyman-Pearson lemma

Lecture 1 Probability and Statistics

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

Different kinds of Mathematical Induction

ARITHMETIC PROGRESSION

PRACTICE PROBLEMS FOR THE FINAL

Mathematical Statistics - MS

Introduction to Probability and Statistics Twelfth Edition

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

Topic 8: Expected Values

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

SEQUENCES AND SERIES

LECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS

Assignment 5: Solutions

Statisticians use the word population to refer the total number of (potential) observations under consideration

Lecture 4 The Simple Random Walk

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

GRADE 12 JUNE 2016 MATHEMATICS P1

ON POINTWISE BINOMIAL APPROXIMATION

7.1 Convergence of sequences of random variables

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

CIS Spring 2018 (instructor Val Tannen)

THE KENNESAW STATE UNIVERSITY HIGH SCHOOL MATHEMATICS COMPETITION PART II Calculators are NOT permitted Time allowed: 2 hours

Let us consider the following problem to warm up towards a more general statement.

Some discrete distribution

Quick Review of Probability

ABOUT CHAOS AND SENSITIVITY IN TOPOLOGICAL DYNAMICS

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities

International Contest-Game MATH KANGAROO Canada, Grade 11 and 12

Transcription:

N.I. Lobachevsky State Uiversity of Nizhi Novgorod Probability theory ad mathematical statistics: Law of Total Probability. Associate Professor A.V. Zorie Law of Total Probability. 1 / 14

Theorem Let H 1, H 2,..., H,... be a fiite or deumerable sequece of mutualually exclusive evets with positive probability each, ad A H 1 H 2... H.... The P(A) = P(H 1 )P(A H 1 ) + P(H 2 )P(A H 2 ) +... + P(H )P(A H ) +... Proof. Evets A H 1, A H 2,..., A H,... are mutually exclusive ad A = (A H 1 ) (A H 2 )... (A H ).... The P(A) = P((A H 1 ) (A H 2 )... (A H )...) = P(A H 1 ) + P(A H 2 ) +... + P(A H ) +... = P(H 1 )P(A H 1 ) + P(H 2 )P(A H 2 ) +... P(H )P(A H ) +... Law of Total Probability. 2 / 14

Example. There are m red balls ad blue balls i a ur. Two balls are take out oe by oe without replacemet. What s the probability the secod ball is blue (evet A)? Law of Total Probability. 3 / 14

Example. There are m red balls ad blue balls i a ur. Two balls are take out oe by oe without replacemet. What s the probability the secod ball is blue (evet A)? Solutio by classical formula We ca use classical formula here. A outcome is a arragemet of two balls without repetitios. Favorable outcome are those with the secod ball of the blue color. The first ball ca be either blue or red. N(Ω) = A 2 m+ = (m + )(m + 1), N(A) = ( 1) + m, So, P(A) = ( 1) + m (m + )(m + 1) = m + Law of Total Probability. 3 / 14

Example. There are m red balls ad blue balls i a ur. Two balls are take out oe by oe without replacemet. What s the probability the secod ball is blue (evet A)? Law of Total Probability. 4 / 14

Example. There are m red balls ad blue balls i a ur. Two balls are take out oe by oe without replacemet. What s the probability the secod ball is blue (evet A)? Solutio by law of total probability. Let evet H 1 occur whe the first ball is red ad H 2 occur whe the first ball is blue. P(H 1 ) = m m +, Law of Total Probability. 4 / 14

Example. There are m red balls ad blue balls i a ur. Two balls are take out oe by oe without replacemet. What s the probability the secod ball is blue (evet A)? Solutio by law of total probability. Let evet H 1 occur whe the first ball is red ad H 2 occur whe the first ball is blue. P(H 1 ) = m m +, P(A H 1) = m + 1 Law of Total Probability. 4 / 14

Example. There are m red balls ad blue balls i a ur. Two balls are take out oe by oe without replacemet. What s the probability the secod ball is blue (evet A)? Solutio by law of total probability. Let evet H 1 occur whe the first ball is red ad H 2 occur whe the first ball is blue. P(H 1 ) = P(H 2 ) = m m +, P(A H 1) = m +, m + 1 Law of Total Probability. 4 / 14

Example. There are m red balls ad blue balls i a ur. Two balls are take out oe by oe without replacemet. What s the probability the secod ball is blue (evet A)? Solutio by law of total probability. Let evet H 1 occur whe the first ball is red ad H 2 occur whe the first ball is blue. P(H 1 ) = P(H 2 ) = m m +, P(A H 1) = m + 1 m +, P(A H 2) = 1 m + 1 Law of Total Probability. 4 / 14

Example. There are m red balls ad blue balls i a ur. Two balls are take out oe by oe without replacemet. What s the probability the secod ball is blue (evet A)? Solutio by law of total probability. Let evet H 1 occur whe the first ball is red ad H 2 occur whe the first ball is blue. The P(H 1 ) = P(H 2 ) = m m +, P(A H 1) = m + 1 m +, P(A H 2) = 1 m + 1 P(A) = P(H 1 )P(A H 1 ) + P(H 2 )P(A H 2 ) = m + m m + 1 + m + 1 m + 1 = m + Law of Total Probability. 4 / 14

Example. There 5 urs, two of them cotai 2 red balls ad 1 blue ball, aother two cotai 3 red balls ad 1 blue ball, ad the last oe cotais 10 blue balls. A ur is picked at radom ad oe ball is take out. What s the probability that the ball is red? Law of Total Probability. 5 / 14

Example. There 5 urs, two of them cotai 2 red balls ad 1 blue ball, aother two cotai 3 red balls ad 1 blue ball, ad the last oe cotais 10 blue balls. A ur is picked at radom ad oe ball is take out. What s the probability that the ball is red? Solutio. Let evet H 1 occur whe oe of the first two urs is chose, H 2 occur whe the third or the fourth urs is chose, H 3 occur whe the fifth ur is chose. P(H 1 ) = 2 5, P(H 2) = 2 5, P(H 3) = 1 5, P(A H 1) = 2 3, P(A H 2 ) = 3 4, P(A H 3) = 0. The P(A) = 2 5 2 3 + 2 5 3 4 + 1 5 0 = 17 30 Law of Total Probability. 5 / 14

There are m red balls ad blue balls i a ur. r balls are take out oe by oe without replacemet, r m +. Prove that the probability for the last ball to be blue is m+. Law of Total Probability. 6 / 14

There are m red balls ad blue balls i a ur. r balls are take out oe by oe without replacemet, r m +. Prove that the probability for the last ball to be blue is m+. Deote by π(r; m, ) the probability i questio. It s obvious that Now assume that π(1; m, ) = m +. π(2; m, ) = π(3; m, ) =... = π(r 1; m, ) = We have to prove that π(r; m, ) = m + m + Law of Total Probability. 6 / 14

Let evet H 1 occur whe the first ball is red ad H 2 occur whe the first ball is blue. P(H 1 ) = m + m, P(H 2) = m + Law of Total Probability. 7 / 14

Let evet H 1 occur whe the first ball is red ad H 2 occur whe the first ball is blue. P(H 1 ) = m + m, P(H 2) = m + If H 1 occurs, the oly + m 1 balls left, of them are blue, ad we still have to take r 1 balls out, so the coditioal probability that the last ball is blue give that the first is red equals π(r 1; m 1, ). Law of Total Probability. 7 / 14

Let evet H 1 occur whe the first ball is red ad H 2 occur whe the first ball is blue. P(H 1 ) = m + m, P(H 2) = m + If H 1 occurs, the oly + m 1 balls left, of them are blue, ad we still have to take r 1 balls out, so the coditioal probability that the last ball is blue give that the first is red equals π(r 1; m 1, ). If H 2 occurs, the oly + m 1 balls left, 1 of them are blue, ad we are to take r 1 balls out, so the coditioal probability that the last ball is blue give that the first is blue equals π(r 1; m, 1). Law of Total Probability. 7 / 14

By assumptio, π(r 1; m 1, ) = m + 1, π(r 1; m, 1) = 1 m + 1. Accordig to the law of total probability, π(r; m, ) = P(H 1 )π(r 1; m 1, ) + P(H 2 )π(r 1; m, 1) = m + m m + 1 + m + 1 m + 1 = m + Law of Total Probability. 8 / 14

Rui problem Law of total probability Assume A ad Bart play Heads ad Tails. If A wis, she pays oe rouble to Bart. If Bart wis, he pays oe rouble to A. I the begiig A has a roubles, Bart has b roubles. What s the probability A loses all her moey? A s rui meas that A has o more roubles. The same holds for Bart s rui. Law of Total Probability. 9 / 14

Rui problem Law of total probability Assume A ad Bart play Heads ad Tails. If A wis, she pays oe rouble to Bart. If Bart wis, he pays oe rouble to A. I the begiig A has a roubles, Bart has b roubles. What s the probability A loses all her moey? A s rui meas that A has o more roubles. The same holds for Bart s rui. The total sum of roubles is a + b. Deote by π(x) probabilty of A s rui havig x roubles iitially. If she wis a toss, her fortue becomes x + 1 roubles, otherwise x 1 roubles. She wis a toss with probability 1 2 ad loses with probability 1 2. If has x roubles ad she wis a toss, whether she gets ruied or ot is defied oly by the future tosses which are idepedet of the past tosses, so the rui probability after that is π(x + 1). Law of Total Probability. 9 / 14

By the total probability formula, besides that, From (1), for a costat c, ad Usig (2), obtai π(a) = 1 2 π(x + 1) + 1 π(x 1) (1) 2 π(0) = 1 ad π(a + b) = 0. (2) π(x) π(x 1) = π(x + 1) π(x) = c π(x) = π(0) + xc. π(x) = 1 x a + b Thus, A gets ruied with probability π(a) = b a+b. Law of Total Probability. 10 / 14

A problem i rus I ay ordered sequece of elemets of two kids, each maximal subsequece of elemets of like kid is called a ru. For example, the sequece xxxyxxyyyx opes with a x ru of legth 3; it is followed by rus of legth 1, 2, 3, 1, respectively. Law of Total Probability. 11 / 14

A problem i rus I ay ordered sequece of elemets of two kids, each maximal subsequece of elemets of like kid is called a ru. For example, the sequece xxxyxxyyyx opes with a x ru of legth 3; it is followed by rus of legth 1, 2, 3, 1, respectively. Let α ad β be positive itegers, ad cosider a potetially ulimited sequece i idepedet trials, such as tossig a coi or throwig dice. Symbol x occurs i a sigle trial with probability p, symbol y occurs i a sigle trial with probability q = 1 p. What s the probability that a ru of α cosecutive x s will occur before a ru of β cosecutive y s? Law of Total Probability. 11 / 14

Sice the trials are idepedet, the probability of the sequece xxxyxxyyyx equals p p p q p p q q q p = p 6 q 4. Law of Total Probability. 12 / 14

Sice the trials are idepedet, the probability of the sequece xxxyxxyyyx equals p p p q p p q q q p = p 6 q 4. Let A be the evet that a ru of α cosecutive x s occurs before a ru of β cosecutive y s. Deote x = P(A). Let The u = P(A the first trial results i x ), v = P(A the first trial results i y ). x = pu + qv. Law of Total Probability. 12 / 14

Suppose that the first trial results i x. I this case the evet A ca occur i α mutually exclusive ways: 1 The followig α 1 trials result i x s; the probability for this is p α 1. Law of Total Probability. 13 / 14

Suppose that the first trial results i x. I this case the evet A ca occur i α mutually exclusive ways: 1 The followig α 1 trials result i x s; the probability for this is p α 1. 2 The first y occurs at the rth trial where 2 r α. Let this evet be H r. The P(H r ) = p r 2 q, ad P(A H r ) = v. Hece u = p α 1 + qv(1 + p +... + p α 2 ) Law of Total Probability. 13 / 14

Suppose that the first trial results i x. I this case the evet A ca occur i α mutually exclusive ways: 1 The followig α 1 trials result i x s; the probability for this is p α 1. 2 The first y occurs at the rth trial where 2 r α. Let this evet be H r. The P(H r ) = p r 2 q, ad P(A H r ) = v. Hece u = p α 1 + qv(1 + p +... + p α 2 ) = p α 1 + v(1 p α ). Law of Total Probability. 13 / 14

Suppose that the first trial results i x. I this case the evet A ca occur i α mutually exclusive ways: 1 The followig α 1 trials result i x s; the probability for this is p α 1. 2 The first y occurs at the rth trial where 2 r α. Let this evet be H r. The P(H r ) = p r 2 q, ad P(A H r ) = v. Hece u = p α 1 + qv(1 + p +... + p α 2 ) = p α 1 + v(1 p α ). If the first trial results i y, a similar argumet leads to v = pu(1 + q +... + q β 2 ) Law of Total Probability. 13 / 14

Suppose that the first trial results i x. I this case the evet A ca occur i α mutually exclusive ways: 1 The followig α 1 trials result i x s; the probability for this is p α 1. 2 The first y occurs at the rth trial where 2 r α. Let this evet be H r. The P(H r ) = p r 2 q, ad P(A H r ) = v. Hece u = p α 1 + qv(1 + p +... + p α 2 ) = p α 1 + v(1 p α ). If the first trial results i y, a similar argumet leads to v = pu(1 + q +... + q β 2 ) = q(1 q β 1 ). Law of Total Probability. 13 / 14

We have two equatios for the two ukow u ad v: u = p α 1 + v(1 p α ), v = qu(1 q β 1 ). Law of Total Probability. 14 / 14

We have two equatios for the two ukow u ad v: Solutio is u = p α 1 + v(1 p α ), u = v = v = qu(1 q β 1 ). p α q pq β + p α (q q β ), p α (q q β ) pq β + p α (q q β ). Law of Total Probability. 14 / 14

We have two equatios for the two ukow u ad v: u = p α 1 + v(1 p α ), v = qu(1 q β 1 ). Solutio is u = v = p α q pq β + p α (q q β ), p α (q q β ) pq β + p α (q q β ). Fially, x = pu + qv = p α 1 1 p α p α 1 + q β 1 p α 1 q β 1 Law of Total Probability. 14 / 14

We have two equatios for the two ukow u ad v: u = p α 1 + v(1 p α ), v = qu(1 q β 1 ). Solutio is u = v = p α q pq β + p α (q q β ), p α (q q β ) pq β + p α (q q β ). Fially, x = pu + qv = p α 1 1 p α p α 1 + q β 1 p α 1 q β 1 For example, i tossig a coi (p = 1 2 ) the probability that a ru of two heads appears before a ru of three tails is 0,7. Law of Total Probability. 14 / 14