Stat2.2x Probability(概率)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授。

PDF笔记下载(Academia.edu)

Summary

  • Law of Large Numbers As the number of trials increases, the chance that the proportion of successes is in the range $$p\pm\text{a fixed amount}$$ goes to $1$.
  • Expected value of the Binomial If a random variable $X$ has the binomial distribution with parameters $n$ and $p$, then $$E(x)=n\cdot p$$

PRACTICE

PROBLEM 1

In each pair of events below, pick the one that has the higher chance.

1a)

A: 50,000 heads in 100,000 tosses of a coin

B: 500,000 heads in 1,000,000 tosses of a coin

1b)

A: In 60 rolls of a die, the number of times “six” shows up is in the range 10 plus or minus 3

B: In 600 rolls of a die, the number of times “six” shows up is in the range 100 plus or minus 3

1c)

A: In 1000 draws by a random number generator, the percent of times “0” shows up is in the range 10% plus or minus 1%

B: In 10,000 draws by a random number generator, the percent of times “0” shows up is in the range 10% plus or minus 1%

1d)

A: In 1000 draws by a random number generator, the percent of times “0” appears is less than 11%

B: In 10,000 draws by a random number generator, the percent of times “0” appears is less than 11%

Solution

1a) A. The chance of getting exactly half heads goes down (i.e. goes to 0) with more tosses. For example:

dbinom(x = 50000, size = 100000, prob = 0.5)
[1] 0.002523126
dbinom(x = 500000, size = 1000000, prob = 0.5)
[1] 0.0007978844

1b) A. The chance that the number of successes falls in the range “most likely value plus or minus a fixed amount” goes down with more rolls. For example:

sum(dbinom(x = 7:13, size = 60, prob = 1/6))
[1] 0.7767122
sum(dbinom(x = 97:103, size = 600, prob = 1/6))
[1] 0.2985048

1c) B. This follows the "Law of Large Numbers".

sum(dbinom(x = 90:110, size = 1000, prob = 1/10))
[1] 0.7318197
sum(dbinom(x = 900:1100, size = 10000, prob = 1/10))
[1] 0.9991879

1d) B. “less than $11\%$” includes $10\%$, which is where the percent of 0’s is going as the number of draws increases. More formally, the chance that the percent of 0’s exceeds the actual probability (i.e. $0.1$) plus any fixed amount (e.g. $0.01$) gets smaller as the number of draws increases. So the probability of the complement gets larger.

PROBLEM 2

My friend and I gamble on a roll of a die as follows: if the die shows 1 spot or 6 spots, I give my friend $\$2$. If the die show 2, 3, 4, or 5 spots, my friend gives me $\$1$. Suppose we play this game 100 times. What is my expected net gain?

Solution

$P(\text{lose})=\frac{1}{3},\ P(\text{win})=\frac{2}{3}$. Therefore $$E=\frac{1}{3}\times(-2)+\frac{2}{3}\times1=0$$

PROBLEM 3

A die is rolled 600 times. The “multiples of 3” are the faces with 3 spots and 6 spots. Find the expected value of:

a) the proportion of times multiples of 3 appear

b) the number of times multiples of 3 appear

Solution

3a) $$P(\text{multiples of 3 appear})=\frac{2}{6}=\frac{1}{3}$$

3b) Binomial distribution, $$E=np=600\times\frac{1}{3}=200$$

PROBLEM 4

If you bet on a “split” in roulette, your chance of winning is 2/38. The bets pays 17 to 1; this means that if you bet \$1 on a split and win the bet, your net gain is \$17; if you lose the bet, you lose your dollar and so your net gain is -\$1. Suppose you place 200 bets on a split; assume your bets are independent of each other. Find your expected net gain.

Solution

The expected value of the proportion of the net gain is $$E_p=\frac{2}{38}\times 17+\frac{36}{38}\times(-1)=-\frac{1}{19}$$ Hence the expected value of the net gain is $$E=200\times(-\frac{1}{19})\doteq-10.52632$$ In other words you expect to come out losing about \$10.53.

EXERCISE SET 3

PROBLEM 1

In a roll of a die, let a "six" be the face with six spots. Consider the two events below.

Event A: more than 16,000 sixes in 100,000 rolls

Event B: more than 160,000 sixes in 1,000,000 rolls.

Which probability is larger?

Solution

According to the Law of Large Numbers, $P(A) < P(B)$. Alternatively, we can test it using smaller examples: $$P(\text{more than 160 sixes in 1000 rolls})$$ $$=\sum_{k=161}^{1000}C_{1000}^{k}\cdot(\frac{1}{6})^k\cdot(\frac{5}{6})^{1000-k}\doteq0.6971976$$ And $$P(\text{more than 1600 sixes in 10000 rolls})$$ $$=\sum_{k=1601}^{10000}C_{10000}^{k}\cdot(\frac{1}{6})^k\cdot(\frac{5}{6})^{10000-k}\doteq0.9626252$$ R code:

sum(dbinom(161:1000, 1000, 1/6))
[1] 0.6971976
sum(dbinom(1601:10000, 10000, 1/6))
[1] 0.9626252

PROBLEM 2

In the bet on a “single number” at roulette, there is chance 1/38 of winning. The bet pays 35 to 1; you can take this to mean that if you win the bet, your net gain is $\$35$, and if you lose the bet then you lose $\$1$ (that is, your net gain is $-\$1$).

You don’t need to know any more about roulette to solve this problem, but the description given above is what would happen if you were to bet $\$1$ on a single number at a Las Vegas roulette table.

