Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2
|
|
- Amie Bates
- 5 years ago
- Views:
Transcription
1 Itroductio to probability Stochastic Process Queuig systems TELE4642: Week2
2 Overview Refresher: Probability theory Termiology, defiitio Coditioal probability, idepedece Radom variables ad distributios Cotiuous r.v.: Expoetial Discrete r.v.: Poisso Momets ad momet geeratig fuctios Network Performace 2-2
3 Why formal models of performace? Why ot just use commo sese or ituitio? ca mislead may ot scale Stochastic theory more broadly applicable i the world: Games: aciet Greeks to moder poker Boltzma / Maxwell: thermodyamic etropy Quatum mechaics: everythig is ucertai! Shao: iformatio theory Erlag: telephoe switch capacity Questios pertiet to the Iteret: How to uatify ed-to-ed loss ad delay for Iteret traffic? How big should router buffers be? How may voice calls ca be admitted? How to tue commuicatio protocol parameters? How to exploit Iteret topology structure? How to make moey? Akamai ad Google did J Network Performace 2-3
4 Probability: termiology A radom experimet is a experimet for which the result is ot kow a priori E.g.: How may heads will occur i 10 flips of a fair coi? A possible outcome is a sample poit The sample space S is the set of all sample poits, i.e., the set of all possible outcomes There are 2 10 = 1024 differet outcomes of flippig a coi 10 times A simplified sample space with 11 outcomes (0 to 10 occurreces of heads) is valid for our experimet A evet A is a subset of S For example, we could defie the evet that there are 5 heads ; a odd umber of heads ; 7 or more heads, etc Network Performace 2-4
5 Probability: defiitio A probability measure defied o S is a fuctio that associates to each possible evet A a real umber P(A) such that: ( i ) 0 ( ii ) P ( iii ) P ( P ( A) ( S ) = 1 1! Ai ) = å i = 1 i = 1 P ( A i ) if A i ' s mutually exclusive Network Performace 2-5
6 Coditioal Probability 2-6 The coditioal probability of evet A give that evet B has occurred, deoted by P(A B), is defied as Q: A coi is tossed twice. What is the probability that both tosses were heads give that at least oe toss was heads? Bayes theorem: Give a partitio {G 1, G 2, } ad evet E Refiig a hypothesis based o additioal evidece ) ( ) ( ) ( B P B A ad P B A P = å = j j j i i i G P G E P G P G E P E G P ) ( ) ( ) ( ) ( ) ( Network Performace
7 Applicatio of Bayes Theorem Imagie you are a cotestat i a game-show. The host shows you three boxes, oe of which has treasure iside, ad asks you to pick oe. Say you pick box 1. He ow opes box 2 ad shows that the treasure is ot iside that box. He ow asks if you wat to chage your mid. Should you chage to box 3 or stay with box 1 to maximize your chaces of wiig? G i : treasure is i box-i E: you pick box 1 ad the host opes box 2 P(G 1 ) = P(G 2 ) = P(G 3 ) = 1/3 P(E G 1 ) = ½; P(E G 2 ) = 0; P(E G 3 ) = 1 Apply Bayes theorem to determie P(G 1 E) ad P(G 3 E) Network Performace 2-7
8 Idepedet evets Two evets are statistically idepedet iff P(A B) = P(A) ad P(B A) = P(B) Q: Two fair dice are throw simultaeously. Let A be the evet that the first die shows a 6 ad B the evet that the sum of the dice is 9. Are A ad B idepedet? What if B deotes the evet that the sum is 7? Network Performace 2-8
9 Radom Variables A radom variable X maps each outcome s i the sample space S to a real umber X(s) A radom variable is thus a measuremet of a experimet Network Performace 2-9
10 Cotiuous radom variables Ca take o a ucoutably ifiite umber of distict values Example: time betwee packet arrivals Cumulative distributio fuctio (cdf): F ( x) = P( X x) Probability desity fuctio (pdf): f ( x) = df ( x) / dx F ( x) = x f ( y) dy ò - Network Performace 2-10
11 Example: expoetial r.v. pdf: cdf: f(x) - µx f ( x) = µ e, x ³ 0 F - µ x ( x) = 1 - e pdf x Most commoly used cotiuous r.v. Models: Time elapsed sice arrival of task at a computer system Time betwee arrivals of buses at a bus-stop Time betwee arrivals of packets/coectios at a etwork switch Network Performace 2-11
12 Expoetial r.v.: memoryless property Memoryless: future is idepedet of the past! Mathematically:! " > $ + & " > &) =! " > $, $, & > 0 Proof:! " > $ + & " > &) =! " > $ + &,-. " > & /!(" > &) =! " > $ + & /!(" > &) = e e - µ ( s+ t ) - µ t = =!(" > $) Network Performace 2-12
13 Exercise: Geerate Expoetial r.v. Usig a uiformly distributed radom variable i the iterval [0,1) (such as geerated by the rad() ad drad48() fuctios), how would you geerate a expoetial radom variable with parameter!? Method: Euate cdf of the two distributios Aswer: y = -l(1-x)/! where x is uiformly distributed i [0,1) ad y is expoetial with parameter!. Network Performace 2-13
14 Discrete radom variables Ca take o a fiite or coutably ifiite umber of values Example: umber of packet arrivals i a 1-hour iterval p ( x) = P[ X = x] Probability mass fuctio (pmf): F ( x) = å y x p( y) Cumulative distributio fuctio (cdf): Network Performace 2-14
15 Example: Beroulli ad Biomial r.v. Beroulli r.v.: P[X=1] = p ad P[X=0] = Coi toss (biased coi) where 1 deotes head ad 0 tail Biomial r.v.: sum of Beroulli radom variables Number of heads i coi tosses P[ X = i] = æö ç è i ø p i -i Network Performace 2-15
16 Mea / Momets The mea (or expected value or expectatio or first momet) of a cotiuous r.v. is E [ X ] = xf ( x) dx ò - Example: mea of expoetial r.v. is 1/µ The mea of a discrete r.v. is E [ X ] = å " kp( X = k) k Example: mea of biomial r.v. is p Secod, -th momets Variace, stadard deviatio Network Performace 2-16
17 Stochastic Process
18 Stochastic Processes A stochastic process (or radom process) is a family of radom variables {X(t): t Î T} idexed by parameter t over idex set T The typical iterpretatio is that T is the time dimesio ad r.v. X is a fuctio of time Cotiuous-time versus discrete-time The r.v. takes ew values some poit of time i cotiuous versus discrete space Cotiuous-value versus discrete-value The r.v. takes o cotiuous versus discrete values We will oly study statioary processes, i.e. those i euilibrium Network Performace 2-18
19 Markov Process A stochastic process havig the Markov property: P ( X s+ t = j X u = xu; u s) = P( X s+ t = j X s = xs) Sample path followed by the process after ay time t depeds oly o the state X t existig at that time, ad ot o past history We cosider: cotiuous-time, discrete-value Importat Markov process: Poisso process Simplest, mathematically well-behaved example of a Markov process It is a coutig process for the umber of radomly occurrig poitevets observed i a give iterval of time, e.g. Tasks arrivig at a processor Messages arrivig to a etwork Customers arrivig at a supermarket checkout Radioactive particles from a source Network Performace 2-19
20 Poisso Process: Defiitio Let the r.v. N(t,t) deote umber of arrivals i (t,t] Let o(h) deotes a expressio f(h) such that A Poisso process {N(0,t)}, t 0, with rate l is such that: 1. P[N(t,t+h)=0] = 1 - lh + o(h) 2. P[N(t,t+h)=1] = lh + o(h) 3. P[N(t,t+h)=2] = o(h) 4. N(0,t) ad N(t,t+h) are idepedet for all t, h > 0 Every small iterval has eual likelihood of arrival occurrece Arrivals are thus completely radom i time Time-homogeeity property: for all t: P[N(t, t+t)] = P[N(0,t)] = P[N(t)] Network Performace 2-20
21 Poisso Process: pmf Claim: The umber of arrivals N(t) i ay iterval of legth t is a Poisso r.v. with parameter lt: -lt k P[ N( t) = k] = e ( lt) k! Claim: Mea umber of arrivals i ay iterval of legth t: E[ N( t)] = å k= 0 kp[ N( t) = k] = lt Claim: Poisso is a limitig approximatio of biomial (λt = p) : i æö ( lt) Claim: Iter-arrival time (i.e. time betwee successive arrivals) is a expoetial r.v. with parameter l [Proof?] Ø Ø lim i -i ç p (1 - p) = e èi ø Time to first arrival is expoetial Time to ext arrival is expoetial -lt i! Network Performace 2-21
22 Poisso Process: Superpositio If k idepedet Poisso processes A 1,..., A k, with rates l 1,..., l k, are merged ito a sigle process, A = A A k,, the combied process A is Poisso with rate l = l l k l 2 l 1... l k + l Network Performace 2-22
23 Poisso Process: Decompositio If a Poisso process (with rate l) is split ito k other processes by idepedetly assigig each arrival to the ith process with probability p i, where p p k = 1, the resultig k processes are each Poisso with rate p i l for the ith process l p 1 l p 2 l... p k l Network Performace 2-23
24 Queuig systems
25 Queuig Systems Notatio Server System parameters: arrival process, service time, service capacity, waitig room Iput Queue Output Kedall otatio: a/b/c a: iter-arrival time distributio (M: memoryless, G: geeral) b: service time distributio (D: determiistic) c: umber of servers Extra letter ca deote waitig room capacity E.g.: M/M/1, M/M/c, M/G/1, M/D/1, M/M/1/K, Performace measures: wait time, sojour time, umber i ueue, work i system, Network Performace 2-25
26 PASTA: Radom Observer Property I ay ueueig system with Poisso arrivals: Probability that a radom arrivig customer fids the system i state A is exactly idetical to the probability that the system is i state A. PASTA (Poisso Arrivals See Time Averages) property This does ot hold for arbitrary systems, e.g. cosider a system where customers arrive at time 1, 3, 5,, each reuirig oe uit time of service, ad the system starts idle at time 0. Each arrival fid the system empty, but probability of empty system is 0.5 Network Performace 2-26
27 Little s Result The mea umber of customers i the system euals the product of the arrival rate ad the mea sojour time i the system E E[ ] N = le[ t ] = l T Ca be applied to sub-systems: Ø Ø Queue: Server: [ ] = le[ t ] r le[ t ] = l / µ = s The server utilisatio ρ deotes mea umber of customers at the server, which is the same as the fractio of time the server is workig Network Performace 2-27
4. 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 informationQueuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues
Queuig Theory Basic properties, Markovia models, Networks of queues, Geeral service time distributios, Fiite source models, Multiserver queues Chapter 8 Kedall s Notatio for Queuig Systems A/B/X/Y/Z: A
More informationGeneralized Semi- Markov Processes (GSMP)
Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual
More informationAMS570 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 informationNOTES ON DISTRIBUTIONS
NOTES ON DISTRIBUTIONS MICHAEL N KATEHAKIS Radom Variables Radom variables represet outcomes from radom pheomea They are specified by two objects The rage R of possible values ad the frequecy fx with which
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 informationLimit Theorems. Convergence in Probability. Let X be the number of heads observed in n tosses. Then, E[X] = np and Var[X] = np(1-p).
Limit Theorems Covergece i Probability Let X be the umber of heads observed i tosses. The, E[X] = p ad Var[X] = p(-p). L O This P x p NM QP P x p should be close to uity for large if our ituitio is correct.
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 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 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 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 information7.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 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 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 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 informationEE 4TM4: Digital Communications II Probability Theory
1 EE 4TM4: Digital Commuicatios II Probability Theory I. RANDOM VARIABLES A radom variable is a real-valued fuctio defied o the sample space. Example: Suppose that our experimet cosists of tossig two fair
More informationFinal 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 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 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 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 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 informationParameter, Statistic and Random Samples
Parameter, Statistic ad Radom Samples A parameter is a umber that describes the populatio. It is a fixed umber, but i practice we do ot kow its value. A statistic is a fuctio of the sample data, i.e.,
More informationMathematical 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 informationAs stated by Laplace, Probability is common sense reduced to calculation.
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
More informationA queueing system can be described as customers arriving for service, waiting for service if it is not immediate, and if having waited for service,
Queuig System A queueig system ca be described as customers arrivig for service, waitig for service if it is ot immediate, ad if havig waited for service, leavig the service after beig served. The basic
More informationFirst come, first served (FCFS) Batch
Queuig Theory Prelimiaries A flow of customers comig towards the service facility forms a queue o accout of lack of capacity to serve them all at a time. RK Jaa Some Examples: Persos waitig at doctor s
More informationLecture 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 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 informationDiscrete Probability Functions
Discrete Probability Fuctios Daiel B. Rowe, Ph.D. Professor Departmet of Mathematics, Statistics, ad Computer Sciece Copyright 017 by 1 Outlie Discrete RVs, PMFs, CDFs Discrete Expectatios Discrete Momets
More informationPRACTICE 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 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 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 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 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 informationThis exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.
Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the
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 information7.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 informationReliability and Queueing
Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio
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 informationB. Maddah ENMG 622 ENMG /27/07
B. Maddah ENMG 622 ENMG 5 3/27/7 Queueig Theory () What is a queueig system? A queueig system cosists of servers (resources) that provide service to customers (etities). A Customer requestig service will
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 informationProperties 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 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 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 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 informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
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 informationMath 525: Lecture 5. January 18, 2018
Math 525: Lecture 5 Jauary 18, 2018 1 Series (review) Defiitio 1.1. A sequece (a ) R coverges to a poit L R (writte a L or lim a = L) if for each ǫ > 0, we ca fid N such that a L < ǫ for all N. If the
More informationLecture 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 informationc. Explain the basic Newsvendor model. Why is it useful for SC models? e. What additional research do you believe will be helpful in this area?
1. Research Methodology a. What is meat by the supply chai (SC) coordiatio problem ad does it apply to all types of SC s? Does the Bullwhip effect relate to all types of SC s? Also does it relate to SC
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationChapter 2 The Monte Carlo Method
Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful
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 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 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 informationCS/ECE 715 Spring 2004 Homework 5 (Due date: March 16)
CS/ECE 75 Sprig 004 Homework 5 (Due date: March 6) Problem 0 (For fu). M/G/ Queue with Radom-Sized Batch Arrivals. Cosider the M/G/ system with the differece that customers are arrivig i batches accordig
More informationIE 230 Seat # Name < KEY > Please read these directions. Closed book and notes. 60 minutes.
IE 230 Seat # Name < KEY > Please read these directios. Closed book ad otes. 60 miutes. Covers through the ormal distributio, Sectio 4.7 of Motgomery ad Ruger, fourth editio. Cover page ad four pages of
More informationThe Poisson Process *
OpeStax-CNX module: m11255 1 The Poisso Process * Do Johso This work is produced by OpeStax-CNX ad licesed uder the Creative Commos Attributio Licese 1.0 Some sigals have o waveform. Cosider the measuremet
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 informationHOMEWORK 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 informationJanuary 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 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 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 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 informationModeling and Performance Analysis with Discrete-Event Simulation
Simulatio Modelig ad Performace Aalysis with Discrete-Evet Simulatio Chapter 5 Statistical Models i Simulatio Cotets Basic Probability Theory Cocepts Useful Statistical Models Discrete Distributios Cotiuous
More informationClosed book and notes. No calculators. 60 minutes, but essentially unlimited time.
IE 230 Seat # Closed book ad otes. No calculators. 60 miutes, but essetially ulimited time. Cover page, four pages of exam, ad Pages 8 ad 12 of the Cocise Notes. This test covers through Sectio 4.7 of
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 informationPRACTICE 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 informationDiscrete 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 informationIE 230 Probability & Statistics in Engineering I. Closed book and notes. No calculators. 120 minutes.
Closed book ad otes. No calculators. 120 miutes. Cover page, five pages of exam, ad tables for discrete ad cotiuous distributios. Score X i =1 X i / S X 2 i =1 (X i X ) 2 / ( 1) = [i =1 X i 2 X 2 ] / (
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 informationLecture 6: Coupon Collector s problem
Radomized Algorithms Lecture 6: Coupo Collector s problem Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Radomized Algorithms - Lecture 6 1 / 16 Variace: key features
More informationLecture 6 Simple alternatives and the Neyman-Pearson lemma
STATS 00: Itroductio to Statistical Iferece Autum 06 Lecture 6 Simple alteratives ad the Neyma-Pearso lemma Last lecture, we discussed a umber of ways to costruct test statistics for testig a simple ull
More informationEcon 325: Introduction to Empirical Economics
Eco 35: Itroductio to Empirical Ecoomics Lecture 3 Discrete Radom Variables ad Probability Distributios Copyright 010 Pearso Educatio, Ic. Publishig as Pretice Hall Ch. 4-1 4.1 Itroductio to Probability
More informationFACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures
FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals
More informationLecture 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 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 informationPH 425 Quantum Measurement and Spin Winter SPINS Lab 1
PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured
More informationWhat 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 informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationAMS 216 Stochastic Differential Equations Lecture 02 Copyright by Hongyun Wang, UCSC ( ( )) 2 = E X 2 ( ( )) 2
AMS 216 Stochastic Differetial Equatios Lecture 02 Copyright by Hogyu Wag, UCSC Review of probability theory (Cotiued) Variace: var X We obtai: = E X E( X ) 2 = E( X 2 ) 2E ( X )E X var( X ) = E X 2 Stadard
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 informationkp(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 informationBinomial Distribution
0.0 0.5 1.0 1.5 2.0 2.5 3.0 0 1 2 3 4 5 6 7 0.0 0.5 1.0 1.5 2.0 2.5 3.0 Overview Example: coi tossed three times Defiitio Formula Recall that a r.v. is discrete if there are either a fiite umber of possible
More informationModule 1 Fundamentals in statistics
Normal Distributio Repeated observatios that differ because of experimetal error ofte vary about some cetral value i a roughly symmetrical distributio i which small deviatios occur much more frequetly
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 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 informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationMATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4
MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.
More informationKurskod: TAMS11 Provkod: TENB 21 March 2015, 14:00-18:00. English Version (no Swedish Version)
Kurskod: TAMS Provkod: TENB 2 March 205, 4:00-8:00 Examier: Xiagfeg Yag (Tel: 070 2234765). Please aswer i ENGLISH if you ca. a. You are allowed to use: a calculator; formel -och tabellsamlig i matematisk
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 informationIIT JAM Mathematical Statistics (MS) 2006 SECTION A
IIT JAM Mathematical Statistics (MS) 6 SECTION A. If a > for ad lim a / L >, the which of the followig series is ot coverget? (a) (b) (c) (d) (d) = = a = a = a a + / a lim a a / + = lim a / a / + = lim
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 informationDiscrete 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 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 informationThis section is optional.
4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationRandom 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 informationThe Poisson Distribution
MATH 382 The Poisso Distributio Dr. Neal, WKU Oe of the importat distributios i probabilistic modelig is the Poisso Process X t that couts the umber of occurreces over a period of t uits of time. This
More informationThe standard deviation of the mean
Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider
More information