Probability Refresher and Cycle Analysis. Spring 2018 CS 438 Staff, University of Illinois 1

Size: px
Start display at page:

Download "Probability Refresher and Cycle Analysis. Spring 2018 CS 438 Staff, University of Illinois 1"

Transcription

1 Probability Refresher ad Cycle Aalysis Sprig 2018 CS 438 Staff, Uiversity of Illiois 1

2 A Quick Probability Refresher A radom variable, X, ca take o a umber of differet possible values Example: the umber of pigeos o the widowsill outside is a radom variable with possible values 1,2,3, Each time we observe (or sample) the radom variable, it may take o a differet value Sprig 2018 CS 438 Staff, Uiversity of Illiois 2

3 A Quick Probability Refresher A radom variable takes o each of these values with a specified probability Example: X = {0, 1, 2, 3, 4} P[X=0] =.1, P[X=1] =.2, P[X=2] =.4, P[X=3] =.1, P[X=4] =.2 The sum of the probabilities of all values equals 1 S all values P[X=value] = 1 Sprig 2018 CS 438 Staff, Uiversity of Illiois 3

4 A Quick Probability Refresher Example Suppose we throw two dice ad the radom variable, X, is the sum of the two dice Possible values of X are {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12} P[X=2] = P[X=12] = 1/36 P[X=3] = P[X=11] = 2/36 P[X=4] = P[X=10] = 3/36 P[X=5] = P[X=9] = 4/36 P[X=6] = P[X=8] = 5/36 P[X=7] = 6/36 Note: 12 S i=2 P[X=i] = 1 Sprig 2018 CS 438 Staff, Uiversity of Illiois 4

5 A Quick Probability Refresher Expected Value Ca be thought of a log term average of observig the radom variable a large umber of times E[X] = x = S All possible values of x Value * P[X = value] Example: dice - E[X] = 2*1/36 + 3*2/36 + 4*3/36 + 5*4/36 + 6*5/36 + 7*6/36 + 8*5/36 + 9*4/ *3/ *2/ *1/36 Sprig 2018 CS 438 Staff, Uiversity of Illiois 7

6 Probability Example Basic probability otios Two useful rules Probabilities of all possible evets sum to 1 Probability of idepedet evets Product of probabilities of evets e.g., probability of two cois comig up heads = 1/2 x 1/2 = 1/4 Calculatig averages/expected values Fuctio f Multiply f by probability for each possible evet Sum over all evets Sprig 2018 CS 438 Staff, Uiversity of Illiois 10

7 Probability Example - Problem Give a bag with N balls 1 blue ball N - 1 white balls Algorithm pick a ball if blue, you wi else retur to bag repeat N times Questio What is your chace of wiig for large N? Sprig 2018 CS 438 Staff, Uiversity of Illiois 11

8 Probability Example - Solutio Ca write as a sum Chace of fidig blue o first try = 1/N O secod try = [(N-1)/N] * (1/N) Etc. Istead, write 1 - (chace of losig) Parethesized term Product of N factors Each factor = (N-1)/N 1 - [(N - 1)/N] N Sprig 2018 CS 438 Staff, Uiversity of Illiois 12

9 Probability Example - Solutio For N = 2, 1/2 first is white 1/2 secod is white 1/4 both are white 3/4 chace to wi = 1 - (1/2) 2 For N=3, 2/3 first is white 2/3 secod is white 2/3 third is white 8/27 all three are white 19/27 chace to wi = 1 - (2/3) 3 (< 3/4) Sprig 2018 CS 438 Staff, Uiversity of Illiois 13

10 Probability Example - Solutio N=4 probability of wi = 68% N=5 probability of wi = 67% N=8 probability of wi = 66% large N? 0? lim N æ N -1ö ç è N ø N Sprig 2018 CS 438 Staff, Uiversity of Illiois 14

11 Fu Example Flip a coi repeatedly. Two heads i a row scores 1 poit. Scorig pairs may ot overlap (e.g., three heads i a row does ot score 2 poits). O average, how may poits do you score per flip? Sprig 2018 CS 438 Staff, Uiversity of Illiois 15

12 A Differet Example What fractio of time (o average) is spet i state E? S A C B D E Sprig 2018 CS 438 Staff, Uiversity of Illiois 16

