Notes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology
|
|
- Rolf O’Brien’
- 5 years ago
- Views:
Transcription
1 Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,). In other words has pdf, f ( ), otherwse and cdf F ( ),,, Throughout ths chapter and,, represent random numbers unformly dstrbuted on (, ) and generated by one of the technques or taen from a random-number table. Inverse Transform Technque The nverse transform technque can be used to sample from the unform, the eponental, the Webull, and the trangular dstrbutons and emprcal dstrbutons. Addtonally, t s the underlyng prncple for samplng from a wde varety of dscrete dstrbutons. The technque wll be eplaned n detal for the eponental dstrbuton and then appled to other dstrbutons. It s the most straghtforward, but not always the most effcent, technque computatonally. Let the p.d.f.of a random varate be denoted f() and the c.d.f. be denoted F(). It can be shown that F() = ~ U(,),Snce cdf les between, t s u(o,) Sample space of a random varate Probablty space of a random number X F()= X=F - () ) Unform Dstrbuton
2 Consder a random varable X that s unformly dstrbuted on the nterval [a, b]. A reasonable guess for generatng X s gven by The pdf of X s gven by X = a + (b a) (.) f () =, a b a, otherwse The nverse transform technque can be utlzed, at least n prncple, for any dstrbuton, but t s most useful when the cdf, F (),s of such smple form that ts nverse, F -, can be easly computed. A stepby-step procedure for the nverse transform technque, The dervaton of Equaton (.) follows steps through 3 Step. The cdf s gven by b F () =, a a, a b a, b b Step. Set F (X) = (X a) / (b a) =. Step 3. Solvng for X n terms of yelds X = a + (b- a), whch agrees wth Equaton (.). Eample Gven a= and b= 4 generate s random observatons usng random numbers,.3,.48,.36,.,.54,.34 Sr. no andom number andom observaton X = a + (b- a) = ) Eponental Dstrbuton The eponental dstrbuton, has probablty densty functon (pdf)
3 f ( ) e,, and cumulatve dstrbuton functon (cdf) gven by F( ) f ( t) dt e,, The parameter can be nterpreted as the mean number of occurrences per tme unt. For eample, f nterarrval tmes X, X, X 3, had an eponental dstrbuton wth rate, then could be nterpreted as the mean number of arrvals per tme unt, or the arrval rate. Notce that for any E ( X ) So that / s the mean nterarrval tme. The goal here s to develop a procedure for generatng values X, X, X 3, whch have an eponental dstrbuton. Step. Compute the cdf of the desred random varable X. For the eponental dstrbuton, the cdf s F () = e,. Step. Set F (X) = on the range of X. For the eponental dstrbuton, t becomes e X = on the range. Snce X s a random varable (wth the eponental dstrbuton n ths case), t follows that e X s also a random varable, here called. As wll be shown later, has a unform dstrbuton over the nterval (, ). Step 3. Solve the equaton F (X) = for X n terms of. For the eponental dstrbuton, the soluton proceeds as follows: e X = e X = - X = ln (- ) X = - n( ) (.)
4 Equaton (.) s called a random-varate generator for the eponental dstrbuton. In general, Equaton (.) s wrtten as X = F - (). Generatng a sequence of values s accomplshed through step 4. Step 4. Generate (as needed) unform random numbers,, 3, and compute the desred random varates by X = F - ( ) For the eponental case, F - () = (-/ ) ln (- ) by Equaton (.), so that X = l n( ) (.) for =,, 3,.One smplfcaton that s usually employed n Equaton (.) s to replace - by to yeld X = ln (.3) Whch s justfed snce both and - are unformly dstrbuted on (, ). Eample : Generaton of fve Eponental Varates X wth Mean, /λ=.e. λ=, F () =- e - X = -Ln Gven andom Numbers X )Webull Dstrbuton The Webull dstrbuton when the locaton parameter s set to, ts pdf s gven by Equaton as f () = e ( /, otherwse ),
5 Where > and β > are the scale and shape parameters of the dstrbuton. To generate a Webull varate, follow steps through 3 Step. The cdf s gven by >ν > Step. Let =. Step 3. Solvng for X n terms of yelds X = [-ln (- )] /β (3.) t can be seen that f X s a Webull varate, then X β s an eponental varate wth mean β. Conversely, f Y s an eponental varate wth mean, then Y /β s a Webull varate wth shape parameter β and scale parameter = /β. 4)Trangular Dstrbuton Consder a random varable X whch has pdf X f () =, X otherwse Ths dstrbuton s called a trangular dstrbuton wth endponts (, ) and mode at. Its cdf s gven by
6 , F () =,, ( ), X X otherwse For X, and for X, X ( X ) X mples that, n whch case X =. X mples that, n whch case X = - ( ). Thus, X s generated by X =, ( ), Eample Generate four random observatons from trangular dstrbuton over(,,). =.3 <.5 X= =.599. =.4 <.5 X= = =.65 >.5 X= - ( ) = =.79 >.5 X= - ( ) =.359 Normal dstrbuton: consder random varable X whch s normally dstrbuted wth mean µ and varance σ. F() =P(X< )=.e. P(Z< (-µ)/σ)= correspondng to as area by usng normal table we can read the value of the ordnate as z.
7 z=ф - ( ) z=(-µ)/σ =µ+σz Eample Servce tme of a ban teller s found to follow normal dstrbuton wth mean 5 and s.d.. Generate fve servce tmes z X Emprcal Contnuous Dstrbutons If the modeler has been unable to fnd a theoretcal dstrbuton that provdes a good model for the nput data, then t may be necessary to use the emprcal dstrbuton of the data. One possblty s to smply resample the observed data tself. Ths s nown as usng the emprcal dstrbuton, and t maes partcularly good sense when the nput process s nown to tae on a fnte number of values. On the other hand, f the data are drawn from what s beleved to be a contnuous-valued nput process, then t maes sense to nterpolate between the observed data ponts to fll n the gaps. Ths secton descrbes a method for defnng and generatng data from a contnuous emprcal dstrbuton. Eample Fve observatons of fre crew response tmes (n mnutes) to ncomng alarms have been collected to be used n a smulaton nvestgaton possble alternatve staffng and crew schedulng polces. The data are Before collectng more data, t s desred to develop a prelmnary smulaton model whch uses a response-tme dstrbuton based on these fve observatons. Thus, a method for generatng random varates from the response-tme dstrbuton s needed. Intally, t wll be assumed that response tmes X have a range X c, where c s unnown, but wll be estmated by ĉ = ma {X : =,, n} =.76, where {X, =,, n} are the raw data and n = 5 s the number of observatons. Table 8.. Summary of Fre Crew esponse-tme Data Interval (-) () Probablty, /n Cumulatve Probablty=/n Slope X ( ) X ( a / n )
8 Arrange the data from smallest to largest and let () () (n) denote these sorted values. Snce the smallest possble value s beleved to be, defne () =. Assgn a probablty of /n = /5 to each nterval (-) (), The slope of the th lne segment s gven by a ( ) / n ( ) The nverse cdf s calculated by X Fˆ ( ) ( ) a ( n when ( - )/n < / n. For eample, f a random number =.7 s generated, then s seen to le n the fourth nterval (between 3/5 =.6 and 4/5 =.8),, X = (4 - ) + a 4 ( (4 - ) / n) = (.7.6) =.66 If a large sample of data s avalable (and sample szes from several hundred to tens of thousands are possble wth modern, automated data collecton), then t may be more convenent and computatonally effcent to frst summarze the data nto a frequency dstrbuton wth a much smaller number of ntervals and then ft a contnuous emprcal cdf to the frequency dstrbuton. Only a slght generalzaton of the above Equaton s requred to accomplsh ths. Now the slope of the th lne segment s gven by a = ( ) c c ( ) Where c s the cumulatve probablty of the frst ntervals of the frequency dstrbuton and (-) () s the th nterval. The nverse cdf s calculated by
9 X Fˆ ( ) ( ) a ( c ) when c - < c Eample Suppose that broen-wdget repar tmes have been collected. The data are summarzed n the followng Table n terms of the number of observatons n varous ntervals. For eample, there were 3 observatons between and.5 hour, between.5 and hour, and so on. Suppose t s nown that all repars tae at least 5 mnutes, so that X () =.5, as shown n Table..5 hour always. Then we set Table Summary of epar-tme Data Interval elatve Cumulatve Slope, (Hours) Frequency Frequency Frequency, c a.5 < < < For eample, suppose the frst random number generated s =.83. Then snce s between c 3 =.66 and c 4 =., X s X = (4 - ) + a 4 ( c 4 - ) = (.83.66) =.75 As another llustraton, suppose that =.33. Snce c =.3<.4 = c, Dscrete Dstrbuton X = () + a ( c ) = (.33.3) =.6 All dscrete dstrbutons can be generated usng the nverse transform technque, ether numercally through a table-looup procedure, or n some cases algebracally wth the fnal generaton scheme n terms of a formula. Other technques are sometmes used for certan dstrbutons, such as the convoluton technque for the bnomal dstrbuton. Some of these methods are dscussed n later
10 sectons. Ths subsecton gves eamples coverng both emprcal dstrbutons and two of the standard dscrete dstrbutons, the (dscrete) unform and the geometrc. Eample At the end of the day, the number of shpments on the loadng doc of the IHW Company (whose man product s the famous, ncredbly huge wdget) s ether,, or, wth observed relatve frequency of occurrence of.5,.3, and., respectvely. Internal consultants have been ased to develop a model to mprove the effcency of the loadng and haulng operatons, and as part of ths model they wll need to be able to generate values, X, to represent the number of shpments on the loadng doc at the end of each day. The consultants decde to model X as a dscrete random varable wth dstrbuton as gven below The probablty mass functon (pmf), p (), s gven by p() = P (X = ) =.5 p() = P (X = ) =.3 p() = P (X = ) =. and the cdf, F() = P (X ), s gven by F( ),.5,.8,., F() =.73.5 X =
11 3 The cdf of number of shpments, X. Table Table for Generatng the Dscrete Varate X Input, Output, r ecall that the cdf of a dscrete random varable always conssts of horzontal lne segments wth jumps of sze p () at those ponts,, whch the random varable can assume. p() =.5 at =, of sze p() =.3 at =, and of sze p() =. at =. Let =.73 Here =.73 s transformed to X =. In general, for =, f F ( - ) = r - < r = F( ) Snce r =.5 < =.73 r =.8, set X = =. The generaton scheme s summarzed as follows: X,,, Eample (A Dscrete Unform Dstrbuton) Consder the dscrete unform dstrbuton on {,,, } wth pmf and cdf gven by p ( ),,,...,
12 and F( ),,,,, 3 Let = and r = p() + + p( ) = F( ) = / for =,,,. Then by usng Inequalty (8.3) t can be seen that f the generated random number satsfes r r (A) Then X s generated by settng X =. Now, Inequalty (A) can be solved for : < < + Let [y] denote the smallest nteger y. for eample, [7.8] = 8, [5.3] = 6, and [-.3] = -. For y, [y] s a functon that rounds up. Ths notaton and Inequalty yeld a formula for generatng X, namely X = [] (B) For eample, consder generatng a random varate X, unformly dstrbuted on {,,, }. The varate, X, mght represent the number of pallets to be loaded onto a truc. Usng Table A. as a source of random numbers,, and Equaton (B) wth = yelds =.78, X = [7.8] = 8 =.3, X = [.3] = 3 =.3, X 3 = [.3] = 3 4 =.97, X 4 = [9.7] =
13 The procedure dscussed here can be modfed to generate a dscrete unform random varate wth any range consstng of consecutve ntegers Eample Consder the dscrete dstrbuton wth pmf gven by p ( ),,,..., ( ) For nteger values of n the range {,,, }, the cdf s gven by F( ) ( ) ( ( ( ( ) ) ) ) ( ) Generate and use Inequalty to conclude that X = whenever ( ) ( ) F( ) F( ) ( ) ( ) ( - ) ( + ) < ( + ) To solve ths nequalty for n terms of, frst fnd a value of that satsfes
14 or ( - ) = ( + ) - ( + ) = Then by roundng up, the soluton s X = [-]. By the quadratc formula, namely b b a 4ac wth a =, b = -, c = - ( + ), the soluton to the quadratc equaton s 4( ) The postve root of ths Equaton s the correct one to use so X s generated by X 4( ) Eample (The Geometrc Dstrbuton) Consder the geometrc dstrbuton wth pmf p() = p (, where < p <. Its cdf s gven by =,,, F( ) j pq j
15 p q q q For =,,, Usng the nverse transform technque geometrc random varable X wll assume the value whenever F( ) ( ( F( ) where s a generated random number assumed < <. Solvng Inequalty (8.9) for proceeds as follows: ( ( ( ) n( n( ) n( But - p < mples that ln ( - <, so that n( ) n( ) n( n( Thus, X = for that nteger value of satsfyng Inequalty or, n bref, usng the round-up functon [.] X n( n( ) Snce p s a fed parameter, let β = -/ln ( -. Then β > and, by Equaton (A), X = [-βln( ) ]. Occasonally, a geometrc varate X s needed whch can assume values {a, a +, a +, } wth pmf p () = p( -a ( = a, a +,.). Such a varate, X can be generated, usng Equaton (A), by (A) X a n( n( ) (B)
16 Eample Generate three values from a geometrc dstrbuton on the range {X } wth mean. Such a geometrc dstrbuton has pmf p () = p( - ( =,,.)wth mean /p =, or p = /. Thus, X can be generated by Equaton (B) wth a =, p = ½, and /ln ( - = Usng random number table A., =.93, =.5, and 3 =.687, whch yelds X = + [-.443 ln (.93) ] = + [3.878 ] = 4 X = + [-.443 ln (.5) ] = X 3 = + [-.443 ln (.687) ] = Convoluton method The probablty dstrbuton of a sum of two or more ndependent random varables s called a convoluton of the dstrbutons of the orgnal varables. Erlang dstrbuton. o An Erlang random varable X wth parameters (K,Ѳ) can be shown to be the sum of K ndependent eponental random varables X,=,,3..K each havng a mean /Ѳ o Usng equaton that can generate eponental varable, an Erlang varate can be generated by Accept eject technque Eample: Steps to generate unformly dstrbuted random numbers between /4 and.
17 Step. Generate a random number Step a. If, ¼ accept X =, go to Step 3 Step b. If, </4 reject, return to Step Step 3. If another unform random varate on [/4, ] s needed, repeat the procedure begnnng at Step. Otherwse stop. Posson Dstrbuton : The Pmf s P(X)= e! =,,.. where X can be nterpreted as the number of arrvals n one unt tme. o o From the orgnal Posson process defnton, we now the nter arrval tme,t, t,t 3..are eponentally dstrbuted wth a mean of λ,.e. λ arrvals n one unt tme. elaton between the two dstrbuton: X=n f and only f essentally ths means f there are n arrvals n one unt tme, the sum of nterarrval tme of the past n observatons has to be less than or equal to one, but f one more nterarrval tme s added, t s greater then one (unt tme). o The t s n the relaton can be generated from unformly dstrbuted random number t, thus that s o Now we can use the Acceptance-eject method to generate Posson dstrbuton.
18 Step. Set n =, P =. Step. Generate a random number n+ and replace P byp* n+. Step 3. If P < e -λ, then accept N = n, meanng at ths tme unt, there are n arrvals. Otherwse, reject the current n, ncrease n by one, return to Step. Eercses. Develop a random-varate generator for a random varable X wth the pdf f ( ) e e,,. Develop a generaton scheme for the trangular dstrbuton wth pdf f ( ) ( ), ( ),3 3, otherwse 3 6 Generate values of the random varate, compute the sample mean, and compare t to true mean of the dstrbuton. 3. Gven the followng cdf for a contnuous varable wth range -3 to 4, develop a generator for the varable., 3, 3 6 F( ), 3, Gven the pdf f() = /9 on 3, develop a generator for ths dstrbuton.
3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
More informationProbability and Random Variable Primer
B. Maddah ENMG 622 Smulaton 2/22/ Probablty and Random Varable Prmer Sample space and Events Suppose that an eperment wth an uncertan outcome s performed (e.g., rollng a de). Whle the outcome of the eperment
More informationSimulation and Random Number Generation
Smulaton and Random Number Generaton Summary Dscrete Tme vs Dscrete Event Smulaton Random number generaton Generatng a random sequence Generatng random varates from a Unform dstrbuton Testng the qualty
More informationAS-Level Maths: Statistics 1 for Edexcel
1 of 6 AS-Level Maths: Statstcs 1 for Edecel S1. Calculatng means and standard devatons Ths con ndcates the slde contans actvtes created n Flash. These actvtes are not edtable. For more detaled nstructons,
More informationStatistical analysis using matlab. HY 439 Presented by: George Fortetsanakis
Statstcal analyss usng matlab HY 439 Presented by: George Fortetsanaks Roadmap Probablty dstrbutons Statstcal estmaton Fttng data to probablty dstrbutons Contnuous dstrbutons Contnuous random varable X
More informationSuites of Tests. DIEHARD TESTS (Marsaglia, 1985) See
Sutes of Tests DIEHARD TESTS (Marsagla, 985 See http://stat.fsu.edu/~geo/dehard.html NIST Test sute- 6 tests on the sequences of bts http://csrc.nst.gov/rng/ Test U0 Includes the above tests. http://www.ro.umontreal.ca/~lecuyer/
More informationApplied Stochastic Processes
STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of
More informationSampling Theory MODULE VII LECTURE - 23 VARYING PROBABILITY SAMPLING
Samplng heory MODULE VII LECURE - 3 VARYIG PROBABILIY SAMPLIG DR. SHALABH DEPARME OF MAHEMAICS AD SAISICS IDIA ISIUE OF ECHOLOGY KAPUR he smple random samplng scheme provdes a random sample where every
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationDistributions /06. G.Serazzi 05/06 Dimensionamento degli Impianti Informatici distrib - 1
Dstrbutons 8/03/06 /06 G.Serazz 05/06 Dmensonamento degl Impant Informatc dstrb - outlne densty, dstrbuton, moments unform dstrbuton Posson process, eponental dstrbuton Pareto functon densty and dstrbuton
More informationA be a probability space. A random vector
Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by
More informationChapter 2 Transformations and Expectations. , and define f
Revew for the prevous lecture Defnton: support set of a ranom varable, the monotone functon; Theorem: How to obtan a cf, pf (or pmf) of functons of a ranom varable; Eamples: several eamples Chapter Transformatons
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationRandom Variate Generation ENM 307 SIMULATION. Anadolu Üniversitesi, Endüstri Mühendisliği Bölümü. Yrd. Doç. Dr. Gürkan ÖZTÜRK.
adom Varate Geerato ENM 307 SIMULATION Aadolu Üverstes, Edüstr Mühedslğ Bölümü Yrd. Doç. Dr. Gürka ÖZTÜK 0 adom Varate Geerato adom varate geerato s about procedures for samplg from a varety of wdely-used
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Mamum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models for
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationChapter 1. Probability
Chapter. Probablty Mcroscopc propertes of matter: quantum mechancs, atomc and molecular propertes Macroscopc propertes of matter: thermodynamcs, E, H, C V, C p, S, A, G How do we relate these two propertes?
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationStatistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )
Ismor Fscher, 8//008 Stat 54 / -8.3 Summary Statstcs Measures of Center and Spread Dstrbuton of dscrete contnuous POPULATION Random Varable, numercal True center =??? True spread =???? parameters ( populaton
More informationLecture 3 Stat102, Spring 2007
Lecture 3 Stat0, Sprng 007 Chapter 3. 3.: Introducton to regresson analyss Lnear regresson as a descrptve technque The least-squares equatons Chapter 3.3 Samplng dstrbuton of b 0, b. Contnued n net lecture
More informationModeling and Simulation NETW 707
Modelng and Smulaton NETW 707 Lecture 5 Tests for Random Numbers Course Instructor: Dr.-Ing. Magge Mashaly magge.ezzat@guc.edu.eg C3.220 1 Propertes of Random Numbers Random Number Generators (RNGs) must
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationFeb 14: Spatial analysis of data fields
Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationLecture Space-Bounded Derandomization
Notes on Complexty Theory Last updated: October, 2008 Jonathan Katz Lecture Space-Bounded Derandomzaton 1 Space-Bounded Derandomzaton We now dscuss derandomzaton of space-bounded algorthms. Here non-trval
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationχ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body
Secton.. Moton.. The Materal Body and Moton hyscal materals n the real world are modeled usng an abstract mathematcal entty called a body. Ths body conssts of an nfnte number of materal partcles. Shown
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
More informationChapter 3 Describing Data Using Numerical Measures
Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationCS 798: Homework Assignment 2 (Probability)
0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationCHAPTER 14 GENERAL PERTURBATION THEORY
CHAPTER 4 GENERAL PERTURBATION THEORY 4 Introducton A partcle n orbt around a pont mass or a sphercally symmetrc mass dstrbuton s movng n a gravtatonal potental of the form GM / r In ths potental t moves
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationThe written Master s Examination
he wrtten Master s Eamnaton Opton Statstcs and Probablty SPRING 9 Full ponts may be obtaned for correct answers to 8 questons. Each numbered queston (whch may have several parts) s worth the same number
More information12. The Hamilton-Jacobi Equation Michael Fowler
1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and
More informationEngineering Risk Benefit Analysis
Engneerng Rsk Beneft Analyss.55, 2.943, 3.577, 6.938, 0.86, 3.62, 6.862, 22.82, ESD.72, ESD.72 RPRA 2. Elements of Probablty Theory George E. Apostolaks Massachusetts Insttute of Technology Sprng 2007
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationSimulation and Probability Distribution
CHAPTER Probablty, Statstcs, and Relablty for Engneers and Scentsts Second Edton PROBABILIT DISTRIBUTION FOR CONTINUOUS RANDOM VARIABLES A. J. Clark School of Engneerng Department of Cvl and Envronmental
More information1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands
Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationFUZZY FINITE ELEMENT METHOD
FUZZY FINITE ELEMENT METHOD RELIABILITY TRUCTURE ANALYI UING PROBABILITY 3.. Maxmum Normal tress Internal force s the shear force, V has a magntude equal to the load P and bendng moment, M. Bendng moments
More informationPrimer on High-Order Moment Estimators
Prmer on Hgh-Order Moment Estmators Ton M. Whted July 2007 The Errors-n-Varables Model We wll start wth the classcal EIV for one msmeasured regressor. The general case s n Erckson and Whted Econometrc
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationCorrelation and Regression. Correlation 9.1. Correlation. Chapter 9
Chapter 9 Correlaton and Regresson 9. Correlaton Correlaton A correlaton s a relatonshp between two varables. The data can be represented b the ordered pars (, ) where s the ndependent (or eplanator) varable,
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationDifferentiating Gaussian Processes
Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the
More informationWhat would be a reasonable choice of the quantization step Δ?
CE 108 HOMEWORK 4 EXERCISE 1. Suppose you are samplng the output of a sensor at 10 KHz and quantze t wth a unform quantzer at 10 ts per sample. Assume that the margnal pdf of the sgnal s Gaussan wth mean
More informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationAs is less than , there is insufficient evidence to reject H 0 at the 5% level. The data may be modelled by Po(2).
Ch-squared tests 6D 1 a H 0 : The data can be modelled by a Po() dstrbuton. H 1 : The data cannot be modelled by Po() dstrbuton. The observed and expected results are shown n the table. The last two columns
More informationMarkov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal
Markov chans M. Veeraraghavan; March 17, 2004 [Tp: Study the MC, QT, and Lttle s law lectures together: CTMC (MC lecture), M/M/1 queue (QT lecture), Lttle s law lecture (when dervng the mean response tme
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationProbability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n!
8333: Statstcal Mechancs I Problem Set # 3 Solutons Fall 3 Characterstc Functons: Probablty Theory The characterstc functon s defned by fk ep k = ep kpd The nth coeffcent of the Taylor seres of fk epanded
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informatione i is a random error
Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where + β + β e for,..., and are observable varables e s a random error How can an estmaton rule be constructed for the unknown
More informationWhy Monte Carlo Integration? Introduction to Monte Carlo Method. Continuous Probability. Continuous Probability
Introducton to Monte Carlo Method Kad Bouatouch IRISA Emal: kad@rsa.fr Wh Monte Carlo Integraton? To generate realstc lookng mages, we need to solve ntegrals of or hgher dmenson Pel flterng and lens smulaton
More informationChapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.
Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where y + = β + β e for =,..., y and are observable varables e s a random error How can an estmaton rule be constructed for the
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationLecture 17 : Stochastic Processes II
: Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss
More informationTHE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE
THE ROYAL STATISTICAL SOCIETY 6 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutons to assst canddates preparng for the eamnatons n future years and for
More informationCHAPTER 4. Vector Spaces
man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More information