As stated by Laplace, Probability is common sense reduced to calculation.
|
|
- Madeleine Chase
- 5 years ago
- Views:
Transcription
1 Note: Hadouts DO NOT replace the book. I most cases, they oly provide a guidelie o topics ad a ituitive feel. The math details will be covered i class, so it is importat to atted class ad also you MUST read the book. 1 Motivatio ad Applicatios As stated by Laplace, Probability is commo sese reduced to calculatio. You eed to first lear the theory required to correctly do these calculatios. The examples that I solve ad those i the book ad the homeworks will provide a woderful practical motivatio as to why you eed to lear the theory. If you patietly grasp the basics, especially the first 4 chapters of BT, it will be the most useful thig you ve ever leart - whether you pursue a career i EE or CE or Ecoomics or Fiace or Maagemet ad also while you try to ivest i stocks or gamble i Las Vegas! Applicatios: commuicatios (telephoes, cell phoes, TV,...), sigal processig (image ad video deoisig, face recogitio, trackig movig objects from video,...), systems ad cotrol (operatig a airplae, fault detectio i a system,...), predictig reliability of a system (e.g. electrical system), resource allocatio, iteret protocols, o-egieerig applicatios (e.g. medicie: predictig how prevalet a disease is or well a drug works, weather forecastig, ecoomics). 2 Itroductio: Topics Covered (BT, ) What is Probability Set Theory Basics Probability Models Coditioal Probability Total Probability ad Bayes Rule Idepedece Coutig 3 What is Probability? Measured relative frequecy of occurrece of a evet. Example: toss a coi 100 times, measure frequecy of heads or compute probability of raiig o a particular day ad moth (usig past years data) Or subjective belief about how likely a evet is (whe do ot have data to estimate frequecy). Example: ay oe-time evet i history or how likely is it that a ew experimetal drug will work? Two types of problems eed to be solved 1
2 1. Specify the probability model or lear it (statistics). 2. Use the model to compute probability of differet evets. We will assume the model is give ad will focus o 2. i this course. 4 Set Theory Basics Set: ay collectio of objects (elemets of a set). Discrete sets Fiite umber of elemets, e.g. umbers of a die Or ifiite but coutable umber of elemets, e.g. set of itegers Cotiuous sets Caot cout the umber of elemets, e.g. all real umbers betwee 0 ad 1. Uiverse (deoted Ω): cosists of all possible elemets that could be of iterest. I case of radom experimets, it is the set of all possible outcomes. Example: for coi tosses, Ω = {H, T }. Empty set (deoted φ): a set with o elemets Subset: A B: if every elemet of A also belogs to B. Strict subset: A B: if every elemet of A also belogs to B ad B has more elemets tha A. Belogs:, Does ot belog: / Complemet: A or A c, Uio: A B, Itersectio: A B A {x Ω x / A} A B {x x A, or x B}, x Ω is assumed. A B {x x A, ad x B} Visualize usig Ve diagrams (see book) Disjoit sets: A ad B are disjoit if A B = φ (empty), i.e. they have o commo elemets. DeMorga s Laws (A B) = A B (1) (A B) = A B (2) Proofs: Need to show that every elemet of LHS (left had side) is also a elemet of RHS (right had side) AND vice versa. Details i class. Read sectio o Algebra of Sets, pg 5 2
3 5 Probabilistic models There is a uderlyig process called experimet that produces exactly ONE outcome. A probabilistic model: cosists of a sample space ad a probability law Sample space (deoted Ω): set of all possible outcomes of a experimet Evet: ay subset of the sample space Probability Law: assigs a probability to every set A of possible outcomes (evet) Choice of sample space (or uiverse): every elemet should be distict ad mutually exclusive (disjoit); ad the space should be collectively exhaustive (every possible outcome of a experimet should be icluded). Probability Axioms: 1. Noegativity. P(A) 0 for every evet A. 2. Additivity. If A ad B are two disjoit evets, the P(A B) = P(A) + P(B) (also exteds to ay coutable umber of disjoit evets). 3. Normalizatio. Probability of the etire sample space, P(Ω) = 1. Probability of the empty set, P(φ) = 0 (follows from Axioms 2 & 3). Sequetial models, e.g. three coi tosses or two sequetial rolls of a die. Tree-based descriptio: see Fig. 1.3 Discrete probability law: sample space cosists of a fiite umber of possible outcomes, law specified by probability of sigle elemet evets. Example: for a fair coi toss, Ω = {H, T }, P(H) = P(T) = 1/2 Discrete uiform law for ay evet A: P(A) = umber of elemets i A Cotiuous probability law: e.g. Ω = [0, 1]: probability of ay sigle elemet evet is zero, eed to talk of probability of a subiterval, [a, b] of [0, 1]. Example 1.4, 1.5 Properties of probability laws 1. If A B, the P(A) P(B) 2. P(A B) = P(A) + P(B) P(A B) 3. P(A B) P(A) + P(B) 4. P(A B C) = P(A) + P(A B) + P(A B C) 5. Note: book uses A c for A (complemet of set A). 6. Proofs: i book. Some will be doe i class. 7. Visualize: see Ve diagrams i book. 3
4 6 Coditioal Probability Give that we kow that a evet B has occurred, what is the probability that evet A occurred? Deoted by P(A B). Example: Roll of a 6-sided die. Give that the outcome is eve, what is the probability of a 6? Aswer: 1/3 Whe umber of outcomes is fiite ad all are equally likely, P(A B) = umber of elemets of A B umber of elemets of B (3) I geeral, P(A B) P(A B) P(B) (4) P(A B) is a probability law (satisfies axioms) o the uiverse B. Exercise: show this. Examples/applicatios Example 1.7, 1.8, 1.11 Costruct sequetial models: P(A B) = P(B)P(A B). Example: Radar detectio (Example 1.9). What is the probability of the aircraft ot preset ad radar registers it (false alarm)? See Fig. 1.9: Tree based sequetial descriptio 7 Total Probability ad Bayes Rule Total Probability Theorem: Let A 1,...A be disjoit evets which form a partitio of the sample space ( i=1 A i = Ω). The for ay evet B, Visualizatio ad proof: see Fig Example 1.13, 1.15 P(B) = P(A 1 B) +... P(A B) = P(A 1 )P(B A 1 ) +... P(A )P(B A ) (5) Bayes rule: Let A 1,...A be disjoit evets which form a partitio of the sample space. The for ay evet B, s.t. P(B) > 0, we have P(A i B) = P(A i)p(b A i ) P(B) Iferece usig Bayes rule = P(A i )P(B A i ) P(A 1 )P(B A 1 ) +... P(A )P(B A ) (6) There are multiple causes A 1, A 2,..A that result i a certai effect B. Give that we observe the effect B, what is the probability that the cause was A i? Aswer: use Bayes rule. See Fig Radar detectio: what is the probability of the aircraft beig preset give that the radar registers it? Example 1.16 False positive puzzle, Example 1.18: very iterestig! 4
5 8 Idepedece P(A B) = P(A) ad so P(A B) = P(B)P(A): the fact that B has occurred gives o iformatio about the probability of occurrece of A. Example: A= head i first coi toss, B = head i secod coi toss. Idepedece : DIFFERENT from mutually exclusive (disjoit) Evets A ad B are disjoit if P(A B) = 0: caot be idepedet if P(A) > 0 ad P(B) > 0. Example: A = head i a coi toss, B = tail i a coi toss Idepedece: a cocept for evets i a sequece. Idepedet evets with P(A) > 0, P(B) > 0 caot be disjoit Coditioal idepedece ** Idepedece of a collectio of evets P( i S A i ) = Π i S P(A i ) for every subset S of {1, 2,..} Reliability aalysis of complex systems: idepedece assumptio ofte simplifies calculatios Aalyze Fig. 1.15: what is P(system fails) of the system A B? Let p i = probability of success of compoet i. m compoets i series: P(system fails) = 1 p 1 p 2... p m (succeeds if all compoets succeed). m compoets i parallel: P(system fails) = (1 p 1 )...(1 p m ) (fails if all the compoets fail). Idepedet Beroulli trials ad Biomial probabilities A Beroulli trial: a coi toss (or ay experimet with two possible outcomes, e.g. it rais or does ot rai, bit values) Idepedet Beroulli trials: sequece of idepedet coi tosses Biomial: Give idepedet coi tosses,what is the probability of k heads (deoted p(k))? probability of ay oe sequece with k heads is p k (1 p) k umber of such sequeces (from coutig argumets): ( ) k p(k) = ( ) k p k (1 p) k, where ( ) k! ( k)!k! Applicatio: what is the probability that more tha c customers eed a iteret coectio at a give time? We kow that at a give time, the probability that ay oe customer eeds coectio is p. Aswer: p(k) k=c+1 5
6 9 Coutig Needed i may situatios. Two examples are: 1. Sample space has a fiite umber of equally likely outcomes (discrete uiform), compute probability of ay evet A. 2. Or compute the probability of a evet A which cosists of a fiite umber of equally likely outcomes each with probability p, e.g. probability of k heads i coi tosses. Coutig priciple (See Fig. 1.17): Cosider a process cosistig of r stages. If at stage 1, there are 1 possibilities, at stage 2, 2 possibilities ad so o, the the total umber of possibilities = r. Example 1.26 (umber of possible telephoe umbers) Coutig priciple applies eve whe secod stage depeds o the first stage ad so o, Ex (o. of words with 4 distict letters) Applicatios: k-permutatios. distict objects, how may differet ways ca we pick k objects ad arrage them i a sequece? Use coutig priciple: choose first object i possible ways, secod oe i 1 ways ad so o. Total o. of ways: ( 1)...( k + 1) =! ( k)! If k =, the total o. of ways =! Example 1.28, 1.29 Applicatios: k-combiatios. Choice of k elemets out of a -elemet set without regard to order. Most commo example: There are people, how may differet ways ca we form a committee of k people? Here order of choosig the k members is ot importat. Deote aswer by ( ) k Note that selectig a k-permutatio is the same as first selectig a k-combiatio ad! the orderig the elemets (i k!) differet ways, i.e. ( k)! = ( ) k k! Thus ( ) k =! k!( k)!. How will you relate this to the biomial coefficiet (umber of ways to get k heads out of tosses)? Toss umber j = perso j, a head i a toss = the perso (toss umber) is i committee Applicatios: k-partitios. ** A combiatio is a partitio of a set ito two parts Partitio: give a -elemet set, cosider its partitio ito r subsets of size 1, 2,..., r where r =. Use coutig priciple ad k-combiatios result. Form the first subset. Choose 1 elemets out of : ( ) 1 ways. Form secod subset. Choose 2 elemets out of 1 available elemets: ( 1 ) 2 ad so o. Total umber of ways to form the partitio: ( )( 1 ) ( ( r 1 ) ) r =! 1! 2!... r! 6
What is Probability?
Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t kow what will happe o ay oe experimet, but has a log ru order. The cocept of probability
More informationSets and Probabilistic Models
ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2
More informationSets and Probabilistic Models
ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal iversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationCS 330 Discussion - Probability
CS 330 Discussio - Probability March 24 2017 1 Fudametals of Probability 11 Radom Variables ad Evets A radom variable X is oe whose value is o-determiistic For example, suppose we flip a coi ad set X =
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationChapter 1. Probability
Chapter. Probability. Set defiitios 2. Set operatios 3. Probability itroduced through sets ad relative frequecy 4. Joit ad coditioal probability 5. Idepedet evets 6. Combied experimets 7. Beroulli trials
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter & Teachig Material.
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter 2 & Teachig
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationCSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo
Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationIntroduction to Probability. Ariel Yadin. Lecture 7
Itroductio to Probability Ariel Yadi Lecture 7 1. Idepedece Revisited 1.1. Some remiders. Let (Ω, F, P) be a probability space. Give a collectio of subsets K F, recall that the σ-algebra geerated by K,
More informationIntroduction to Probability. Ariel Yadin. Lecture 2
Itroductio to Probability Ariel Yadi Lecture 2 1. Discrete Probability Spaces Discrete probability spaces are those for which the sample space is coutable. We have already see that i this case we ca take
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationTopic 8: Expected Values
Topic 8: Jue 6, 20 The simplest summary of quatitative data is the sample mea. Give a radom variable, the correspodig cocept is called the distributioal mea, the epectatio or the epected value. We begi
More informationPb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2
Axioms for Probability Logic Pb ( a ) = measure of the plausibility of propositio b coditioal o the iformatio stated i propositio a For propositios a, b ad c: P: Pb ( a) 0 P2: Pb ( a& b ) = P3: Pb ( a)
More informationTopic 5: Basics of Probability
Topic 5: Jue 1, 2011 1 Itroductio Mathematical structures lie Euclidea geometry or algebraic fields are defied by a set of axioms. Mathematical reality is the developed through the itroductio of cocepts
More informationChapter 1 : Combinatorial Analysis
STAT/MATH 394 A - PROBABILITY I UW Autum Quarter 205 Néhémy Lim Chapter : Combiatorial Aalysis A major brach of combiatorial aalysis called eumerative combiatorics cosists of studyig methods for coutig
More informationThe Binomial Theorem
The Biomial Theorem Lecture 47 Sectio 9.7 Robb T. Koether Hampde-Sydey College Fri, Apr 8, 204 Robb T. Koether (Hampde-Sydey College The Biomial Theorem Fri, Apr 8, 204 / 25 Combiatios 2 Pascal s Triagle
More informationLecture 1 Probability and Statistics
Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationUNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY
UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY Structure 2.1 Itroductio Objectives 2.2 Relative Frequecy Approach ad Statistical Probability 2. Problems Based o Relative Frequecy 2.4 Subjective Approach
More information(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.
SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify
More information4. Basic probability theory
Cotets Basic cocepts Discrete radom variables Discrete distributios (br distributios) Cotiuous radom variables Cotiuous distributios (time distributios) Other radom variables Lect04.ppt S-38.45 - Itroductio
More informationPROBABILITY LOGIC: Part 2
James L Bec 2 July 2005 PROBABILITY LOGIC: Part 2 Axioms for Probability Logic Based o geeral cosideratios, we derived axioms for: Pb ( a ) = measure of the plausibility of propositio b coditioal o the
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationDiscrete probability distributions
Discrete probability distributios I the chapter o probability we used the classical method to calculate the probability of various values of a radom variable. I some cases, however, we may be able to develop
More informationLecture 1 Probability and Statistics
Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationHere are some examples of algebras: F α = A(G). Also, if A, B A(G) then A, B F α. F α = A(G). In other words, A(G)
MATH 529 Probability Axioms Here we shall use the geeral axioms of a probability measure to derive several importat results ivolvig probabilities of uios ad itersectios. Some more advaced results will
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationf X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36
Probability Distributios A Example With Dice If X is a radom variable o sample space S, the the probability that X takes o the value c is Similarly, Pr(X = c) = Pr({s S X(s) = c}) Pr(X c) = Pr({s S X(s)
More informationSTA 348 Introduction to Stochastic Processes. Lecture 1
STA 348 Itroductio to Stochastic Processes Lecture 1 1 Admiis-trivia Istructor: Sotirios Damouras Proouced Sho-tee-ree-os or Sam Cotact Ifo: email: sotirios.damouras@utoroto.ca Office hours: SE/DV 4062,
More informationIntroduction to Probability and Statistics Twelfth Edition
Itroductio to Probability ad Statistics Twelfth Editio Robert J. Beaver Barbara M. Beaver William Medehall Presetatio desiged ad writte by: Barbara M. Beaver Itroductio to Probability ad Statistics Twelfth
More informationSection 5.1 The Basics of Counting
1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationf X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36
Probability Distributios A Example With Dice If X is a radom variable o sample space S, the the probablity that X takes o the value c is Similarly, Pr(X = c) = Pr({s S X(s) = c} Pr(X c) = Pr({s S X(s)
More informationWhat is Probability?
Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t ow what will happe o ay oe experimet, but has a log ru order. The cocept of probability
More information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
More informationn outcome is (+1,+1, 1,..., 1). Let the r.v. X denote our position (relative to our starting point 0) after n moves. Thus X = X 1 + X 2 + +X n,
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 9 Variace Questio: At each time step, I flip a fair coi. If it comes up Heads, I walk oe step to the right; if it comes up Tails, I walk oe
More informationMassachusetts Institute of Technology
Solutios to Quiz : Sprig 006 Problem : Each of the followig statemets is either True or False. There will be o partial credit give for the True False questios, thus ay explaatios will ot be graded. Please
More informationREVIEW FOR CHAPTER 1
REVIEW FOR CHAPTER 1 A short summary: I this chapter you helped develop some basic coutig priciples. I particular, the uses of ordered pairs (The Product Priciple), fuctios, ad set partitios (The Sum Priciple)
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationUncertainty. Variables. assigns to each sentence numerical degree of belief between 0 and 1. uncertainty
Bayes Classificatio Ucertaity & robability Baye's rule Choosig Hypotheses- Maximum a posteriori Maximum Likelihood - Baye's cocept learig Maximum Likelihood of real valued fuctio Bayes optimal Classifier
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 15
CS 70 Discrete Mathematics ad Probability Theory Summer 2014 James Cook Note 15 Some Importat Distributios I this ote we will itroduce three importat probability distributios that are widely used to model
More informationProbability and statistics: basic terms
Probability ad statistics: basic terms M. Veeraraghava August 203 A radom variable is a rule that assigs a umerical value to each possible outcome of a experimet. Outcomes of a experimet form the sample
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More information15-780: Graduate Artificial Intelligence. Density estimation
5-780: Graduate Artificial Itelligece Desity estimatio Coditioal Probability Tables (CPT) But where do we get them? P(B)=.05 B P(E)=. E P(A B,E) )=.95 P(A B, E) =.85 P(A B,E) )=.5 P(A B, E) =.05 A P(J
More informationDiscrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15
CS 70 Discrete Mathematics ad Probability Theory Sprig 2012 Alistair Siclair Note 15 Some Importat Distributios The first importat distributio we leared about i the last Lecture Note is the biomial distributio
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationBasics of Probability Theory (for Theory of Computation courses)
Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.
More informationSkip 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
Presetatio for use with the textbook, Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Skip Lists S 3 15 15 23 10 15 23 36 Skip Lists 1 What is a Skip List A skip list for
More information0, otherwise. EX = E(X 1 + X n ) = EX j = np and. Var(X j ) = np(1 p). Var(X) = Var(X X n ) =
PROBABILITY MODELS 35 10. Discrete probability distributios I this sectio, we discuss several well-ow discrete probability distributios ad study some of their properties. Some of these distributios, lie
More informationProbability and Statistics
robability ad Statistics rof. Zheg Zheg Radom Variable A fiite sigle valued fuctio.) that maps the set of all eperimetal outcomes ito the set of real umbers R is a r.v., if the set ) is a evet F ) for
More informationThe Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.
Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure
More informationApproximations and more PMFs and PDFs
Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.
More informationDiscrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions
CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio
More informationIntroduction to probability Stochastic Process Queuing systems. TELE4642: Week2
Itroductio to probability Stochastic Process Queuig systems TELE4642: Week2 Overview Refresher: Probability theory Termiology, defiitio Coditioal probability, idepedece Radom variables ad distributios
More informationCS 171 Lecture Outline October 09, 2008
CS 171 Lecture Outlie October 09, 2008 The followig theorem comes very hady whe calculatig the expectatio of a radom variable that takes o o-egative iteger values. Theorem: Let Y be a radom variable that
More informationLecture 2: Monte Carlo Simulation
STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?
More informationLecture 5: April 17, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 5: April 7, 203 Scribe: Somaye Hashemifar Cheroff bouds recap We recall the Cheroff/Hoeffdig bouds we derived i the last lecture idepedet
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationStatisticians use the word population to refer the total number of (potential) observations under consideration
6 Samplig Distributios Statisticias use the word populatio to refer the total umber of (potetial) observatios uder cosideratio The populatio is just the set of all possible outcomes i our sample space
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationPermutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination
Discrete Mathematic Chapter 3: C outig 3. The Basics of Coutig 3.3 Permutatios & Combiatios 3.5 Geeralized Permutatios & Combiatios 3.6 Geeratig Permutatios & Combiatios Dr Patrick Cha School of Computer
More informationLaw of the sum of Bernoulli random variables
Law of the sum of Beroulli radom variables Nicolas Chevallier Uiversité de Haute Alsace, 4, rue des frères Lumière 68093 Mulhouse icolas.chevallier@uha.fr December 006 Abstract Let be the set of all possible
More informationCS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities
CS161 Hadout 05 Summer 2013 July 10, 2013 Mathematical Terms ad Idetities Thaks to Ady Nguye ad Julie Tibshirai for their advice o this hadout. This hadout covers mathematical otatio ad idetities that
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationExpectation and Variance of a random variable
Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationChapter 6 Sampling Distributions
Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19
CS 70 Discrete Mathematics ad Probability Theory Sprig 2016 Rao ad Walrad Note 19 Some Importat Distributios Recall our basic probabilistic experimet of tossig a biased coi times. This is a very simple
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationPutnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)
Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More informationUC Berkeley Department of Electrical Engineering and Computer Sciences. EE126: Probability and Random Processes
UC Berkeley Departmet of Electrical Egieerig ad Computer Scieces EE26: Probability ad Radom Processes Problem Set Fall 208 Issued: Thursday, August 23, 208 Due: Wedesday, August 29, 207 Problem. (i Sho
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Sprig 2018 (istructor Val Tae) Lecture 5 Thursday, Jauary 25 COUNTING We cotiue studyig how to use combiatios ad what are their properties. Example 5.1 How may 8-letter strigs ca be costructed
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationMAS275 Probability Modelling
MAS275 Probability Modellig 6 Poisso processes 6.1 Itroductio Poisso processes are a particularly importat topic i probability theory. The oe-dimesioal Poisso process, which most of this sectio will be
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More information3.1 Counting Principles
3.1 Coutig Priciples Goal: Cout the umber of objects i a set. Notatio: Whe S is a set, S deotes the umber of objects i the set. This is also called S s cardiality. Additio Priciple: Whe you wat to cout
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationEmpirical Distributions
Empirical Distributios A empirical distributio is oe for which each possible evet is assiged a probability derived from experimetal observatio. It is assumed that the evets are idepedet ad the sum of the
More information