13 Cycle Aalysis Start with a discrete Markov process Trasitios happe periodically (every Dt) Probabilities idepedet of past/future behavior Form all possible cyclic sequeces (cycles) Pick a start state List all cycles from that state Calculate probability per cycle Calculate average cycle legth Ca calculate expected values of cycle-depedet properties with average legth ad cycle probabilities Sprig 2018 CS 438 Staff, Uiversity of Illiois 17

14 Example cycle probability S A C 0.25 B 0.75 D E Sprig 2018 CS 438 Staff, Uiversity of Illiois 18

15 Example cycle ABS CBS CDES probability = = 0.5 = = = = S A S A B B S A C 0.25 B 0.75 D E average cycle legth = = ABS CBS CDES Sprig 2018 CS 438 Staff, Uiversity of Illiois 19

16 Example Amout of time spet i E whe i cycle CDES average fractio of time spet i E S = periods/cycle dividig by average legth = / = A C 0.25 B 0.75 D Probability of cycle CDES E Sprig 2018 CS 438 Staff, Uiversity of Illiois 20

17 Fu Example Flip a coi repeatedly. Two heads i a row scores 1 poit. Scorig pairs may ot overlap (e.g., three heads i a row does ot score 2 poits). O average, how may poits do you score per flip? Sprig 2018 CS 438 Staff, Uiversity of Illiois 21

18 Fu Example cycle probability T 1/2 HT 1/4 HH 1/4 average cycle legth average score per cycle average score per flip T H (score) H oe 1 T Sprig 2018 CS 438 Staff, Uiversity of Illiois 22

19 Fu Example cycle probability T 1/2 HT 1/4 HH 1/4 average cycle legth average score per cycle average score per flip T H (score) H oe 1 T = 1/2 + 1/2 + 1/2 = 3/2 flips = 1/4 poits = (1/4) / (3/2) = 1/6 pts/flip Sprig 2018 CS 438 Staff, Uiversity of Illiois 23

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

Randomized 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 information

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

Problems 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 information

Discrete Mathematics and Probability Theory Fall 2016 Walrand Probability: An Overview

Discrete Mathematics and Probability Theory Fall 2016 Walrand Probability: An Overview CS 70 Discrete Mathematics ad Probability Theory Fall 2016 Walrad Probability: A Overview Probability is a fasciatig theory. It provides a precise, clea, ad useful model of ucertaity. The successes of

More information

Homework 5 Solutions

Homework 5 Solutions Homework 5 Solutios p329 # 12 No. To estimate the chace you eed the expected value ad stadard error. To do get the expected value you eed the average of the box ad to get the stadard error you eed the

More information

Final Review for MATH 3510

Final Review for MATH 3510 Fial Review for MATH 50 Calculatio 5 Give a fairly simple probability mass fuctio or probability desity fuctio of a radom variable, you should be able to compute the expected value ad variace of the variable

More information

Probability theory and mathematical statistics:

Probability theory and mathematical statistics: 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

More information

Lecture 2 February 8, 2016

Lecture 2 February 8, 2016 MIT 6.854/8.45: Advaced Algorithms Sprig 206 Prof. Akur Moitra Lecture 2 February 8, 206 Scribe: Calvi Huag, Lih V. Nguye I this lecture, we aalyze the problem of schedulig equal size tasks arrivig olie

More information

Lecture 2: April 3, 2013

Lecture 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 information

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):

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): CS 70 Secod Midter 7 April 2011 NAME (1 pt): SID (1 pt): TA (1 pt): Nae of Neighbor to your left (1 pt): Nae of Neighbor to your right (1 pt): Istructios: This is a closed book, closed calculator, closed

More information

Properties of Joints Chris Piech CS109, Stanford University

Properties of Joints Chris Piech CS109, Stanford University Properties of Joits Chris Piech CS09, Staford Uiversity Titaic Probability 7% of passegers were from the Ottoma Empire Biometric Keystroes Altruism? Scores for a stadardized test that studets i Polad

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

More information

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)

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) Coditioal robability Give a evet M with o zero probability ad the coditio ( M ) > 0, ( / M ) ( M ) ( M ) Idepedet Evets () ( ) ( ) () ( ) ( ) ( ) Examples ) Let items be chose at radom from a lot cotaiig