Suppose you bet repeatedly on a single number; assume that the bets are independent of each other. Find the expected value of your net gain from 38 bets.

Solution

$$E=38\times(\frac{1}{38}\times35+\frac{37}{38}\times(-1))=38\times(-\frac{2}{38})=-2$$

PROBLEM 3

400 draws are made at random with replacement from 5 tickets that are marked -2, -1, 0, 1, and 2 respectively. Find the expected value of:

3A the number of times positive numbers appear

3B the sum of all the numbers drawn

3C the sum of the positive numbers drawn

Solution

3A) $$E(\text{number of times positive numbers appear})=400\times\frac{2}{5}=160$$

3B) $$E(\text{sum of all the numbers drawn})=0$$

3C) $$E(\text{sum of the positive numbers drawn})$$ $$=400\times(1\times\frac{1}{5}+2\times\frac{1}{5})=400\times\frac{3}{5}=240$$

加州大学伯克利分校Stat2.2x Probability 概率初步学习笔记: Section 3 The law of averages, and expected values的更多相关文章

  1. 加州大学伯克利分校Stat2.2x Probability 概率初步学习笔记: Section 5 The accuracy of simple random samples

    Stat2.2x Probability(概率)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

  2. 加州大学伯克利分校Stat2.2x Probability 概率初步学习笔记: Section 4 The Central Limit Theorem

    Stat2.2x Probability(概率)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

  3. 加州大学伯克利分校Stat2.2x Probability 概率初步学习笔记: Section 2 Random sampling with and without replacement

    Stat2.2x Probability(概率)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

  4. 加州大学伯克利分校Stat2.2x Probability 概率初步学习笔记: Section 1 The Two Fundamental Rules (1.5-1.6)

    Stat2.2x Probability(概率)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

  5. 加州大学伯克利分校Stat2.2x Probability 概率初步学习笔记: Final

    Stat2.2x Probability(概率)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

  6. 加州大学伯克利分校Stat2.2x Probability 概率初步学习笔记: Midterm

    Stat2.2x Probability(概率)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

  7. 加州大学伯克利分校Stat2.3x Inference 统计推断学习笔记: FINAL

    Stat2.3x Inference(统计推断)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

  8. 加州大学伯克利分校Stat2.3x Inference 统计推断学习笔记: Section 2 Testing Statistical Hypotheses

    Stat2.3x Inference(统计推断)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

  9. 加州大学伯克利分校Stat2.3x Inference 统计推断学习笔记: Section 1 Estimating unknown parameters

    Stat2.3x Inference(统计推断)课程由加州大学伯克利分校(University of California, Berkeley)于2014年在edX平台讲授. PDF笔记下载(Acad ...

随机推荐

  1. 你真的熟悉background吗?

    一两个月没更新博客了,因为放假刚在深圳找了实习,一直都比较忙碌,不过我觉得再忙,还是需要时间去沉淀一些东西,工作的时候别人看到的只是你有没有实现最终的结果,但自己是否思考,是否去总结,决定着你工作是否 ...

  2. 几张图弄明白ios布局中的尺寸问题

    背景 先说说逆向那事.各种曲折..各种技术过时,老老实实在啃看雪的帖子..更新会有的. 回正题,这里讨论的是在Masnory框架下的布局问题.像我这种游击队没师傅带,什么都得自己琢磨,一直没闹明白下面 ...

  3. C#调用百度静态地图

    来深圳一年多了,感觉深圳的IT氛围确实比长沙好,工作和生活节奏比较快,适合于学习.来深后一直在现在所在的公司,部门从开始4个人,发展到现在10来人了,感觉还是不错的. 发现自己很少写博客了,倒不是学得 ...

  4. 一起来学node.js吧 node school简介

    node.js这几年火爆的简直丧心病狂,去lagou.com查查node.js的职位,那叫一个多. 要说火爆到什么程度,竟然有一个网站专门去教大家学习node.js, Node School. 进去逛 ...

  5. HTTP请求头参数

      Accept-Language: zh-cn,zh;q=0.5 意思:浏览器支持的语言分别是中文和简体中文,优先支持简体中文. 详解: Accept-Language表示浏览器所支持的语言类型: ...

  6. 禁用Win10显卡更新

    右键This PC-Properties-Advanced system settings-选择Hardware这个tab-Device installation settings选择No

  7. 欧几里德与扩展欧几里德算法 Extended Euclidean algorithm

    欧几里德算法 欧几里德算法又称辗转相除法,用于计算两个整数a,b的最大公约数. 基本算法:设a=qb+r,其中a,b,q,r都是整数,则gcd(a,b)=gcd(b,r),即gcd(a,b)=gcd( ...

  8. MSSQL 问题集锦

    [1]关于SQL Server数据库连接字符串的特殊参数说明 MultipleActiveResultSets和Mars_Connection同义,指定此数据库连接是否复用数据库内已建立的相同用户的连 ...

  9. C 语言学习的第 05 课:了解课程配套的平台

    在此之前,已经同授课老师沟通,确认课程的配套平台是Coding.net.对于大多数(甚至是全部)同学来说,这个平台应该是极其陌生的.不过不用担心,且还是娓娓道来. 定义:Coding.net是一个集代 ...

  10. [转]搞ACM的你伤不起(转自Roba大神)

    劳资六年前开始搞ACM啊!!!!!!!!!! 从此踏上了尼玛不归路啊!!!!!!!!!!!! 谁特么跟劳资讲算法是程序设计的核心啊!!!!!! 尼玛除了面试题就没见过用算法的地方啊!!!!!! 谁再跟 ...