TIGHT BOUNDS ON EXPECTED ORDER STATISTICS


 Basil Ellis
 2 years ago
 Views:
Transcription
1 Probability i the Egieerig ad Iformatioal Scieces, 20, 2006, Prited i the U+S+A+ TIGHT BOUNDS ON EXPECTED ORDER STATISTICS DIMITRIS BERTSIMAS Sloa School of Maagemet ad Operatios Research Ceter Massachusetts Istitute of Techology Cambridge, MA KARTHIK NATARAJAN Departmet of Mathematics Natioal Uiversity of Sigapore Sigapore CHUNGPIAW TEO Departmet of Decisio Scieces NUS Busiess School Sigapore I this article, we study the problem of fidig tight bouds o the expected value of the kthorder statistic k: # uder first ad secod momet iformatio o realvalued radom variables+ Give meas i # µ i ad variaces i # s i 2, we show that the tight upper boud o the expected value of the highestorder statistic : # ca be computed with a bisectio search algorithm+ A extremal discrete distributio is idetified that attais the boud, ad two closedform bouds are proposed+ Uder additioal covariace iformatio i, X j # Q ij, we show that the tight upper boud o the expected value of the highestorder statistic ca be computed with semidefiite optimizatio+ We geeralize these results to fid bouds o the expected value of the kthorder statistic uder mea ad variace iformatio+ For k, this boud is show to be tight uder idetical meas ad variaces+ All of our results are distributiofree with o explicit assumptio of idepedece made+ Particularly, usig optimizatio methods, we develop tractable approaches to compute bouds o the expected value of order statistics Cambridge Uiversity Press $
2 668 D. Bertsimas, K. Nataraja, ad C.P. Teo. INTRODUCTION Let X ~X,+++,X! deote 2 joitly distributed realvalued radom variables+ The order statistics of this set is a reorderig of the X i i terms of odecreasig values, expressed as X : {{{ X k: {{{ X : + The lowest ad highestorder statistics are deoted by X : ad X :, respectively+ Oe of the cetral problems i statistics is to fid, boud, or approximate the expected value of order statistics uder varyig assumptios o the distributio of the radom variables+ For detailed reviews o this subject, the reader is referred I this article, we focus o fidig bouds o the expected value of order statistics uder momet iformatio o the radom variables+ Let X ; u m deote the set of feasible distributios u that satisfies the give momets m for the radom variables+ Defiitio : Z k: is a tight upper boud o the expected value of the kthorder statistic if Z k: sup E k: #; X; u m that is, there exists a feasible distributio or a limit of a sequece of feasible distributios that achieves the upper boud. No other assumptios o idepedece or the type of distributio are made+ I this article, we develop methods to compute Z k: uder first ad secod momet iformatio o the radom variables+ Next, we review some of the classical bouds for order statistics+.. Some Kow Bouds Give idetical meas ad variaces ~ µ, s 2! for the radom variables, oe of the earliest kow bouds for the expected highestorder statistic was derived by ad Hartley ad Uder the assumptio of idepedece, they obtaied the upper boud µ s~! M 2 + exteded this result to the special case of symmetrically distributed radom variables+ For more geeral distributios ~ot ecessarily idepedet or idetically distributed!, Arold ad obtaied a upper boud o the expected value of the kthorder statistic: 2 ( µ i E k: # k ( ( µ i s 2 i µ i + () ~ k! Uder idetical meas ad variaces, this boud reduces to E k: # µ s k k + (2)
3 For this particular case, Arold ad showed that ~2! is tight by explicitly costructig a distributio that achieved the boud+ However, for geeral mea variace iformatio, ~! is ot ecessarily tight+ proposed a alterative upper boud o the expected value of the highestorder statistic: E : # max µ i i ( s i 2 + (3) This boud is also ot tight uder geeral mea variace iformatio+ I this article, we develop a algorithmic approach to fid ~possibly! tight bouds o the expected value of the order statistic Z k: + We characterize cases for which the boud ca be computed tractably, or we propose simple closedform bouds that seem promisig+.2. Cotributios TIGHT BOUNDS ON EXPECTED ORDER STATISTICS 669 Our mai cotributios i this article are as follows: + I Sectio 2 we fid the tight upper boud o the expected value of the highestorder statistic Z : uder mea variace iformatio o the radom variables+ A efficietly solvable bisectio search approach is developed to compute Z : + A discrete extremal distributio is idetified that attais the tight boud+ Two simple closedform bouds for the expected highestorder statistic are proposed+ Uder additioal covariace iformatio, we propose a semidefiite programmig approach to fid the tight boud o the expected highestorder statistic+ 2+ I Sectio 3 we exted the bisectio search method to obtai bouds o the expected value of the geeral kthorder statistic uder mea variace iformatio+ For k, we show that the boud is tight uder idetical meas ad variaces+ For geeral mea variace iformatio, the boud foud with the bisectio search method, although ot ecessarily tight, is at least as strog as ~!+ 3+ I Sectio 4 we provide computatioal experimets to test the performace of the differet bouds+ 2. BOUNDS ON EXPECTED HIGHESTORDER STATISTIC We first compute the tight upper boud o the expected highestorder statistic Z : uder mea variace iformatio o the radom variables+ The mea ad variace iformatio o the radom variables are deoted as m ~ µ,+++,µ! ad s 2 ~s 2,+++,s 2!+ The set of feasible distributios satisfyig these momet restrictios is represeted by X ; u ~ m, s 2!+ For simplicity of presetatio, we will assume that all of the s i are strictly positive+ As discussed later, this coditio ca i fact be relaxed+
4 670 D. Bertsimas, K. Nataraja, ad C.P. Teo The approach to compute the tight upper boud o the expected value of the highestorder statistic is based o a covex reformulatio techique, iitially proposed by Meilijso ad ad developed later i Bertsimas, Nataraja, ad The reformulatio is based o the observatio that the highestorder statistic X : is a covex fuctio i the X i variables+ We review the key ideas of this reformulatio ext+ Theorem ~Bertsimas et The tight upper boud o the expected value of the highestorder statistic Z : give X ; u ~ m, s 2! is obtaied by solvig Z : mi where x max~0, x!. z z : ( sup E i z i #, (4) X i ; ui ~ µ i, s 2 i! Sketch of Proof: We first show that ~4! provides a upper boud o Z : + To see this, ote that we have the followig iequality for each variable X i : X i z i ~X i z i! z : i z i # + Sice the righthad side of this iequality is idepedet of the particular i, we have X : z : i z i # + Takig expectatios ad miimizig over the z i variables, we obtai the best upper boud: E : # mi z : ( E i z i # + z Optimizig over distributios with give mea variace iformatio, we obtai a upper boud: Z : mi z : ( z sup X i ; ui ~ µ i, s 2 i! E i z i # + Note that the ier problem is optimizatio over probability distributios of sigle radom variables u i, sice o crossmomet iformatio is specified+ For a proof that the boud is tight, the reader is referred Alteratively, we costruct a extremal distributio i Theorem 3 that attais the boud+
5 TIGHT BOUNDS ON EXPECTED ORDER STATISTICS 67 The solutio for the ier problem i ~4! is i fact kow i closed form We ow outlie a simple proof for this boud+ Propositio : The tight upper boud o the expected value E i z i # give X i ; ui ~ µ i, s i 2! is sup E i z i # X i ; ui ~ µ i, s 2 i! i z i M~ µ i z i! 2 s 2 i #+ (5) Proof: We have the basic i z i # 2 ~X i z i 6X i z i 6!+ Takig expectatios, we obtai E i z i # 2 ~E u i z i # E ui 6X i z i 6!, X i ; ui ~ µ i, s i 2! 2 ~ µ i z i M~ µ i z i! 2 s i 2!, ~from the Cauchy Schwarz iequality!+ Furthermore, this boud ca be show to be tight sice it is attaied by the distributio 2 i M~ µ i z i X i z!2 s 2 i, w+p+ p µ i z i 2 M~ µ i z i! 2 s i z i M~ µ i z i! 2 s i 2, w+p+ p 2 µ i z i M~ µ i z i! 2 s i 2 Usig this closedform boud, we ow show that the tight upper boud o the expected highestorder statistic ca be foud by solvig a uivariate covex miimizatio problem+ Theorem 2: The tight upper boud o the expected value of the highestorder statistic Z : give X ; u ~ m, s 2! is obtaied by solvig the strictly covex uivariate miimizatio problem Z : mi f : ~z! mi z ( (6) z z i z M~ µ i z! 2 s i 2 # +
6 672 D. Bertsimas, K. Nataraja, ad C.P. Teo Proof: Combiig Theorem ad Propositio, the tight upper boud o the expected highestorder statistic is Z : mi z : ( z i z i M~ µ i z i! 2 s 2 i # + (7) We ext show that ~7! ca be simplified to a siglevariable optimizatio problem+ Let z be a optimal solutio to ~7! ad let z : deote the highestorder statistic+ Note that the secod term, ( _ i z i M~ µ i z i! 2 s 2 i #, is decreasig i z i + Hece, for ay i with z i: z :, by icreasig z i: up to z : the first term remais uaffected while the secod term decreases, thus reducig the objective+ Sice we are miimizig the objective, the optimal solutio will set all of the z i values equal to z : + It ca be easily checked that f : is a strictly covex fuctio, implyig that the fuctio has a uique global miimum+ The optimal decisio variable z i ~6! hece satisfies the firstorder coditio obtaied by settig the derivative ]f : ~z!0]z to zero: ]f : ~z! ( ]z z µ i M~ µ i z! 2 s i 2 ~ 2! 0+ (8) Remark: Our result ca be viewed as a extesio of the boud from Lai ad ad I their case, uder completely kow margial distributios X i ; u u i, they obtai the followig tight boud o the highestorder statistic: sup X i ; u u i, i E : # mi z ( z Note that this result follows also from Meilijso ad E i z# + (9) 2.. A Extremal Probability Distributio We costruct a atom discrete distributio that satisfies that mea variace requiremets ad attais the boud i ~6!+ Theorem 3: Let z deote the optimal miimizer to (6). A atom extremal distributio for X that achieves the upper boud ad satisfies the mea variace requiremets is X X ~ j!, w.p. p j 2 µ j z M~ µ j z! 2 s j 2 for j,+++,,
7 TIGHT BOUNDS ON EXPECTED ORDER STATISTICS 673 where X ~ j! ~ j ~X! ~ j,+++,x!! is expressed as ~ j X z M~ µ! i z! 2 2 s i if i j i z M~ µ i z! 2 2 s i if i j+ Proof: From the defiitio, it is clear that the p j values deote a probability measure sice p j 0 for all j ad ( j p j ( j 2 µ j z M~ µ j z! 2 s i ~from ~8!! It ca be verified for this atom distributio that ~ j E i # ( p j X! i µ i, j i,+++,, ~ j Var i # ( p j ~X! i µ i! 2 s 2 i, j i,+++,+ Furthermore, the maximum amog the radom variables for the jth atom is attaied by X j ~ j! + Thus, E : # ( j ~ j p j X! j z ( j j z M~ µ j z! 2 s 2 j # f : ~z!+ This atom distributio attais the upper boud o the expected value of the highestorder statistic ad satisfies the mea ad variace requiremets+ This verifies that the boud i Theorem is tight Solutio Techiques I geeral, it does ot seem possible to fid Z : i closed form+ A special case uder which this is possible is discussed ext Idetical Mea ad Variace For idetical mea variace pairs ~ µ, s 2!, solvig ~8! yields the optimal value for z : z µ s 2 2M +
8 674 D. Bertsimas, K. Nataraja, ad C.P. Teo Substitutig this ito ~6! yields the tight boud sup X i ; u ~ µ, s 2! i E : # µ sm + (0) Note that this is exactly ~2! obtaied by Arold ad for k + A distributio that attais this boud is radomly selectig elemets without replacemet from the set i which oe elemet has the value µ sm ad the remaiig elemets have the value µ s M Geeral Mea Variace Pairs For the geeral case, we outlie a simple bisectio search algorithm to fid Z : + Descriptio of the Algorithm + Iitialize z l ad z u such that ]f : ~z l!0]z 0 ad ]f : ~z u!0]z 0 ad e 0 to a give tolerace level+ 2+ Let z ~z l z u! While 6]f : ~z!0]z6 e, do: ~a! If ]f : ~z!0]z 0, set z u z; or else set z l z+ ~b! Go back to Step Output Z : f : ~z!+ We propose two simple upper ad lower bouds z u ad z l o the rage of the optimal z to iitialize the algorithm+ Cosider the problem of fidig a z u such that f ' ~z u! 0+ Oe such z u is costructed such that each term o the lefthad side of ~8! cotributes at least a fractio ~ 2!0: which reduces to z u µ i M~ µ i z u! 2 s 2, i,+++,, 2 i z u µ i s i 2 2M, i,+++,+ We choose z u as z u max i µ i s i 2 2M + () Similarly, a lower boud z l ca be foud such that z l µ i M~ µ i z l! 2 s 2, i,+++,+ 2 i
9 A z l that satisfies this coditio is z l mi i µ i s i 2 2M + (2) Our computatioal tests idicate that these values of z u ad z l lead quickly to the tight boud New ClosedForm Bouds Based o the two ed poits, we ow propose simple closedform bouds o the expected value of the highestorder statistic+ Theorem 4: Two closedform upper bouds o the expected value of the highestorder statistic give X ; u ~ m, s 2! are 2 ( µ i µ i max i µ i 2 2 i 2M s s i 2 ~2! max i µ i 2 2M s i, (3) 2 ( µ i µ i mi i µ i 2 2 i 2M s s i 2 ~2! mi i µ i 2 2M s i + (4) Proof: Substitute z z l ad z z u i ~6! respectively+ Note that ~3! ad ~4! reduce to the tight upper boud ~0! o the expected highestorder statistic for radom variables with idetical mea variace pairs Extesios TIGHT BOUNDS ON EXPECTED ORDER STATISTICS 675 We ow exted the results to the case where some of the s i 2 0 ~i+e+, X i is determiistic!+ Without loss of geerality, we assume that exactly oe variable is determiistic sice the case with multiple costats ca be reduced to this case by choosig the maximum of the costats+ Give radom variables with strictly positive variaces ad a costat K, we wat to fid the tight upper boud o E :, K!# + By itroducig a extra decisio variable, z, for the term K, ~4! reduces to sup E :, K!# X; u ~ m, s 2! mi z : ( z i z i M~ µ i z i! 2 s 2 i # ~K z! +
10 676 D. Bertsimas, K. Nataraja, ad C.P. Teo Usig a argumet similar to Theorem 2, it ca be checked that the optimal solutio will set all of the z i values the same at a value greater tha or equal to K+ Hece, the tight upper boud o the expected highestorder statistic is sup E :, K!# mi X; u ~ m, s 2! z K z ( which reduces to the costraied versio of ~6!: sup X; u ~ m, s 2! i z M~ µ i z! 2 s i 2 #, (5) E :, K!# mi f : ~z!+ (6) z K The tight upper boud ca be foud by a modified bisectio search method: + Solve the ucostraied versio of ~6! with bisectio search to fid z + 2+ Output f : ~max~z, K!!+ We propose usig the followig two closedform bouds i this case: ad f : max max i µ i 2 2M s i, K (7) f : max mi i µ i 2 2M s i, K + (8) 2.4. Extesios to Additioal Covariace Iformatio I this subsectio, we propose a algorithmic approach to fid the tight upper boud o the expected value of the highestorder statistic uder covariace iformatio+ Give the mea ad covariace matrix for the radom variables X ; u ~ m,q!, the tight upper boud is computed by fidig a distributio u that solves Z : sup u E : # s+t+ E # m E ' # Q mm ', E # + (9) Here I ~X! ifx ad zero otherwise represets the idicator fuctio+ This problem has bee well studied uder the class of momet problems i ad Karli ad To solve ~9!, we costruct the dual problem by itroducig variables y, Y, ad y 0 for each of the momet costraits+ The dual problem is formulated as
11 TIGHT BOUNDS ON EXPECTED ORDER STATISTICS 677 Z mi~ y ' m Y{~Q mm '! y 0! s+t+ y ' X X ' YX y 0 X :, X + (20) The costraits i ~20! imply the oegativity of a quadratic fuctio over + By takig the expectatio of the dual costraits, it is easy to see that Z Z : + Furthermore, showed that if the covariace matrix Q 0 is strictly positive defiite, the Z Z : + Uder this assumptio, the covexity of X : implies that the tight upper boud o the expected highestorder statistic is Z : mi~ y ' m Y{~Q mm '! y 0! s+t+ y ' X X ' YX y 0 X i, i,+++,, X + (2) Let e ~i! deote a uit vector with the ith compoet e i ~i! ad zero otherwise+ The equivalece betwee the global oegativity of a quadratic polyomial ad the semidefiite implies that ~2! ca be rewritte as Z : mi~ y ' m Y{~Q mm '! y 0! Y ~ y e s+t+ i!02 ~ y e i! ' 02 y 0 0, i,+++,+ (22) Here A 0 deotes the costrait that the matrix A is positive semidefiite+ Formulatio ~22! is a semidefiite optimizatio problem that ca be solved withi e 0 of the optimal solutio i polyomial time i the problem data ad I practice, stadard semidefiite optimizatio codes such as ca be used to fid the tight upper boud o the expected highestorder statistic uder covariace iformatio+ 3. BOUNDS ON EXPECTED k THORDER STATISTIC I this sectio, we geeralize our results to fid bouds o the expected value of the kthorder statistic for k uder mea variace iformatio o the radom variables; that is, Z k: sup E k: #+ X; u ~ m, s 2! Our results are based o the simple observatio that ( X i: i k X k: k + (23) We fid tight bouds o the expected value of the righthad side of ~23! to obtai bouds o the expected value of the kthorder statistic+
12 678 D. Bertsimas, K. Nataraja, ad C.P. Teo Theorem 5: The tight upper boud o the expected value of the sum of the kth to thorder statistic give X ; u ~ m, s 2! is obtaied by solvig sup X; u ~ m, s 2! E u ( i k X i: mi ~ k!z ( z i z M~ µ i z! 2 s 2 i # + (24) Proof: Usig the result from Bertsimas et the upper boud o the sum of the expected value of the kth to thorder statistic is sup X; u ~ m, s 2! E u ( i k X i: mi z ( i k z i: ( i z i M~ µ i z i! 2 s 2 i # + As earlier, ~25! ca be reduced to a siglevariable optimizatio problem+ To see this, let z be a optimal solutio to ~25!+ For ay l k with z l: z k:, we ca icrease z l: to z k: sice the first term is uaffected ~( i k z i: is uaffected by chage i z l:, for l k, provided z l: z k:! while the secod term decreases i z l: + Hece, we have z l: z k: for l k+ Furthermore, for l k with z l: z k:, by decreasig z l: to z k: the first term decreases at a rate of while the secod term icreases at a rate of at most + Sice we wat to miimize our objective, we have z l: z k: for l,+++,+ Usig ~23! ad Theorem 5, we ow obtai a boud o the expected kthorder statistic+ Theorem 6: A upper boud o the expected value of the kthorder statistic Z k: give X ; u ~ m, s 2! is obtaied by solvig Z k: mi z f k: ~z! mi z z i z M~ µ i z! 2 s 2 i # + 2~ k! Note that the ocovex structure of the kthorder statistic for k implies that ~26! is ot ecessarily tight for geeral mea variace pairs+ However, ~26! is at least as tight as ~! proposed by Arold ad This follows from observig that they obtaied their boud by boudig ~23!, although ot i the tightest maer+ A special case uder which ~26! is tight is described ext+ 3.. Idetical Mea ad Variace For idetical mea variace pairs ~ µ, s 2!, ~26! yields the optimal value for z : z µ s 2k 2 2M~k!~ k! + (25) (26)
13 Substitutig this ito ~26! yields sup X i ; u ~ µ, s 2!, i E k: # µ s k k + (27) This is exactly ~2! obtaied by Arold ad To see that ~27! is tight, cosider a distributio obtaied by radomly selectig elemets without replacemet from the set i which k elemets have the value µ sm ~k!0~ k! ad the remaiig k elemets have the value µ sm ~ k!0~k!+ It is easy to verify that this distributio attais the boud as described earlier Geeral MeaVariace Pairs For the geeral case, we propose the use of the bisectio search algorithm to fid the boud o the expected kthorder statistic by solvig mi z f k: ~z!+ The lower ad upper bouds o the rage of the optimal z to iitialize the bisectio search method i this case reduces to 2k 2 z u max i µ i s i (28) 2M~k!~ k! ad TIGHT BOUNDS ON EXPECTED ORDER STATISTICS 679 2k 2 z l mi i µ i s i (29) 2M~k!~ k! + Theorem 7: Two closed form upper bouds o the expected value of the kthorder statistic give X ; u ~ m, s 2! are Z k: f k: 2k 2 max i µ i s i (30) 2M~k!~ k!, Z k: f k: 2k 2 mi i µ i s i (3) 2M~k!~ k! + 4. COMPUTATIONAL RESULTS I this sectio, we evaluate the quality of the various bouds proposed i this article+ The first example is a applicatio of the highestorder statistic boud i a fiacial cotext+ The secod example is a simulatio experimet to compare the performace of the bouds for the geeral kthorder statistic+ The computatios were coducted o a Petium II ~550 MHz! Widows 2000 platform with the total computatioal time uder a miute+ 4.. Applicatio i Optio Pricig Oe of the cetral questios i fiacial ecoomics is to fid the price of a derivative security give iformatio o the uderlyig assets+ Uder a geometric Brow
14 680 D. Bertsimas, K. Nataraja, ad C.P. Teo ia motio assumptio o the prices of the uderlyig assets ad usig the oarbitrage assumptio, the Black formula provides a isightful aswer to this questio+ Assumig o arbitrage, but without makig specific distributioal assumptios, Bertsimas ad ad Boyle ad derived momet bouds o the prices of optios+ Our particular focus is o fidig bouds o the price of a optio kow as the lookback optio uder momet iformatio o the asset prices+ Let x, x 2,+++,x deote the price of a asset at differet times+ A simple lookback Europea call optio o these assets with strike price K 0 has a payoff of max~x : K,0!+ Let r deote the riskfree iterest rate ad T deote the maturity date+ Uder the oarbitrage assumptio, the price of the lookback optio is P~K! e rt E : K,0!#, (32) where the expectatio is take over the martigale measure+ Clearly, the price of this optio depeds o the highestorder statistic+ Uder mea ad variace iformatio o X i, Boyle ad proposed the followig upper boud o the price of the lookback optio: P~K! e rt ( i K M~ µ i K! 2 s 2 i #+ (33) We use the results from Sectio 2 to fid the best bouds o P~K!+ Note that although the asset prices are oegative i practice, we do ot model this explicitly here to compute our bouds+ The specific lookback optiopricig example is take from A upper boud o the price of a Europea call lookback optio over 0 time steps is calculated+ The riskfree iterest rate ~r! is 5% ad the time to maturity ~T! is year+ Table provides the mea ad variace iformatio of the asset prices over the 0 periods+ The bouds o the optio price are computed for strike prices K from 70 to 40 i steps of 0+ Table 2 provides six bouds uder mea variace iformatio ad Table. Mea Variace Data o Asset Prices Asset Price X i Mea µ i Variace s i 2 Asset Price X i Mea µ i Variace s i Source:
15 Table 2. Upper Boud o Lookback Call Optio Price Boud Tight mea variace boud ~6! Our closedform boud ~7! Our closedform boud ~8! Boyle ad Li s boud ~33! Arold ad Groeeveld s boud ~! Ave s boud ~3! Tight mea variace covariace boud ~22! K Source: 68
16 682 D. Bertsimas, K. Nataraja, ad C.P. Teo a additioal boud uder covariace iformatio+ For the last boud, we assumed that the asset prices were ucorrelated ad solved ~22! with the semidefiite optimizatio code SeDuMi+ From Table 2, it is observed that Boyle ad Li s boud is very loose for small values of K+ O average, our proposed closedform boud ~7! outperforms both Arold ad Groeeveld ad Ave boud, respectively+ Although the closedform boud ~8! is weaker for smaller K, it is i fact tight for larger K, idicatig its usefuless+ I Figure, we provide the graphical compariso of the bouds ~excludig Boyle ad Li boud, which is tight oly for large K! Simulatio Test The secod example is a simulatio test to compare the relative performace of the differet bouds uder radomly geerated momet iformatio+ We cosider 30 radom variables+ The mea variace pairs for each radom variable were idepedetly chose from a uiform distributio with µ i ; 50# ad s i 2 ; 400#+ Oe hudred mea variace pairs were sampled i these rages ad Figure. Upper boud o lookback call optio price+ From
17 TIGHT BOUNDS ON EXPECTED ORDER STATISTICS 683 the bouds o the expected order statistics were computed+ For each closedform boud, we evaluate the relative percetage error: Closed form boud Bisectio search boud Percetage error 00%+ Bisectio search boud For the highestorder statistic, the percetage error of the bouds are provided i Figure 2 ad Table 3+ Note that i this case, the bisectio search method fids the tight boud Z : + I this case, our closedform boud ~3! performs the best ad boud ~4! is relatively weaker+ We ext cosider the results for a lowerorder statistic+ Sice the upper boud for the lowestorder statistic Z : from ~23! simply reduces to ( µ i 0, we use the secod lowestorder statistic Z 2: to compare the bouds+ For this case, the bisectio search method does ot guaratee fidig the tight boud+ The results obtaied are preseted i Figure 3 ad Table 4+ For this case, our closedform boud ~4! is Figure 2. Deviatio of closedform bouds from tight boud o expected highestorder statistic+
18 684 D. Bertsimas, K. Nataraja, ad C.P. Teo Table 3. Statistics of Deviatio of ClosedForm Bouds for Expected HighestOrder Statistic Boud Mea % Error Std+ Dev+ % Error Our closedform boud ~3! Our closedform boud ~4! Arold ad Groeeveld s boud ~! Ave s boud ~3! observed to be tightest amog the closedform bouds, with a average percetage error of about %+ The simulatio results seem to idicate that the two closedform bouds perform well i reasoable settigs+ Iterestigly, i each of the two simulatios, the bestclosed form bouds were observed to be oe of our bouds+ Although Figure 3. Deviatio of closedform bouds from bisectio boud o secodorder statistic+
19 TIGHT BOUNDS ON EXPECTED ORDER STATISTICS 685 Table 4. Statistics of Deviatio of ClosedForm Bouds for Expected SecodOrder Statistic Boud Mea % Error Std+ Dev+ % Error Our closedform boud ~30! Our closedform boud ~3! Arold ad Groeeveld s boud ~! cases ca be costructed for which both of the bouds are weaker tha either Arold ad Groeeveld s ad Ave s bouds, the results suggest that the bouds are useful+ 5. SUMMARY I this article, we studied the problem of fidig tight bouds o the expected value of order statistics uder first ad secod momet iformatio o the radom variables+ For the highestorder statistic, we showed that the tight upper boud could be foud efficietly uder mea variace iformatio with a bisectio search method ad uder mea variace covariace iformatio with semidefiite programmig+ For the geeral kthorder statistic, we provided efficietly computable bouds ~ot ecessarily tight! uder mea variace iformatio+ Fidig tight bouds for the geeral kthorder statistic uder mea variace ad possibly covariace iformatio is a potetial research area for the future+ Ackowledgmet This research was supported i part by the Sigapore MIT alliace+ Refereces + Adrease, J+ ~998!+ The pricig of discretely sampled Asia ad lookback optios: A chage of umeraire approach+ Joural of Computatioal Fiace 2~!: Arold, B+C+ & Balakrisha, N+ ~989!+ Relatios, bouds ad approximatios for order statistics+ Lecture Notes i Statistics No+ 53+ Berli: SprigerVerlag+ 3+ Arold, B+C+ & Groeeveld, R+A+ ~979!+ Bouds o expectatios of liear systematic statistics based o depedet samples+ Mathematics of Operatios Research 4~4!: Ave, T+ ~985!+ Upper ~lower! bouds o the mea of the maximum ~miimum! of a umber of radom variables+ Joural of Applied Probability 22: Bertsimas, D+, Nataraja, K+, &Teo, C+P+ ~2004!+ Probabilistic combiatorial optimizatio: Momets, semidefiite programmig ad asymptotic bouds+ SIAM Joural of Optimizatio 5~!: Bertsimas, D+ & Popescu, I+ ~2002!+ O the relatio betwee optio ad stock prices: A covex optimizatio approach+ Operatios Research 50~2!: Black, F+ & Scholes, M+ ~973!+ The pricig of optios ad corporate liabilities+ Joural of Political Ecoomy 8: Boyle, P+ & Li, X+S+ ~997!+ Bouds o cotiget claims based o several assets+ Joural of Fiacial Ecoomics 46:
20 686 D. Bertsimas, K. Nataraja, ad C.P. Teo 9+ David, H+A+ & Nagaraja, H+N+ ~2003!+ Order statistics, 3rd ed+ New York: Wiley+ 0+ Gumbel, E+J+ ~954!+ The maximum of the mea largest value ad of the rage+ Aals of Mathematical Statistics 25: Hartley, H+O+ & David, H+A+ ~954!+ Uiversal bouds for mea rage ad extreme observatios+ Aals of Mathematical Statistics 25: Isii, K+ ~963!+ O the sharpess of Chebyshevtype iequalities+ Aals of the Istitute of Statistical Mathematics 4: Jagaatha, R+ ~976!+ Miimax procedure for a class of liear programs uder ucertaity+ Operatios Research 25~!: Karli, S+ & Studde, W+J+ ~966!+ Tchebycheff systems: With applicatios i aalysis ad statistics+ New York: Wiley Itersciece+ 5+ Lai, T+L+ & Robbis, H+ ~976!+ Maximally depedet radom variables+ Proceedigs of the Natioal Academy of the Scieces of the Uited States of America 73~2!: Lo, A+W+ ~987!+ Semiparametric upper bouds for optio prices ad expected payoffs+ Joural of Fiacial Ecoomics 9: Meilijso, I+ & Nadas, A+ ~979!+ Covex majorizatio with a applicatio to the legth of critical path+ Joural of Applied Probability 6: Moriguti, S+ ~95!+ Extremal properties of extreme value distributios+ Aals of Mathematical Statistics 22: Nesterov, Y+ & Nemirovkii, A+ ~994!+ Iterior poit polyomial algorithms for covex programmig+ Studies i Applied Mathematics 3+ Philadelphia: Society for Idustrial ad Applied Mathematics+ 20+ Parillo, P+A+ ~2000!+ Structured semidefiite programs ad semialgebraic geometry methods i robustess ad optimizatio+ PhD thesis, Califoria Istitute of Techology+ 2+ Ross, S+M+ ~2003!+ Itroductio to probability models, 8th ed+ New York: Academic Press+ 22+ Scarf, H+ ~958!+ A mimax solutio of a ivetory problem+ I K+J+ Arrow, S+ Karli, &H+ Scarf ~eds+!+ Studies i the mathematical theory of ivetory ad productio. Staford, CA: Staford Uiversity Press, pp Sturm, J+F+ SeDuMi versio +03+ Available from
3. Covariance and Correlation
Virtual Laboratories > 3. Expected Value > 1 2 3 4 5 6 3. Covariace ad Correlatio Recall that by takig the expected value of various trasformatios of a radom variable, we ca measure may iterestig characteristics
More information7. Sample Covariance and Correlation
1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y
More informationNPTEL STRUCTURAL RELIABILITY
NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationModified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
More informationTHE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
More informationChapter 6: Variance, the law of large numbers and the MonteCarlo method
Chapter 6: Variace, the law of large umbers ad the MoteCarlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More information1 Introduction to reducing variance in Monte Carlo simulations
Copyright c 007 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a uow mea µ = E(X) of a distributio by
More information4.1 Sigma Notation and Riemann Sums
0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed MultiEvent Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed MultiEvet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the BruMikowski iequality for boxes. Today we ll go over the
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 KolmogorovSmirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More informationResearch Article Sign Data Derivative Recovery
Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationCOMPARISON OF THE EFFICIENCY OF SCONTROL CHART AND EWMAS 2 CONTROL CHART FOR THE CHANGES IN A PROCESS
COMPARISON OF THE EFFICIENCY OF SCONTROL CHART AND EWMAS CONTROL CHART FOR THE CHANGES IN A PROCESS Supraee Lisawadi Departmet of Mathematics ad Statistics, Faculty of Sciece ad Techoology, Thammasat
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationVladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT
Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationGregory Carey, 1998 Linear Transformations & Composites  1. Linear Transformations and Linear Composites
Gregory Carey, 1998 Liear Trasformatios & Composites  1 Liear Trasformatios ad Liear Composites I Liear Trasformatios of Variables Meas ad Stadard Deviatios of Liear Trasformatios A liear trasformatio
More information1 Computing the Standard Deviation of Sample Means
Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.
More informationNonlife insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring
Nolife isurace mathematics Nils F. Haavardsso, Uiversity of Oslo ad DNB Skadeforsikrig Mai issues so far Why does isurace work? How is risk premium defied ad why is it importat? How ca claim frequecy
More informationThe analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection
The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity
More informationLECTURE 13: Crossvalidation
LECTURE 3: Crossvalidatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Threeway data partitioi Itroductio to Patter Aalysis Ricardo GutierrezOsua Texas A&M
More informationTHE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n
We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample
More informationCase Study. Normal and t Distributions. Density Plot. Normal Distributions
Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More informationA Faster ClauseShortening Algorithm for SAT with No Restriction on Clause Length
Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 4960 A Faster ClauseShorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece
More informationJoint Probability Distributions and Random Samples
STAT5 Sprig 204 Lecture Notes Chapter 5 February, 204 Joit Probability Distributios ad Radom Samples 5. Joitly Distributed Radom Variables Chapter Overview Joitly distributed rv Joit mass fuctio, margial
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationEntropy of bicapacities
Etropy of bicapacities Iva Kojadiovic LINA CNRS FRE 2729 Site école polytechique de l uiv. de Nates Rue Christia Pauc 44306 Nates, Frace iva.kojadiovic@uivates.fr JeaLuc Marichal Applied Mathematics
More informationSwaps: Constant maturity swaps (CMS) and constant maturity. Treasury (CMT) swaps
Swaps: Costat maturity swaps (CMS) ad costat maturity reasury (CM) swaps A Costat Maturity Swap (CMS) swap is a swap where oe of the legs pays (respectively receives) a swap rate of a fixed maturity, while
More informationInstitute of Actuaries of India Subject CT1 Financial Mathematics
Istitute of Actuaries of Idia Subject CT1 Fiacial Mathematics For 2014 Examiatios Subject CT1 Fiacial Mathematics Core Techical Aim The aim of the Fiacial Mathematics subject is to provide a groudig i
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More informationRRR 82013, AUGUST 21, 2013. email: jinwook.lee@rutgers.edu b RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854;
R U T C O R RE S E A R C H R E P O R T PRICEBANDS: A TECHNICAL TOOL FOR STOCK TRADING Jiwook Lee a Joohee Lee b Adrás Prékopa c RRR 82013, AUGUST 21, 2013 RUTCOR Rutgers Ceter for Operatios Research
More informationStatistical inference: example 1. Inferential Statistics
Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either
More informationMeasures of Spread and Boxplots Discrete Math, Section 9.4
Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More informationStochastic Online Scheduling with Precedence Constraints
Stochastic Olie Schedulig with Precedece Costraits Nicole Megow Tark Vredeveld July 15, 2008 Abstract We cosider the preemptive ad opreemptive problems of schedulig obs with precedece costraits o parallel
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam
More informationIrreducible polynomials with consecutive zero coefficients
Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem
More informationBASIC STATISTICS. f(x 1,x 2,..., x n )=f(x 1 )f(x 2 ) f(x n )= f(x i ) (1)
BASIC STATISTICS. SAMPLES, RANDOM SAMPLING AND SAMPLE STATISTICS.. Radom Sample. The radom variables X,X 2,..., X are called a radom sample of size from the populatio f(x if X,X 2,..., X are mutually idepedet
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationSubject CT5 Contingencies Core Technical Syllabus
Subject CT5 Cotigecies Core Techical Syllabus for the 2015 exams 1 Jue 2014 Aim The aim of the Cotigecies subject is to provide a groudig i the mathematical techiques which ca be used to model ad value
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationProject Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments
Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 612 pages of text (ca be loger with appedix) 612 figures (please
More informationUniversity of California, Los Angeles Department of Statistics. Distributions related to the normal distribution
Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chisquare (χ ) distributio.
More informationA Recursive Formula for Moments of a Binomial Distribution
A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,
More informationModule 4: Mathematical Induction
Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationTO: Users of the ACTEX Review Seminar on DVD for SOA Exam MLC
TO: Users of the ACTEX Review Semiar o DVD for SOA Eam MLC FROM: Richard L. (Dick) Lodo, FSA Dear Studets, Thak you for purchasig the DVD recordig of the ACTEX Review Semiar for SOA Eam M, Life Cotigecies
More informationChapter 7: Confidence Interval and Sample Size
Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum
More informationSolutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork
Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the
More informationThe Stable Marriage Problem
The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,
More informationKey Ideas Section 81: Overview hypothesis testing Hypothesis Hypothesis Test Section 82: Basics of Hypothesis Testing Null Hypothesis
Chapter 8 Key Ideas Hypothesis (Null ad Alterative), Hypothesis Test, Test Statistic, Pvalue Type I Error, Type II Error, Sigificace Level, Power Sectio 81: Overview Cofidece Itervals (Chapter 7) are
More informationSystems Design Project: Indoor Location of Wireless Devices
Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 6985295 Email: bcm1@cec.wustl.edu Supervised
More informationPROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUSMALUS SYSTEM
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUSMALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measuretheoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationDiscrete Random Variables and Probability Distributions. Random Variables. Chapter 3 3.1
UCLA STAT A Applied Probability & Statistics for Egieers Istructor: Ivo Diov, Asst. Prof. I Statistics ad Neurology Teachig Assistat: Neda Farziia, UCLA Statistics Uiversity of Califoria, Los Ageles, Sprig
More information1 Correlation and Regression Analysis
1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio
More informationOverview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
More informationChapter 5 Discrete Probability Distributions
Slides Prepared by JOHN S. LOUCKS St. Edward s Uiversity Slide Chapter 5 Discrete Probability Distributios Radom Variables Discrete Probability Distributios Epected Value ad Variace Poisso Distributio
More informationAQA STATISTICS 1 REVISION NOTES
AQA STATISTICS 1 REVISION NOTES AVERAGES AND MEASURES OF SPREAD www.mathsbox.org.uk Mode : the most commo or most popular data value the oly average that ca be used for qualitative data ot suitable if
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More informationNEW HIGH PERFORMANCE COMPUTATIONAL METHODS FOR MORTGAGES AND ANNUITIES. Yuri Shestopaloff,
NEW HIGH PERFORMNCE COMPUTTIONL METHODS FOR MORTGGES ND NNUITIES Yuri Shestopaloff, Geerally, mortgage ad auity equatios do ot have aalytical solutios for ukow iterest rate, which has to be foud usig umerical
More informationCONTROL CHART BASED ON A MULTIPLICATIVEBINOMIAL DISTRIBUTION
www.arpapress.com/volumes/vol8issue2/ijrras_8_2_04.pdf CONTROL CHART BASED ON A MULTIPLICATIVEBINOMIAL DISTRIBUTION Elsayed A. E. Habib Departmet of Statistics ad Mathematics, Faculty of Commerce, Beha
More informationMaximum Likelihood Estimators.
Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio
More informationwhere: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return
EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The
More informationEstimating Probability Distributions by Observing Betting Practices
5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,
More informationAnnuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.
Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio  Israel Istitute of Techology, 3000, Haifa, Israel I memory
More informationAn example of nonquenched convergence in the conditional central limit theorem for partial sums of a linear process
A example of oqueched covergece i the coditioal cetral limit theorem for partial sums of a liear process Dalibor Volý ad Michael Woodroofe Abstract A causal liear processes X,X 0,X is costructed for which
More informationDivide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015
CS125 Lecture 4 Fall 2015 Divide ad Coquer We have see oe geeral paradigm for fidig algorithms: the greedy approach. We ow cosider aother geeral paradigm, kow as divide ad coquer. We have already see a
More information.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth
Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,
More information8.1 Arithmetic Sequences
MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first
More informationChapter 7  Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:
Chapter 7  Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries
More informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More informationStock Market Trading via Stochastic Network Optimization
PROC. IEEE CONFERENCE ON DECISION AND CONTROL (CDC), ATLANTA, GA, DEC. 2010 1 Stock Market Tradig via Stochastic Network Optimizatio Michael J. Neely Uiversity of Souther Califoria http://wwwrcf.usc.edu/
More informationChair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics
Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES  CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More informationChapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity
More informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More informationDescriptive Statistics
Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote
More informationLecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.
18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: CouratFischer formula ad Rayleigh quotiets The
More information*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.
Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.
More informationProbabilistic Engineering Mechanics. Do Rosenblatt and Nataf isoprobabilistic transformations really differ?
Probabilistic Egieerig Mechaics 4 (009) 577 584 Cotets lists available at ScieceDirect Probabilistic Egieerig Mechaics joural homepage: wwwelseviercom/locate/probegmech Do Roseblatt ad Nataf isoprobabilistic
More informationHypergeometric Distributions
7.4 Hypergeometric Distributios Whe choosig the startig lieup for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationA Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design
A Combied Cotiuous/Biary Geetic Algorithm for Microstrip Atea Desig Rady L. Haupt The Pesylvaia State Uiversity Applied Research Laboratory P. O. Box 30 State College, PA 168040030 haupt@ieee.org Abstract:
More informationMeasures of Central Tendency
Measures of Cetral Tedecy A studet s grade will be determied by exam grades ( each exam couts twice ad there are three exams, HW average (couts oce, fial exam ( couts three times. Fid the average if the
More informationThis chapter considers the effect of managerial compensation on the desired
Chapter 4 THE EFFECT OF MANAGERIAL COMPENSATION ON OPTIMAL PRODUCTION AND HEDGING WITH FORWARDS AND PUTS 4.1 INTRODUCTION This chapter cosiders the effect of maagerial compesatio o the desired productio
More informationThe second difference is the sequence of differences of the first difference sequence, 2
Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for
More informationDesigning Incentives for Online Question and Answer Forums
Desigig Icetives for Olie Questio ad Aswer Forums Shaili Jai School of Egieerig ad Applied Scieces Harvard Uiversity Cambridge, MA 0238 USA shailij@eecs.harvard.edu Yilig Che School of Egieerig ad Applied
More information1 The Gaussian channel
ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.
More informationConfidence Interval Estimation of the Shape. Parameter of Pareto Distribution. Using Extreme Order Statistics
Applied Mathematical Scieces, Vol 6, 0, o 93, 4674640 Cofidece Iterval Estimatio of the Shape Parameter of Pareto Distributio Usig Extreme Order Statistics Aissa Omar, Kamarulzama Ibrahim ad Ahmad Mahir
More informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationA RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY
J. Appl. Prob. 45, 060 070 2008 Prited i Eglad Applied Probability Trust 2008 A RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY MARK BROWN, The City College of New York EROL A. PEKÖZ, Bosto Uiversity SHELDON
More information