More information

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

Discrete 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 information

6.041/6.431 Spring 2009 Final Exam Thursday, May 21, 1:30-4:30 PM.

6.041/6.431 Spring 2009 Final Exam Thursday, May 21, 1:30-4:30 PM. 6.041/6.431 Sprig 2009 Fial Exam Thursday, May 21, 1:30-4:30 PM. Name: Recitatio Istructor: Questio Part Score Out of 0 2 1 all 18 2 all 24 3 a 4 b 4 c 4 4 a 6 b 6 c 6 5 a 6 b 6 6 a 4 b 4 c 4 d 5 e 5 7

More information

11. Hash Tables. m is not too large. Many applications require a dynamic set that supports only the directory operations INSERT, SEARCH and DELETE.

11. Hash Tables. m is not too large. Many applications require a dynamic set that supports only the directory operations INSERT, SEARCH and DELETE. 11. Hash Tables May applicatios require a dyamic set that supports oly the directory operatios INSERT, SEARCH ad DELETE. A hash table is a geeralizatio of the simpler otio of a ordiary array. Directly

More information

HOMEWORK I: PREREQUISITES FROM MATH 727

HOMEWORK I: PREREQUISITES FROM MATH 727 HOMEWORK I: PREREQUISITES FROM MATH 727 Questio. Let X, X 2,... be idepedet expoetial radom variables with mea µ. (a) Show that for Z +, we have EX µ!. (b) Show that almost surely, X + + X (c) Fid the

More information

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

( ) = 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 information

kp(x = k) = λe λ λ k 1 (k 1)! = λe λ r k e λλk k! = e λ g(r) = e λ e rλ = e λ(r 1) g (1) = E[X] = λ g(r) = kr k 1 e λλk k! = E[X]

kp(x = k) = λe λ λ k 1 (k 1)! = λe λ r k e λλk k! = e λ g(r) = e λ e rλ = e λ(r 1) g (1) = E[X] = λ g(r) = kr k 1 e λλk k! = E[X] Problem 1: (8 poits) Let X be a Poisso radom variable of parameter λ. 1. ( poits) Compute E[X]. E[X] = = kp(x = k) = k=1 λe λ λ k 1 (k 1)! = λe λ ke λλk λ k k! k =0 2. ( poits) Compute g(r) = E [ r X],

More information

Problem Set 2 Solutions

Problem 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 information

Lecture Chapter 6: Convergence of Random Sequences

Lecture Chapter 6: Convergence of Random Sequences ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite

More information

Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2

Introduction 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 information

CS 330 Discussion - Probability

CS 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 information

Lecture 2: Probability, Random Variables and Probability Distributions. GENOME 560, Spring 2017 Doug Fowler, GS

Lecture 2: Probability, Random Variables and Probability Distributions. GENOME 560, Spring 2017 Doug Fowler, GS Lecture 2: Probability, Radom Variables ad Probability Distributios GENOME 560, Sprig 2017 Doug Fowler, GS (dfowler@uw.edu) 1 Course Aoucemets Problem Set 1 will be posted Due ext Thursday before class

More information

Half Life Worksheet Extra Practice

Half Life Worksheet Extra Practice Half Life Worksheet Extra Practice ) Fluorie- has a half life of approximately 5 secods. What fractio of the origial uclei would remai after miute? ) Iodie-3 has a half life of 8 days. What fractio of

More information

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

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

1. Hilbert s Grand Hotel. The Hilbert s Grand Hotel has infinite many rooms numbered 1, 2, 3, 4

1. Hilbert s Grand Hotel. The Hilbert s Grand Hotel has infinite many rooms numbered 1, 2, 3, 4 . Hilbert s Grad Hotel The Hilbert s Grad Hotel has ifiite may rooms umbered,,,.. Situatio. The Hotel is full ad a ew guest arrives. Ca the mager accommodate the ew guest? - Yes, he ca. There is a simple

More information

Lecture 2: Probability, Random Variables and Probability Distributions. GENOME 560, Spring 2015 Doug Fowler, GS

