Unit 4-Lecture 1:Intro to Discrete Probability
来源:互联网 发布:直线制职能制矩阵制 编辑:程序博客网 时间:2024/04/30 22:59
1 The Four Step Method to Solve Problems like “What is the probability that… ?”
Step 1: Find the Sample Space:
- Every possible combination of these randomly-determined quantities is called an outcome.
- The set of all possible outcomes is called the sample space for the experiment.
- A tree diagram is a graphical tool that can help us work through the four step approach when the number of outcomes is not too large or the problem is nicely structured.
- The leaves of the tree represent outcomes of the experiment, and the set of all leaves represents the sample space.
Step 2: Define Events of Interest
A set of outcomes is called an event.
Step 3: Determine Outcome Probabilities
- Step 3a: Assign Edge Probabilities
- Step 3b: Compute Outcome Probabilities
Specifying the probability of each outcome amounts to defining a function that maps each outcome to a probability.
Step 4: Compute Event Probabilities
2 The Strange Die
There are arbitrarily large sets of dice which will beat each other in any desired pattern according to how many times the dice are rolled.
3 The Birthday Principle
If there are d days in a year and
2d−−√ people in a room, then the probability that two share a birthday is about1−1/e=0.632
4 Set Theory and Probability
- A countable sample space S is a nonempty countable set.
- An element
ω∈S is called an outcome. - A subset of S is called an event.
- A probability function on a sample space S is a total function.
PrS→R such that:Pr[ω]≥0for allω∈S and∑ω∈SPr[ω]=1
Probability Rules from Set Theory:
Sum Rule:
Pr[⋃n∈NEn]=∑n∈NPr[En]
Union Rule:
Pr[E1∪E2...∪En∪...]≤Pr[E1]+...+Pr[En]+...
Uniform Probability Spaces:
A finite probability space, S, is said to be uniform if
Reference
[1] Lehman E, Leighton F H, Meyer A R. Mathematics for Computer Science[J]. 2015.
- Unit 4-Lecture 1:Intro to Discrete Probability
- Introduction to Probability (5) Discrete random variable
- Lecture 1 - Intro to NLP and Deep Learning
- Unit 1-Lecture 4:Logical & Propositions
- Unit 4-Lecture 3: Independence
- Unit 4-Lecture 5: Expectation
- Unit 1-Lecture 8:Induction
- Unit 4-Lecure 2: Conditional Probability
- Unit 4-Lecture 4: Random Variable
- #Unit 3-Lecture 4:Repetitions & Binomial Theorem
- Unit 1-Lecture 1:证明简介
- Unit 1-Lecture 2:证明的方法
- Unit 1-Lecture 5:Quantifiers & Predicate Logic
- Unit 1-Lecture 6:Sets and Sequence
- Unit 1-Lecture 7:Binary Relation & Function
- Unit 1-Lecture 9:State Machine
- Unit 1-Lecture 10:Recursive Data Type
- Introduction to Probability (4) Counting
- CPU飙高调试
- Java基础知识(四)
- C++11系列-区间迭代
- 关于网页页头的“设为首页”和“联系我们”位置互换问题
- 数据结构与算法 -- 时间复杂度
- Unit 4-Lecture 1:Intro to Discrete Probability
- xml和json格式的比较
- C++11系列-常量表达式
- Ubuntu下,清屏等常用命令
- 堆栈、堆、方法区介绍
- 变革OTT产业,苏宁PPTV打造家庭互联网第一开放平台
- Android keyboardView字体样式修改
- Java基础
- Linux实战教学笔记21-Rsync数据同步工具