Lecture 2: Probability, Random Variables and Probability Distributions. GENOME 560, Spring 2015 Doug Fowler, GS Lecture 2: Probability, Radom Variables ad Probability Distributios GENOME 560, Sprig 2015 Doug Fowler, GS (dfowler@uw.edu) 1 Course Aoucemets Problem Set 1 will be posted Due ext Thursday before class

More information

Lecture 5: April 17, 2013

Lecture 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 information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15

Discrete 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 information

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n.

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n. Radom Walks ad Browia Motio Tel Aviv Uiversity Sprig 20 Lecture date: Mar 2, 20 Lecture 4 Istructor: Ro Peled Scribe: Lira Rotem This lecture deals primarily with recurrece for geeral radom walks. We preset

More information

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014 Iteger Divisio Algorithm ad Cogruece Iteger Trial divisio,,, ad with itegers mod Iverses mod Multiplicatio ad GCD Iteger Christopher Koch 1 1 Departmet of Computer Sciece ad Egieerig CSE489/589 Algorithms

More information

UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY

UNIT 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

Hypothesis Testing. Evaluation of Performance of Learned h. Issues. Trade-off Between Bias and Variance

Hypothesis Testing. Evaluation of Performance of Learned h. Issues. Trade-off Between Bias and Variance Hypothesis Testig Empirically evaluatig accuracy of hypotheses: importat activity i ML. Three questios: Give observed accuracy over a sample set, how well does this estimate apply over additioal samples?

More information

The Random Walk For Dummies

The 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 information

Math 155 (Lecture 3)

Math 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 information

CS161 Handout 05 Summer 2013 July 10, 2013 Mathematical Terms and Identities

CS161 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 information

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

f 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 information

n 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,

n 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 information

Topic 8: Expected Values

Topic 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 information

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

Discrete 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 information

BHW #13 1/ Cooper. ENGR 323 Probabilistic Analysis Beautiful Homework # 13

BHW #13 1/ Cooper. ENGR 323 Probabilistic Analysis Beautiful Homework # 13 BHW # /5 ENGR Probabilistic Aalysis Beautiful Homework # Three differet roads feed ito a particular freeway etrace. Suppose that durig a fixed time period, the umber of cars comig from each road oto the

More information

Random Variables, Sampling and Estimation

Random 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 information

Some discrete distribution

Some discrete distribution Some discrete distributio p. 2-13 Defiitio (Beroulli distributio B(p)) A Beroulli distributio takes o oly two values: 0 ad 1, with probabilities 1 p ad p, respectively. pmf: p() = p (1 p) (1 ), if =0or

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS Jauary 25, 207 INTRODUCTION TO MATHEMATICAL STATISTICS Abstract. A basic itroductio to statistics assumig kowledge of probability theory.. Probability I a typical udergraduate problem i probability, we

More information

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15

Discrete 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 information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Final Solutions

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Final Solutions CS 70 Discrete Mathematics ad Probability Theory Fall 2016 Seshia ad Walrad Fial Solutios CS 70, Fall 2016, Fial Solutios 1 1 TRUE or FALSE?: 2x8=16 poits Clearly put your aswers i the aswer box o the

More information

Mathematical Statistics - MS

Mathematical Statistics - MS Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios

More information

CS166 Handout 02 Spring 2018 April 3, 2018 Mathematical Terms and Identities

CS166 Handout 02 Spring 2018 April 3, 2018 Mathematical Terms and Identities CS166 Hadout 02 Sprig 2018 April 3, 2018 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 may

More information

AP Statistics Review Ch. 8

AP Statistics Review Ch. 8 AP Statistics Review Ch. 8 Name 1. Each figure below displays the samplig distributio of a statistic used to estimate a parameter. The true value of the populatio parameter is marked o each samplig distributio.

More information

Simulation. Two Rule For Inverting A Distribution Function

Simulation. Two Rule For Inverting A Distribution Function Simulatio Two Rule For Ivertig A Distributio Fuctio Rule 1. If F(x) = u is costat o a iterval [x 1, x 2 ), the the uiform value u is mapped oto x 2 through the iversio process. Rule 2. If there is a jump

More information

CS 171 Lecture Outline October 09, 2008

CS 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 information

Chemical Engineering 160/260 Polymer Science and Engineering. Lecture 7 - Statistics of Chain Copolymerization January 31, 2001

Chemical Engineering 160/260 Polymer Science and Engineering. Lecture 7 - Statistics of Chain Copolymerization January 31, 2001 Chemical Egieerig 60/60 Polymer Sciece ad Egieerig Lecture 7 - Statistics of Chai Copolymerizatio Jauary 3, 00 Objectives! To determie the compositioal relatioships betwee lower ad higher order sequeces

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall Midterm Solutions

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall Midterm Solutions MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/5.070J Fall 0 Midterm Solutios Problem Suppose a radom variable X is such that P(X > ) = 0 ad P(X > E) > 0 for every E > 0. Recall that the large deviatios rate

More information

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

STAT 516 Answers Homework 6 April 2, 2008 Solutions by Mark Daniel Ward PROBLEMS STAT 56 Aswers Homework 6 April 2, 28 Solutios by Mark Daiel Ward PROBLEMS Chapter 6 Problems 2a. The mass p(, correspods to either o the irst two balls beig white, so p(, 8 7 4/39. The mass p(, correspods

More information

x c the remainder is Pc ().

x c the remainder is Pc (). Algebra, Polyomial ad Ratioal Fuctios Page 1 K.Paulk Notes Chapter 3, Sectio 3.1 to 3.4 Summary Sectio Theorem Notes 3.1 Zeros of a Fuctio Set the fuctio to zero ad solve for x. The fuctio is zero at these

More information

Average Case Complexity

Average Case Complexity Probability Applicatios Aalysis of Algorithms Average Case Complexity Mote Carlo Methods Spam Filters Probability Distributio Basic Cocepts S = {a 1,, a } = fiite set of outcomes = sample space p :S [0,1]

More information

Test of Statistics - Prof. M. Romanazzi

Test of Statistics - Prof. M. Romanazzi 1 Uiversità di Veezia - Corso di Laurea Ecoomics & Maagemet Test of Statistics - Prof. M. Romaazzi 19 Jauary, 2011 Full Name Matricola Total (omial) score: 30/30 (2 scores for each questio). Pass score:

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms Desig ad Aalysis of Algorithms Probabilistic aalysis ad Radomized algorithms Referece: CLRS Chapter 5 Topics: Hirig problem Idicatio radom variables Radomized algorithms Huo Hogwei 1 The hirig problem

More information

Stat 400: Georgios Fellouris Homework 5 Due: Friday 24 th, 2017

Stat 400: Georgios Fellouris Homework 5 Due: Friday 24 th, 2017 Stat 400: Georgios Fellouris Homework 5 Due: Friday 4 th, 017 1. A exam has multiple choice questios ad each of them has 4 possible aswers, oly oe of which is correct. A studet will aswer all questios

More information

PRACTICE PROBLEMS FOR THE FINAL

PRACTICE PROBLEMS FOR THE FINAL PRACTICE PROBLEMS FOR THE FINAL Math 36Q Fall 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2 to

More information

Sample Midterm This midterm consists of 10 questions. The rst seven questions are multiple choice; the remaining three

Sample Midterm This midterm consists of 10 questions. The rst seven questions are multiple choice; the remaining three CS{74 Combiatorics & Discrete Probability, Fall 97 Sample Midterm :30{:00pm, 7 October Read these istructios carefully. This is a closed book exam. Calculators are permitted.. This midterm cosists of 0

More information

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

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

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

0, 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 information

Analysis of Algorithms. Introduction. Contents

Analysis of Algorithms. Introduction. Contents Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We

More information

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy

More information

Textbook: D.C. Montgomery and G.C. Runger, Applied Statistics and Probability for Engineers, John Wiley & Sons, New York, Sections

Textbook: D.C. Montgomery and G.C. Runger, Applied Statistics and Probability for Engineers, John Wiley & Sons, New York, Sections Textbook: DC Motgomery ad GC Ruger, Applied Statistics ad Probability for Egieers, Joh Wiley & Sos, New York, 2003 Sectios 28 35 1 Defiitio of "radom variable" (a) Write the defiitio of a radom variable

More information

Downloaded from

Downloaded from ocepts ad importat formulae o probability Key cocept: *coditioal probability *properties of coditioal probability *Multiplicatio Theorem o Probablity *idepedet evets *Theorem of Total Probablity *Bayes

More information

CS / MCS 401 Homework 3 grader solutions

CS / MCS 401 Homework 3 grader solutions CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of

More information

Basics of Probability Theory (for Theory of Computation courses)

Basics 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 information

Is mathematics discovered or

Is mathematics discovered or 996 Chapter 1 Sequeces, Iductio, ad Probability Sectio 1. Objectives Evaluate a biomial coefficiet. Expad a biomial raised to a power. Fid a particular term i a biomial expasio. The Biomial Theorem Galaxies

More information

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

f 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 information

Introduction to Probability and Statistics Twelfth Edition

Introduction 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 information

How to walk home drunk. Some Great Theoretical Ideas in Computer Science for. Probability Refresher. Probability Refresher.

How to walk home drunk. Some Great Theoretical Ideas in Computer Science for. Probability Refresher. Probability Refresher. 15251 Some Great Theoretical Ideas i Computer Sciece for "My frieds keep askig me what 251 is like. I lik them to this video: http://youtube.com/watch?v=m275pjvwrli" Probability Refresher What s a Radom

More information

Castiel, Supernatural, Season 6, Episode 18

Castiel, Supernatural, Season 6, Episode 18 13 Differetial Equatios the aswer to your questio ca best be epressed as a series of partial differetial equatios... Castiel, Superatural, Seaso 6, Episode 18 A differetial equatio is a mathematical equatio

More information

Test One (Answer Key)

Test One (Answer Key) CS395/Ma395 (Sprig 2005) Test Oe Name: Page 1 Test Oe (Aswer Key) CS395/Ma395: Aalysis of Algorithms This is a closed book, closed otes, 70 miute examiatio. It is worth 100 poits. There are twelve (12)

More information

18.440, March 9, Stirling s formula

18.440, March 9, Stirling s formula Stirlig s formula 8.44, March 9, 9 The factorial fuctio! is importat i evaluatig biomial, hypergeometric, ad other probabilities. If is ot too large,! ca be computed directly, by calculators or computers.

More information

Math 176 Calculus Sec. 5.1: Areas and Distances (Using Finite Sums)

Math 176 Calculus Sec. 5.1: Areas and Distances (Using Finite Sums) Math 176 Calculus Sec. 5.1: Areas ad Distaces (Usig Fiite Sums) I. Area A. Cosider the problem of fidig the area uder the curve o the f y=-x 2 +5 over the domai [0, 2]. We ca approximate this area by usig

More information

Introduction to Computational Biology Homework 2 Solution

Introduction to Computational Biology Homework 2 Solution Itroductio to Computatioal Biology Homework 2 Solutio Problem 1: Cocave gap pealty fuctio Let γ be a gap pealty fuctio defied over o-egative itegers. The fuctio γ is called sub-additive iff it satisfies

More information

April 18, 2017 CONFIDENCE INTERVALS AND HYPOTHESIS TESTING, UNDERGRADUATE MATH 526 STYLE

April 18, 2017 CONFIDENCE INTERVALS AND HYPOTHESIS TESTING, UNDERGRADUATE MATH 526 STYLE April 18, 2017 CONFIDENCE INTERVALS AND HYPOTHESIS TESTING, UNDERGRADUATE MATH 526 STYLE TERRY SOO Abstract These otes are adapted from whe I taught Math 526 ad meat to give a quick itroductio to cofidece

More information

Lecture 2: Concentration Bounds

Lecture 2: Concentration Bounds CSE 52: Desig ad Aalysis of Algorithms I Sprig 206 Lecture 2: Cocetratio Bouds Lecturer: Shaya Oveis Ghara March 30th Scribe: Syuzaa Sargsya Disclaimer: These otes have ot bee subjected to the usual scrutiy

More information

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

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

Massachusetts Institute of Technology

Massachusetts Institute of Technology 6.0/6.3: Probabilistic Systems Aalysis (Fall 00) Problem Set 8: Solutios. (a) We cosider a Markov chai with states 0,,, 3,, 5, where state i idicates that there are i shoes available at the frot door i

More information

Lecture 2: Poisson Sta*s*cs Probability Density Func*ons Expecta*on and Variance Es*mators

Lecture 2: Poisson Sta*s*cs Probability Density Func*ons Expecta*on and Variance Es*mators Lecture 2: Poisso Sta*s*cs Probability Desity Fuc*os Expecta*o ad Variace Es*mators Biomial Distribu*o: P (k successes i attempts) =! k!( k)! p k s( p s ) k prob of each success Poisso Distributio Note

More information

Monkeys and Walks. Muhammad Waliji. August 12, 2006

Monkeys and Walks. Muhammad Waliji. August 12, 2006 Mokeys ad Walks Muhammad Waliji August 12, 2006 1 relimiaries We will be dealig with outcomes resultig from radom processes. A outcome of the process will sometimes be deoted ω. Note that we will idetify

More information

Spring 2016 Exam 2 NAME: PIN:

Spring 2016 Exam 2 NAME: PIN: MARK BOX problem poits 0 20 20 2 0 3 0 4-7 20 NAME: PIN: 8 0 9 0 % 00 INSTRUCTIONS O Problem 0, fill i the blaks. As you kow, if you do ot make at least half of the poits o Problem 0, the your score for

More information

An Introduction to Randomized Algorithms

An 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 information

GENERATING FUNCTIONS AND RANDOM WALKS

GENERATING FUNCTIONS AND RANDOM WALKS GENERATING FUNCTIONS AND RANDOM WALKS SIMON RUBINSTEIN-SALZEDO 1 A illustrative example Before we start studyig geeratig fuctios properly, let us look a example of their use Cosider the umbers a, defied

More information

1 Convergence in Probability and the Weak Law of Large Numbers

1 Convergence in Probability and the Weak Law of Large Numbers 36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec

More information

LOGO. Chapter 2 Discrete Random Variables(R.V) Part1. iugaza2010.blogspot.com

LOGO. Chapter 2 Discrete Random Variables(R.V) Part1. iugaza2010.blogspot.com 1 LOGO Chapter 2 Discrete Radom Variables(R.V) Part1 iugaza2010.blogspot.com 2.1 Radom Variables A radom variable over a sample space is a fuctio that maps every sample poit (i.e. outcome) to a real umber.

More information

3. One pencil costs 25 cents, and we have 5 pencils, so the cost is 25 5 = 125 cents. 60 =

3. One pencil costs 25 cents, and we have 5 pencils, so the cost is 25 5 = 125 cents. 60 = JHMMC 0 Grade Solutios October, 0. By coutig, there are 7 words i this questio.. + 4 + + 8 + 6 + 6.. Oe pecil costs cets, ad we have pecils, so the cost is cets. 4. A cube has edges.. + + 4 + 0 60 + 0

More information

PRACTICE PROBLEMS FOR THE FINAL

PRACTICE PROBLEMS FOR THE FINAL PRACTICE PROBLEMS FOR THE FINAL Math 36Q Sprig 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2

More information

Introduction to Computational Molecular Biology. Gibbs Sampling

Introduction to Computational Molecular Biology. Gibbs Sampling 18.417 Itroductio to Computatioal Molecular Biology Lecture 19: November 16, 2004 Scribe: Tushara C. Karuarata Lecturer: Ross Lippert Editor: Tushara C. Karuarata Gibbs Samplig Itroductio Let s first recall

More information

STAT Homework 1 - Solutions

STAT 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 information

Topic 5: Basics of Probability

Topic 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 information

Fall 2016 Exam 2 PIN: 17

Fall 2016 Exam 2 PIN: 17 MARK BOX problem poits 0 0 0 2-3 60=2x5 4 0 5 0 % 00 HAND IN PART NAME: Solutios PIN: 7 INSTRUCTIONS This exam comes i two parts. () HAND IN PART. Had i oly this part. (2) STATEMENT OF MULTIPLE CHOICE

More information

AMS570 Lecture Notes #2

AMS570 Lecture Notes #2 AMS570 Lecture Notes # Review of Probability (cotiued) Probability distributios. () Biomial distributio Biomial Experimet: ) It cosists of trials ) Each trial results i of possible outcomes, S or F 3)

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture 9: Pricipal Compoet Aalysis The text i black outlies mai ideas to retai from the lecture. The text i blue give a deeper uderstadig of how we derive or get

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 18

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 18 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2013 Aat Sahai Lecture 18 Iferece Oe of the major uses of probability is to provide a systematic framework to perform iferece uder ucertaity. A

More information