Department of Mathematics Temple University~ Philadelphia
|
|
- Austen Casey
- 5 years ago
- Views:
Transcription
1 lsupported by the U.S. Army Research Office, Durham, under Contract No. DAHC0471C Supported by the Air Force Office of Scientific Research under Grant AFOSR EXTENDED OCCUPANCY PROBABILITY DISTRIBUTION CRITICAL POINTS by N.L. Johnson l Department of Statistics University of North Carolina at Chapel Hill S. Kotz 2 and R. Srinivasan Department of Mathematics Temple University Philadelphia Institute of Statistics Mimeo Series No. 934 June, 1974
2 EXTENDED OCCUPANCY PROBABILITY DISTRIBUTION CRITICAL POliHS By.J.L. Johnson, University of Horth Carol ina at Chapel Hill, S. Kotz and R. Srinivasan, Temple University, Philadelphia 1. Introduction In many instances of application of statistics, the underlying probabilistic problem can be described in terms of the following urn model: N balls are randomly allocated to K cells (so that each ball has probability 11K of falling into the ith cell, i = 1, 2,.., K). Each ball has probability p of staying in its cell and 1 P of I1falling through l1 (and hence not being available to 'fill' a cell). The random variable of interest here is the number x of 'occupied' cells, or equivalently the number K x of 'empty' cells. Several examples of situations leading to this urn model in biology, nuclear phyics and other fields are given in Feller (1968) and Harkness (1969). Our purpose here is to tabulate critical points of the distribution for various values of N, K and p. The case when p = 1 has already been treated at length by Nicholson (1961), and we shall therefore not include it here. A description of our tables is given in the next section. They are set out in a similar form to Nicholson's tahle. Critical roints corresponding to some of the values of Nand Knot covered in our tables can be approximated using certain limit theorems. This is discussed in Section 3. The classical occupancy distribution (corresponding to p = 1) gives the probability of exactly x occupied cells as
3 2 (1) Hl(x;K,N) = C\..: / x L (l)(xi) i=o J... tr N = (x = 0,1,., K) For general p, the number of balls not falling through is distributed binomially with parameters N,p and so the extended occupancy distribution is the corresponding mixture of classical occupancy distributions. The probability, tlp(x;k,n), of exactly x occupied cells is then the expected value of HI (x;k,j) with J distributed binomially with parameters H,p. Hence (2) H (x; K,N) P = These probabilities satisfy the recursion relation (3) KHp(x,K,N) = P(K+Ix)hp(xI;K,Nl) The rth factorial moment is + {px + (lp)k} H (x;k,ni) P (4) ll(r) = = = = where t(r) = t(tl)... (tr+l).
4 3 From (4) we obtain pressions for the expected value: (5.1) N K{l (lp/k) } and the variance (5.2). N N N K(Kl) {l2 (lp/k) 0+ (12p/K) } + K{l (lp/k) } = i( {lo:. (l_p/k)n} (l_p/k)n _ K(Kl) {(lp/k) 2N _ (1_2p/K)N} The rth factorial moment of the number of empty cells has the simpler form (6) K(r)(l _ pr/k)n (Harkness (1969)). 2. Description of Our Tables Using (3), we can find, for given K, X, P and lower tail area a, X the smallest N, say N I, such that Pr[x X K, Nl,p] = L H (x,k,n) a. These are presented in Table I for K = 2 (1) 20, P = 0.75,0.80,0.90, 0.95, 0.99, and a = 0.01, 0.025, 0.05, 0.10, and N l up to 60, along with the the actual tail probabilities a l = P [x X I K,N 1,p]. (For example, the entry N I = 17, a l = 0.019, corresponding to p =.99, K = 8, X = 5 and a = in Table I means that Pr[x 5 I 8, 17, 0.99] = 0.019, Pr[x 5 I 8, N, 0.99] > for N < 17, and that Pr[x 5 I 8, N, 0.99] < for N > 17). There is one exception to this system. If there is a value N 1 such that Pr[X x I K, N I, p] lies between a and a this is the value given in the tables. The corresponding value of a l is given as a +. x=o p
5 4 Similarly, using the recursion relations; for the same values of K, X, P and Ct we have tabulated the upper tail critical values N 2 and the corresponding probabilities Ct 2 in Table II. Here, for given K, X, P and Ct, N Z is the largest value of N such that Pr[x X K, N, il] Ct, and Ct = Pr[x X I K, N, 2 p]. (For example, 2 =.021, corresponding to p = 0.80, K = 10, X = 9 the entry N 2 = 12, Ct 2 in Table II means that p[x 9 I 10, 12, 0.80] = 0.021, 10, N, 0.80] < for N $' 12, and that Pr[x 9Il0,N.0.80] ;> for N > 12,.) Dash marks () in table II indicate the nonexistence of N 2 for given K, X and Ct. Here again, as an exception if there is an N such that Ct < 2 P [x X I K, N, p] < Ct + r this + is the value given in the tables, with Ct given as Ct 2 In both lower and upper tail tables the entry > 60 is used when the exact value is beyond the range of calculations we have carried out. 3. Approximations Harkness (1969) has suggested that a binomial with parameters K, 1 (l_p/k)n would give a good approximation to the distribution (2). This approximation gives the correct mean (see (5.1)) and is exact for K = 1. It would be expected to give good results for p small, since the mixing distribution of J (see Section 2) may then be approximated by a Poisson (with parameter Np), and as Harkness shows a mixture of classical occupancy distributions with such a Poisson mixing distribution is, in fact a Binomial distribution.
6 5 If the binomial approximation is good, then Molenaar's (1970) normal approximation to the binomial may be used to get approximate expressions for N l and N 2 Writing (7) wen) = 1 (l_p/k)n we have from Molenaar's 'quick work' approximation (1970, p. 110) for a.. ::; 0.05 J (8.1) (3.2) where 1 foo 2 (I;f.;) V exp( ) du = a.. a. T.e equations for a.'. > 0.05 are of similar form. J In order to solve equations of form AIlw(N) B/w(N) = V we write wen). 2 e = SIn = sin rp and get where (9) wen) T (when A 2 +B 2 < V 2 this equation is not applicable, but since A 2 +B 2 is about 2 4K while hhe largest V we need is 5.4, this imposes little restriction.)
7 6 Once from (7). w(n.) J has been found we can calculate the corresponding N. J Some trial calculations with K = 20 indicated that when p 0.75 this approximation gives values of N which are too big by some 24 l units and of N which are too small by some 12 units, at any rate for 2 a = Further asymptotic formulae will be found in SamuelCahn, (1974).
8 7 REFERENCES 1. F.N. David, (1950). Two combinatorial tests of whether a sample has come from a given population, Biometrika, 37, W. Feller, (1968). An Introduction to Probability Theory and its Applications s New York: John Wiley &Sons, Inc. 3. W.L. Harkness, (1969). The czassical occupancy problem revisited, Pennsylvania State University, Dept. Statistics, Technical Report No W. Molenaar, (1970). Approximations to the Poisson, Binomial and Hypergeometric Distribution Functions, Mathematical Centre Tracts No. 31, Math. Centrum, Amsterdam. 5. N.L. Nicholson, (1961). Occupancy distribution critical points, Biometrika, 48, Ester Samue1Cahn, (1974). Asymptotic distributions for occupancy and waiting time problems with positive probability of falling through the cells, Annals of Probability, 2,
9 .'_., co Lower tail critical points _...,_...._..' _._._._..._... p =.75 p =.75 '_._".' Lower tail probability level a. Lmrer tail probability tvei C _...,",,'".,.._..._._._.... _. N N N N N N a lit fj,j. N _._,..... _._ ( ' ' } , I "028 9.C ,..,..J.., Ol ' "01; _ h o 2 030i _
10 . 0'\ Lo tail critical E.oints _...'_ p =.75 p =.75._.,...,_... Lower tail probability level C't Lower tail proability level C't _., N 1 C't 1 N 1 C't 1 N 1 C't 1. ".. H 1 C't 1 _..._... N 1 <Xl 11 1 C't 1 iii C't 1 N"1 C't 1 _ ' , :> q l In a ' _
11 R....._._._..._ ".._... Lower tail critical J2..oints._.. p =.75 p =.75 Lower tail probability level Lower tail probability level 0 _._. K 11 N 1 1IJ N 1 N 1 N N 1 a 1.L 0.1 'I 1).1 1).1 '1 1).1 1).1 al..,_ "' 4_., = / q " "' r; l _ _ _ ') 14 9.) , Oll , , ,
12 ,.,..._ _. _ '" _._ Lower tail critical points..._ '.._..... _.._..._._._.. '"._.....,_.0_ P =.75 P =.75 Lower tail probability level a,_._,_._,,_._. LmTer tail probability level a _....; _..._,.. '..._._,...._ HI a N a N a 1 N 1 a 1 J 1 "'1 a N 1 1 a 1 HI a N a 1 1 1,_.._ _ '" _ >(.') > ) "' "' '.j " II '"' ".. u ,... _...
13 5 5. N Upper tail critical points. p =.75 p =.75 Upper tail probability level I), Upper tail probability level I), K X T( h X :JII 2 1),2 N 2 1),2 N a J'T ),2 1'1 a. ]\1 2 2 '2 1),2 N 2 1),2 N a ,.""., , 6 "..> 'T U '... _ <'" ,,,, 6 _. h ""' ' ,".. ' " 6 5 '" _ _ q , c , _..... c./ _.
14 t').l Yer tail critical point. p =.75 p =.75,' Upper tail probability level C't. Upper tail probability level C't. N _._ N 0. N lit C't. C't N 2 C't. N C't.. 2 "2 IJ ' _ N ' , '"' ) Pi o _. <"'" ", _ _ l _.. _. 0..' :' 7.. ' (3., C\,/ f) oll
15 ,..... 'd"..4 Yil critical points p =.75 p =.75 _.._,_...._..._,.. Upper tail probability level a Upper tail probability level a N 2 lx 2 N 2 lx 2 N 2 lx 2 l\t T,T 0. 2 N,., a 2 ]IT 0. 2 "2 ;;;: '2 N f5 17.e It) l "'" _. _..."" "' ".' r { _ ! f ' _ / , ,OIl lq , f J ,009 50,
16 _.._._._._. "_. _",,, _.,......_...'....._....' l/)...t.. p =.80._.... """'. 4 Lower tail probability level u _..,. _.._.. Lower tail ritica!. p?ints.. _. _ _ _.,... _..._ _... _._N....,_.._ _._ p =.80 _._.._...._._.. Lower tail probability level u... _..._...,.._._ _..,_.,... K X A 6 :( X N u 1 1 HI u N u N u 1 N._._.. _... 1 '\.. _.w_ _...,._.._ ,.. "1 N 1 u 1 TT u l N 1 '\ , J t:: "" _ , , " OOG u 9,
17 u '... A_._ 1; "' _._,...,..._....._...,._. 55 \0...i &ovrer_ ail_... _.... _... _.. critical points _._...._ _ _......_._,_... p =.80 l' =.80 Lower tail probability level a Lower tail probability level a N a N rt a !III a 1 :N a. IJ a 1 N 1 a 11 1 'I 1 a : let> l "' _ " ( , : l f"i ;; ,
18 ...,, r..1 J:,owe tail ri.!ical :e,.oints ,,....._,.,... _._._._._...,._..._. _... _... _......_._._.... _..... e.... p =.80 p = _,_._._ Lower tail probability level a Lower tail probability level..._,... "._... '''h._._....,..._.. _.._..._.._.._ _...._...._._.._._. _ _ W l 1 N l Ct 1 N ,,.._..._.... _... 1'1 '1 1\1 1 N l 1 II I l N ' _ q ll _ _ _ " ""., "0' JOO
19 ,./ 00...,_. Lme! t!lg c}'_ii point!.. _ _. L._,. _..._', _... _.,, "._......_,'._._.;,..._',. p =.80 p =.80,._..,._...._.._ Lower tail probability level (1 Lower tail probability level (1 _._._,,_._.._..._,.... _..._._._... _._._._,,'_. _..._. III lit (11 (11... N N N l 1 l (11 1'1 6\.T (11 (11 1 (11 1'1 "'1 '1..'>... _......_. _.._..,.._._, _.._.,.,_..._.,_..,_._ (11 N 1 (11 ".," ! , M ,, < >:;0,.."" >61 _..,.,.,.' "c'> ! ') , h r )! _ , "....., _ '"". ",,
20 )..l Upper tail critical points p =.80 p =.80 Upper tail probability level (l Upper tail probability level (l N 2 (l2 N 2 <X 2 JlT 2 (l2 N 2 (l2 T2 (l2 N \1"2 (l2 N 2 (l2 4 4 _. _ , CO" " ' I OlO Olf Oll '' '. 00' '" " '. " 'r """,...'. ".' "., (, , 7 "' '.. 'I.", <"' 8 "' 8.Oll , , _
21 ,.... o N Upper:. tail c_ritical poit:lts p =.80 p =.80 Upper tail probability level a Upper tail probability level a. N 2 0. N 2 2 (12 N 2 0. N 2 0. ',r 2 0. N N 2 L a" c:. ' u'2 1\T , Q " '., (1..../ "'"" / ,.. 6, , _ , () 9.010,_:> l ""' "' <'< 7,, O
22 N Upper tail critical POi1tS p =.80 p =.80._ Upper tail probability level a Upper tail probability level a._.,,..<_._., _. N a N a N' a a 1\T 2 a N 2 2 a }IT a 2 lj a " f l j _. < a./ : '?O
23 N N..._...._...._'_._.._....._.'.,. ow tai..j.:. critic:tl_ points._..._._... _ _._._,... _..._._..._.._.. _...._. p =.90 P =.90 Lower tail probability level a _._._ Lower tail probability level a. _._... '_. _._. M.... _.. _.,'W... _...._,.. '.....' N _'_._,... "_ N N _.. ' _..._... _.... _.. e. N 1 ell H 1 0. N 1 1 ell N '1 a H 1 1 ell,._ _.... """' '.O'._d. _._.., '" = ,' ':J O J , K;o Q "':..050
24 .._., 4 _,,_ _._ t<") N,.._..._.... Lower tail critical points _. _._ ,......'..._.._._..._.._._...._._._._...._. '.... p =.90 p =.90 Lower tail probability level a. L01rer tail probability level a _._._._'_._ "...'.,,..._.....,..,,_.....'.._.._'..._. N a N (l1 N 1 (l1 F (l1 1\T 'I '1 (l1 N a N (l1 N 1 (l1... _.._ :\ J ,. """" '.' 10 _ ) l 'r _ '
25 59 _. 4._..,.,. 57 '<:t N r...o_e!_j;_a...i_1_.!_t.i.caj..1'oint...._ p =.90 P =.90 Lower tail probability level a Lower tail probability level a....._,..._... CH _, '' "._c... _,_. _.,,,.. w_c_...!'i 1 (Xl 'tit a 1 N 1 a 1 N a 1 IJ a 1 N 1 a 1 H 1 (Xl N 1 (Xl ',", >O.....' ",0 18., "' l " II _..
26 ... 59,'.._._...._.... L!'l N ' _.#_._._...._....,... _._.,_..,.,.. LT_e! :t.i_1 c:rj::t.ia1_.:e9ints ' _. _.._.> _._ _.._ _ "' p =.90 p =.90 _...,. Lower tail probability level 0. Lower tail probability level 0. K X K X , _,,.._... '_.. _.._... '," _..._ HI Ct TiT 1 '1 0. N 1 1 Ct. N N 1 l 0. 1 HI 0. 1 '1 _._..,_..._.,,,...._...'.._.'..._...._. u._. #,_.._"'.< '..,...,. _..._ c lj (\ N 1 Ct , , ,/ _. _ I' rr
27 \0 N Upper tail crtica1 points p =.90 p ::;:.90 Upper tail probability level Upper tail probability level.._.... K X I( X :N 2 2 N 2 2 N 2 2 N r 2 N,., 2 JlT N t! c_ ' &". r ". 7.. o r',., _ ) l _ " Ij.."" _ OO' _.. r.' ,,..,..." , " '7 I """
28 _.,.,.' 9 l" N Upper tail critical point p =.90 p = 90 Upper tail probability level u Upper tail probability level a N u N u N u N Ct l'j 2 u N u lit u 2 N u '" ""' l1.t IS J " <.' _. '" a..03!t ).j , _../ <, _
29 00 N UFper tail critical points p =.90 p = 90 Upper tail probability level a Upper tail probability level Ct._ J N Ct N Ct N a N Ct J'2 Ct N 2 2 Ct N Ct N Ct G J , , ""
30 _. 0'1 N _..,,_...'..... LmTex: ail_ E..r.J:_ical poii_i?.,'_. _ _._....,..,.. _._...,.... _._....._..._..._ p =.95 p =.95,.... Lower tail probability level a Lower tail probability level..._..._._.._..._..._,..._... _. _.....,._...,.._..._..._... _. '*_.,_..., K X T' v A _,_. _.._. 1'..._..._._...' ,_ _. N WI (Xl "'1 N 1 1 (Xl HI (Xl "J N 1 1 (Xl N (Xl N (Xl.., _.. _...._'_._ 'c _ ll ' ';) , J _ ,.
31 ..._..._ u_._._.. _....,.._._. 0 _.._....,._._._. _..._._,.,,....' _,._. n. Lower tail critic'u E.oints,..._..._._.._,...._._...,. p =.95 P =.95 _.._.... _.._,' _..._... Lower tail probability level a,._......_..... _ _. Lower tail probability level a.._.._...._.._a _.._. _...,....,._ N a JIT a N a N a l 1 l 1'T a ';IT a 'T 1 l 1 l l Cl. l _.._"". _..._... _... _..._.._..._.,_..._..._. II J:; " : ;......,,, ) _. "., N 1 a l
32 ... '_.... <.... _,.... _. '._'. _._... _,_.._....,_c_ _ rl 1'1') Lower_ ail crit. poin ,'_,_... _..,... _ _._ p =.95 p =.95 Lower tail probability level a..._'..,,..._...,_._.._._.._._.._._._..._""_...._...,. "....._. b'. _ _.._._.. _. Lower tail probability level a _.. _._. '"''...._..._.._._ '_.'","'_.,, _... _..._._._._. N a N 1 1 (l1 N l'j 1 (l1 (l1 H' (l1 TIT (l1 1'1 l'j 1 '1 "1 1 a a ,_..._._., w.._ _..'. _ ",. "...._ _ l l oln t a<" O!l ""," ,.'" '
33 ..._...._ N I") _. Lower _... tail critical points..... w _.....,"_._...._......_._ _ _, '., _, p =.95 p =.95 Lower tail probability level (l _.._.._...._ Lower tail probability level a.._ _.. _...._...,_. _......_..._.'.., K X rr X _._.._._..."_.,...' _.. N l (l1 N 1 (l1 N l (l1 1\1 1 a 1 N 1 a 1 "1,.,..oO_.,'. =,..._..... _...,... _....._ '. (l1 N 1 a 1 N 1 _.._ (l l ::" : : ,'" " , , , , _., " ; ,, _
34 .. _.." ti') ti') Upper tail critical points p =.95 p =.95 Upper tail probability level a, Upper tail probability level a 4 4 N a TeT a N 2 2 a N a '"2 2!J a N 2 2 C!2 JlT 2 lx N '2 a 2 " ll 9 a ". O'.. _ ,,, =,, o 'J ' _ , ",' '., _.. 0 0'
35 _.. _._. f") Upper tail critica:j._ ;ps>ints p =.95 p =.95 Upper tail probability level ex Upper tail probability level a _.. N 2 a 2 N 2 a 2 N 2 a 2 J'i 2 a 2! l\t 2 a 2 n N 2 a _ ; OO r,.' ).087 &..., = " _ _ v oB
36 9 Lfl rj") Upper tail critical poip p =.95 Upper tail probability level a K X N N N N 0.2 ;:> , _ ' \ olo
37 R._...._..,'._. _.._._._...._..._.._._.._..._..._._._... _.,._.. 58 ", \0 I"').._...._.._._, _.._._._. Lower tail critical points,... _._._._,._..._._..._.. p = 99 P =.99 _'... "..._. J_...."',_ Lower tail probability level Lower tail probability level... _.,_... _ _ _....._.... _.w._. K X I( v f _.,.... _ _.._ _,..._ N ' N l 1 N l 1 N l 1 "'r 1 N 'J (1,1 N 1 ''''1 l C1. 1,_.. _ _... '...'_._ () 3 ' 'i """ ) , : 'I ooh ooa i <:, <
TABLES OF DISTRIBUTIONS OF QUADRATIC FORMS IN CENTRAL NORMAL VARIABLES II. Institute of Statistics Mimeo Series No. 557.
TABLES OF DISTRIBUTIONS OF QUADRATIC FORMS IN CENTRAL NORMAL VARIABLES II N. L. Johnson* and Samuel Kotz** University of North Carolina Chapel Hill, N. C. Temple University Philadelphia, Pa. Institute
More informationAPPH 4200 Physics of Fluids
APPH 42 Physics of Fluids Problem Solving and Vorticity (Ch. 5) 1.!! Quick Review 2.! Vorticity 3.! Kelvin s Theorem 4.! Examples 1 How to solve fluid problems? (Like those in textbook) Ç"Tt=l I $T1P#(
More information~,. :'lr. H ~ j. l' ", ...,~l. 0 '" ~ bl '!; 1'1. :<! f'~.., I,," r: t,... r':l G. t r,. 1'1 [<, ."" f'" 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'..
,, 'l t (.) :;,/.I I n ri' ' r l ' rt ( n :' (I : d! n t, :?rj I),.. fl.),. f!..,,., til, ID f-i... j I. 't' r' t II!:t () (l r El,, (fl lj J4 ([) f., () :. -,,.,.I :i l:'!, :I J.A.. t,.. p, - ' I I I
More informationJ2 e-*= (27T)- 1 / 2 f V* 1 '»' 1 *»
THE NORMAL APPROXIMATION TO THE POISSON DISTRIBUTION AND A PROOF OF A CONJECTURE OF RAMANUJAN 1 TSENG TUNG CHENG 1. Summary. The Poisson distribution with parameter X is given by (1.1) F(x) = 23 p r where
More informationON THE AVERAGE NUMBER OF REAL ROOTS OF A RANDOM ALGEBRAIC EQUATION
ON THE AVERAGE NUMBER OF REAL ROOTS OF A RANDOM ALGEBRAIC EQUATION M. KAC 1. Introduction. Consider the algebraic equation (1) Xo + X x x + X 2 x 2 + + In-i^" 1 = 0, where the X's are independent random
More informationMAC 1147 Final Exam Review
MAC 1147 Final Exam Review nstructions: The final exam will consist of 15 questions plu::; a bonus problem. Some questions will have multiple parts and others will not. Some questions will be multiple
More informationA NOTE ON CONFIDENCE BOUNDS CONNECTED WITH ANOVA AND MANOVA FOR BALANCED AND PARTIALLY BALANCED INCOMPLETE BLOCK DESIGNS. v. P.
... --... I. A NOTE ON CONFIDENCE BOUNDS CONNECTED WITH ANOVA AND MANOVA FOR BALANCED AND PARTIALLY BALANCED INCOMPLETE BLOCK DESIGNS by :}I v. P. Bhapkar University of North Carolina. '".". This research
More informationConcentration of Measures by Bounded Couplings
Concentration of Measures by Bounded Couplings Subhankar Ghosh, Larry Goldstein and Ümit Işlak University of Southern California [arxiv:0906.3886] [arxiv:1304.5001] May 2013 Concentration of Measure Distributional
More informationLectures on Elementary Probability. William G. Faris
Lectures on Elementary Probability William G. Faris February 22, 2002 2 Contents 1 Combinatorics 5 1.1 Factorials and binomial coefficients................. 5 1.2 Sampling with replacement.....................
More informationPAijpam.eu REPEATED RANDOM ALLOCATIONS WITH INCOMPLETE INFORMATION Vladimir G. Panov 1, Julia V. Nagrebetskaya 2
International Journal of Pure and Applied Mathematics Volume 118 No. 4 2018, 1021-1032 ISSN: 1311-8080 printed version; ISSN: 1314-3395 on-line version url: http://www.ipam.eu doi: 10.12732/ipam.v118i4.16
More informationUnivariate Discrete Distributions
Univariate Discrete Distributions Second Edition NORMAN L. JOHNSON University of North Carolina Chapel Hill, North Carolina SAMUEL KOTZ University of Maryland College Park, Maryland ADRIENNE W. KEMP University
More informationASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES
ASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES KAI LAI CHUNG The limiting distribution of the maximum cumulative sum 1 of a sequence of independent random variables
More informationMathematical Statistics 1 Math A 6330
Mathematical Statistics 1 Math A 6330 Chapter 3 Common Families of Distributions Mohamed I. Riffi Department of Mathematics Islamic University of Gaza September 28, 2015 Outline 1 Subjects of Lecture 04
More informationCOUPON COLLECTING. MARK BROWN Department of Mathematics City College CUNY New York, NY
Probability in the Engineering and Informational Sciences, 22, 2008, 221 229. Printed in the U.S.A. doi: 10.1017/S0269964808000132 COUPON COLLECTING MARK ROWN Department of Mathematics City College CUNY
More informationOn Expected Gaussian Random Determinants
On Expected Gaussian Random Determinants Moo K. Chung 1 Department of Statistics University of Wisconsin-Madison 1210 West Dayton St. Madison, WI 53706 Abstract The expectation of random determinants whose
More informationYears. Marketing without a plan is like navigating a maze; the solution is unclear.
F Q 2018 E Mk l lk z; l l Mk El M C C 1995 O Y O S P R j lk q D C Dl Off P W H S P W Sl M Y Pl Cl El M Cl FIRST QUARTER 2018 E El M & D I C/O Jff P RGD S C D M Sl 57 G S Alx ON K0C 1A0 C Tl: 6134821159
More informationPolytechnic Institute of NYU MA 2212 MIDTERM Feb 12, 2009
Polytechnic Institute of NYU MA 2212 MIDTERM Feb 12, 2009 Print Name: Signature: Section: ID #: Directions: You have 55 minutes to answer the following questions. You must show all your work as neatly
More informationSOLUTION SET. Chapter 9 REQUIREMENTS FOR OBTAINING POPULATION INVERSIONS "LASER FUNDAMENTALS" Second Edition. By William T.
SOLUTION SET Chapter 9 REQUIREMENTS FOR OBTAINING POPULATION INVERSIONS "LASER FUNDAMENTALS" Second Edition By William T. Silfvast C.11 q 1. Using the equations (9.8), (9.9), and (9.10) that were developed
More information= P k,j = l,,nwhere P ij
UNIVERSITY OF NORTH CAROLINA Department of Statistics Chapel Hill, N. C. ON A DISTRIBUTION OF SUM OF IDENrICALLY DISTRIBUTED CORRElATED GAMMA VARIABIES by S. Kotz and John W. Adams June 1963 Grant No.
More informationLEVE ~ TECHNICAL DONNA LUCAS JANUARY 1979 U.S. ARMY RESEARCH OFFICE RESEARCH TRIANGLE PARK, NORTH CAROLINA DAAG C-0035
i / / w,qel /4 I7qpq,fl/ LEVE ( ti ORDERING OF CONCOMITANTS OF ORDER STATISTICS, WITH APPLICATIONS TECHNICAL DONNA LUCAS JANUARY 1979 US ARMY RESEARCH OFFICE RESEARCH TRIANGLE PARK, NORTH CAROLINA DAAG2977C0035
More informationMAXIMUM LIKELIHOOD ESTIMATION FOR THE GROWTH CURVE MODEL WITH UNEQUAL DISPERSION MATRICES. S. R. Chakravorti
Zo. J MAXIMUM LIKELIHOOD ESTIMATION FOR THE GROWTH CURVE MODEL WITH UNEQUAL DISPERSION MATRICES By S. R. Chakravorti Department of Biostatistics University of North Carolina and University of Calcutta,
More informationP a g e 5 1 of R e p o r t P B 4 / 0 9
P a g e 5 1 of R e p o r t P B 4 / 0 9 J A R T a l s o c o n c l u d e d t h a t a l t h o u g h t h e i n t e n t o f N e l s o n s r e h a b i l i t a t i o n p l a n i s t o e n h a n c e c o n n e
More informationTHE POISSON TRANSFORM^)
THE POISSON TRANSFORM^) BY HARRY POLLARD The Poisson transform is defined by the equation (1) /(*)=- /" / MO- T J _M 1 + (X t)2 It is assumed that a is of bounded variation in each finite interval, and
More informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationA/P Warrants. June 15, To Approve. To Ratify. Authorize the City Manager to approve such expenditures as are legally due and
T. 7 TY LS ALATS A/P rrnts June 5, 5 Pges: To Approve - 5 89, 54.3 A/P rrnts 6/ 5/ 5 Subtotl $ 89, 54. 3 To Rtify Pges: 6-, 34. 98 Advnce rrnts 5/ 6/ 5-4 3, 659. 94 Advnce rrnts 6/ / 5 4, 7. 69 June Retirees
More informationI-1. rei. o & A ;l{ o v(l) o t. e 6rf, \o. afl. 6rt {'il l'i. S o S S. l"l. \o a S lrh S \ S s l'l {a ra \o r' tn $ ra S \ S SG{ $ao. \ S l"l. \ (?
>. 1! = * l >'r : ^, : - fr). ;1,!/!i ;(?= f: r*. fl J :!= J; J- >. Vf i - ) CJ ) ṯ,- ( r k : ( l i ( l 9 ) ( ;l fr i) rf,? l i =r, [l CB i.l.!.) -i l.l l.!. * (.1 (..i -.1.! r ).!,l l.r l ( i b i i '9,
More information176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s
A g la di ou s F. L. 462 E l ec tr on ic D ev el op me nt A i ng er A.W.S. 371 C. A. M. A l ex an de r 236 A d mi ni st ra ti on R. H. (M rs ) A n dr ew s P. V. 326 O p ti ca l Tr an sm is si on A p ps
More informationON THE HARMONIC SUMMABILITY OF DOUBLE FOURIER SERIES P. L. SHARMA
ON THE HARMONIC SUMMABILITY OF DOUBLE FOURIER SERIES P. L. SHARMA 1. Suppose that the function f(u, v) is integrable in the sense of Lebesgue, over the square ( ir, ir; it, it) and is periodic with period
More informationInferences on a Normal Covariance Matrix and Generalized Variance with Monotone Missing Data
Journal of Multivariate Analysis 78, 6282 (2001) doi:10.1006jmva.2000.1939, available online at http:www.idealibrary.com on Inferences on a Normal Covariance Matrix and Generalized Variance with Monotone
More informationSuppose that you have three coins. Coin A is fair, coin B shows heads with probability 0.6 and coin C shows heads with probability 0.8.
Suppose that you have three coins. Coin A is fair, coin B shows heads with probability 0.6 and coin C shows heads with probability 0.8. Coin A is flipped until a head appears, then coin B is flipped until
More informationarxiv: v2 [math.pr] 9 Sep 2017
Urn models with two types of strategies Manuel González-Navarrete and Rodrigo Lambert arxiv:1708.06430v2 [math.pr] 9 Sep 2017 Abstract We introduce an urn process containing red and blue balls U n = (R
More informationl(- oo)-~j [-I <. )( L6\ \ -J ~ ~ ~~~ ~~L{ ,~:::-=r\ or L":: -j) {fevylemr.eor k, ("p J~ -4" e S ' e,~ :; ij or J iv I 0"'& ~~ a. 11 qa.
Algebra II Midterm Exam Review Solve: R view of Algebra 1 4. 215x + 31 = 16 /5xt3 1:: & 3 :: 2.1 3" ::. -J5 /,:::-=r\ or L":: -j) 2. II-2xl = 15 / j - ;).'1 -:.115 00( 1-).)(":.-15 - X-: 1"1 by:-t3-8 5
More informationurn DISTRIBUTED BY: National Technical Information Service U. S. DEPARTMENT OF COMMERCE Prepared for: Army Research Office October 1975 AD-A
- MMHH^MiM^^MaMBMMMHH AD-A017 637 AN EXTENSION OF ERLANG'S LOSS FORMULA Ronald W. Wolff, et a1 California University Prepared for: Army Research Office October 1975 urn DISTRIBUTED BY: National Technical
More informationz E z *" I»! HI UJ LU Q t i G < Q UJ > UJ >- C/J o> o C/) X X UJ 5 UJ 0) te : < C/) < 2 H CD O O) </> UJ Ü QC < 4* P? K ll I I <% "fei 'Q f
I % 4*? ll I - ü z /) I J (5 /) 2 - / J z Q. J X X J 5 G Q J s J J /J z *" J - LL L Q t-i ' '," ; i-'i S": t : i ) Q "fi 'Q f I»! t i TIS NT IS BST QALITY AVAILABL. T Y FRNIS T TI NTAIN A SIGNIFIANT NBR
More informationUsing the Rational Root Theorem to Find Real and Imaginary Roots Real roots can be one of two types: ra...-\; 0 or - l (- - ONLl --
Using the Rational Root Theorem to Find Real and Imaginary Roots Real roots can be one of two types: ra...-\; 0 or - l (- - ONLl -- Consider the function h(x) =IJ\ 4-8x 3-12x 2 + 24x {?\whose graph is
More informationMath 180B Problem Set 3
Math 180B Problem Set 3 Problem 1. (Exercise 3.1.2) Solution. By the definition of conditional probabilities we have Pr{X 2 = 1, X 3 = 1 X 1 = 0} = Pr{X 3 = 1 X 2 = 1, X 1 = 0} Pr{X 2 = 1 X 1 = 0} = P
More informationTESTS FOR LOCATION WITH K SAMPLES UNDER THE KOZIOL-GREEN MODEL OF RANDOM CENSORSHIP Key Words: Ke Wu Department of Mathematics University of Mississip
TESTS FOR LOCATION WITH K SAMPLES UNDER THE KOIOL-GREEN MODEL OF RANDOM CENSORSHIP Key Words: Ke Wu Department of Mathematics University of Mississippi University, MS38677 K-sample location test, Koziol-Green
More informationSample Spaces, Random Variables
Sample Spaces, Random Variables Moulinath Banerjee University of Michigan August 3, 22 Probabilities In talking about probabilities, the fundamental object is Ω, the sample space. (elements) in Ω are denoted
More informationH NT Z N RT L 0 4 n f lt r h v d lt n r n, h p l," "Fl d nd fl d " ( n l d n l tr l t nt r t t n t nt t nt n fr n nl, th t l n r tr t nt. r d n f d rd n t th nd r nt r d t n th t th n r lth h v b n f
More informationFluid Phase Equilibria Journal
205 Fluid Phase Equilibria Journal Volume 43, Pages 205-212, 1988 STATISTICAL MECHANICAL TEST OF MHEMHS MODEL OF THE INTERACTION THIRD VIRIAL COEFFICIENTS ESAM Z. HAMAD and G. ALI MANSOORI Department of
More informationThe largest eigenvalues of the sample covariance matrix. in the heavy-tail case
The largest eigenvalues of the sample covariance matrix 1 in the heavy-tail case Thomas Mikosch University of Copenhagen Joint work with Richard A. Davis (Columbia NY), Johannes Heiny (Aarhus University)
More informationTHE STRUCTURE OF MULTIVARIATE POISSON DISTRIBUTION
K KAWAMURA KODAI MATH J 2 (1979), 337-345 THE STRUCTURE OF MULTIVARIATE POISSON DISTRIBUTION BY KAZUTOMO KAWAMURA Summary In this paper we shall derive a multivariate Poisson distribution and we shall
More information1. Find the missing input or output values for the following functions. If there is no value, explain why not. b. x=1-1
ALGEBRA 1 A1P2 Final Exam Review 1. Find the missing input or output values for the following functions. If there is no value, explain why not. b. x=1-1 f (x)= 3x -7 f (x) = x 10 f (x)= -1 f (4= -1 x f
More informationĞ ğ ğ Ğ ğ Öğ ç ğ ö öğ ğ ŞÇ ğ ğ
Ğ Ü Ü Ü ğ ğ ğ Öğ ş öğ ş ğ öğ ö ö ş ğ ğ ö ğ Ğ ğ ğ Ğ ğ Öğ ç ğ ö öğ ğ ŞÇ ğ ğ l _.j l L., c :, c Ll Ll, c :r. l., }, l : ö,, Lc L.. c l Ll Lr. 0 c (} >,! l LA l l r r l rl c c.r; (Y ; c cy c r! r! \. L : Ll.,
More informationName: Math 29 Probability
Name: Math 29 Probability Practice Final Exam Instructions: 1. Show all work. You may receive partial credit for partially completed problems. 2. You may use calculators and a two-sided sheet of reference
More informationOn two methods of bias reduction in the estimation of ratios
Biometriha (1966), 53, 3 and 4, p. 671 571 Printed in Great Britain On two methods of bias reduction in the estimation of ratios BY J. N. K. RAO AOT) J. T. WEBSTER Texas A and M University and Southern
More informationTail Inequalities. The Chernoff bound works for random variables that are a sum of indicator variables with the same distribution (Bernoulli trials).
Tail Inequalities William Hunt Lane Department of Computer Science and Electrical Engineering, West Virginia University, Morgantown, WV William.Hunt@mail.wvu.edu Introduction In this chapter, we are interested
More informationSOME RESULTS ON THE MULTIPLE GROUP DISCRIMINANT PROBLEM. Peter A. Lachenbruch
.; SOME RESULTS ON THE MULTIPLE GROUP DISCRIMINANT PROBLEM By Peter A. Lachenbruch Department of Biostatistics University of North Carolina, Chapel Hill, N.C. Institute of Statistics Mimeo Series No. 829
More informationLECTURE 5: Discrete random variables: probability mass functions and expectations. - Discrete: take values in finite or countable set
LECTURE 5: Discrete random variables: probability mass functions and expectations Random variables: the idea and the definition - Discrete: take values in finite or countable set Probability mass function
More informationBeginning and Ending Cash and Investment Balances for the month of January 2016
ADIISTRATIVE STAFF REPRT T yr nd Tn uncil rch 15 216 SBJET Jnury 216 nth End Tresurer s Reprt BAKGRD The lifrni Gvernment de nd the Tn f Dnville s Investment Plicy require tht reprt specifying the investment
More informationChapter 2. Discrete Distributions
Chapter. Discrete Distributions Objectives ˆ Basic Concepts & Epectations ˆ Binomial, Poisson, Geometric, Negative Binomial, and Hypergeometric Distributions ˆ Introduction to the Maimum Likelihood Estimation
More informationNE\V RESULTS ON THE COSTS OF HUFFMAN TREES. Xiaoji Wang
NE\V RESULTS ON THE COSTS OF HUFFMAN TREES Xiaoji Wang Department of Computer Science, The Australian National University, GPO Box 4, Canberra, ACT 2601, Australia Abstract. We determine some explicit
More information(1.1) g(w) = fi T(w + o-i) / fi T(w + Pj),
COEFFICIENTS IN CERTAIN ASYMPTOTIC FACTORIAL EXPANSIONS T. D. RINEY 1. Introduction. Let p and q denote integers with O^p^q, then it is known from [2; 3] and [7] that the function (1.1) g(w) = fi T(w +
More informationBinomial coefficient codes over W2)
Discrete Mathematics 106/107 (1992) 181-188 North-Holland 181 Binomial coefficient codes over W2) Persi Diaconis Harvard University, Cambridge, MA 02138, USA Ron Graham AT & T Bell Laboratories, Murray
More informationChapters 3.2 Discrete distributions
Chapters 3.2 Discrete distributions In this section we study several discrete distributions and their properties. Here are a few, classified by their support S X. There are of course many, many more. For
More informationConcentration of Measures by Bounded Size Bias Couplings
Concentration of Measures by Bounded Size Bias Couplings Subhankar Ghosh, Larry Goldstein University of Southern California [arxiv:0906.3886] January 10 th, 2013 Concentration of Measure Distributional
More informationUseful material for the course
Useful material for the course Suggested textbooks: Mood A.M., Graybill F.A., Boes D.C., Introduction to the Theory of Statistics. McGraw-Hill, New York, 1974. [very complete] M.C. Whitlock, D. Schluter,
More informationBinomial Randomization 3/13/02
Binomial Randomization 3/13/02 Define to be the product space 0,1, á, m â 0,1, á, m and let be the set of all vectors Ðs, á,s Ñ in such that s á s t. Suppose that \, á,\ is a multivariate hypergeometric
More informationRandom Variable. Pr(X = a) = Pr(s)
Random Variable Definition A random variable X on a sample space Ω is a real-valued function on Ω; that is, X : Ω R. A discrete random variable is a random variable that takes on only a finite or countably
More informationA. R. Manson, R. J. Hader, M. J. Karson. Institute of Statistics Mimeograph Series No. 826 Raleigh
F 'F MINIMJM BIAS ESTIMATION.AlfD EXPERIMENTAL DESIGN APPLIED TO UNIVARIATE rolynomial M)DELS by A. R. Manson, R. J. Hader, M. J. Karson Institute of Statistics Mimeograph Series No. 826 Raleigh - 1972
More informationA STUDY OF SEQUENTIAL PROCEDURES FOR ESTIMATING. J. Carroll* Md Robert Smith. University of North Carolina at Chapel Hill.
A STUDY OF SEQUENTIAL PROCEDURES FOR ESTIMATING THE LARGEST OF THREE NORMAL t4eans Ra~nond by J. Carroll* Md Robert Smith University of North Carolina at Chapel Hill -e Abstract We study the problem of
More information252 P. ERDÖS [December sequence of integers then for some m, g(m) >_ 1. Theorem 1 would follow from u,(n) = 0(n/(logn) 1/2 ). THEOREM 2. u 2 <<(n) < c
Reprinted from ISRAEL JOURNAL OF MATHEMATICS Vol. 2, No. 4, December 1964 Define ON THE MULTIPLICATIVE REPRESENTATION OF INTEGERS BY P. ERDÖS Dedicated to my friend A. D. Wallace on the occasion of his
More informationPROBABILITY DISTRIBUTION
PROBABILITY DISTRIBUTION DEFINITION: If S is a sample space with a probability measure and x is a real valued function defined over the elements of S, then x is called a random variable. Types of Random
More informationCOMPOSITIONS AND FIBONACCI NUMBERS
COMPOSITIONS AND FIBONACCI NUMBERS V. E. HOGGATT, JR., and D. A. LIND San Jose State College, San Jose, California and University of Cambridge, England 1, INTRODUCTION A composition of n is an ordered
More informationThings to remember when learning probability distributions:
SPECIAL DISTRIBUTIONS Some distributions are special because they are useful They include: Poisson, exponential, Normal (Gaussian), Gamma, geometric, negative binomial, Binomial and hypergeometric distributions
More informationKATUOMI HIRANO 1 AND KOSEI IWASE 2
Ann. Inst. Statist. Math. Vol. 41, No. 2, 279-287 (1989) CONDITIONAL INFORMATION FOR AN GAUSSIAN DISTRIBUTION WITH KNOWN OF VARIATION* KATUOMI HIRANO 1 AND KOSEI IWASE 2 I The Institute of Statistical
More informationON THE EVOLUTION OF ISLANDS
ISRAEL JOURNAL OF MATHEMATICS, Vol. 67, No. 1, 1989 ON THE EVOLUTION OF ISLANDS BY PETER G. DOYLE, Lb COLIN MALLOWS,* ALON ORLITSKY* AND LARRY SHEPP t MT&T Bell Laboratories, Murray Hill, NJ 07974, USA;
More informationSOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS
SOME PROPERTIES OF THIRD-ORDER RECURRENCE RELATIONS A. G. SHANNON* University of Papua New Guinea, Boroko, T. P. N. G. A. F. HORADAIVS University of New Engl, Armidale, Australia. INTRODUCTION In this
More information----- ~... No. 40 in G minor, K /~ ~--.-,;;;' LW LllJ LllJ LllJ LllJ WJ LilJ L.LL.J LLLJ. Movement'
Area o Stdy 1 Western c'assica' msic 16001899 Wolgang Symhony Movement' ocd1 track 2 Amades Mozart No 40 in G minor K550 Flte Oboes 12 Clarinets 12 in B lat Bassoons 12 Molto Allegro Horn 1 in B lat alto';
More informationTHE LIGHT BULB PROBLEM 1
THE LIGHT BULB PROBLEM 1 Ramamohan Paturi 2 Sanguthevar Rajasekaran 3 John Reif 3 Univ. of California, San Diego Univ. of Pennsylvania Duke University 1 Running Title: The Light Bulb Problem Corresponding
More informationClaims Reserving under Solvency II
Claims Reserving under Solvency II Mario V. Wüthrich RiskLab, ETH Zurich Swiss Finance Institute Professor joint work with Michael Merz (University of Hamburg) April 21, 2016 European Congress of Actuaries,
More informationLecture 4: Random Variables and Distributions
Lecture 4: Random Variables and Distributions Goals Random Variables Overview of discrete and continuous distributions important in genetics/genomics Working with distributions in R Random Variables A
More informationExhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No
xhibit 2-9/3/15 Invie Filing Pge 1841 f Pge 366 Dket. 44498 F u v 7? u ' 1 L ffi s xs L. s 91 S'.e q ; t w W yn S. s t = p '1 F? 5! 4 ` p V -', {} f6 3 j v > ; gl. li -. " F LL tfi = g us J 3 y 4 @" V)
More informationCONVERGENCE RATES FOR rwo-stage CONFIDENCE INTERVALS BASED ON U-STATISTICS
Ann. Inst. Statist. Math. Vol. 40, No. 1, 111-117 (1988) CONVERGENCE RATES FOR rwo-stage CONFIDENCE INTERVALS BASED ON U-STATISTICS N. MUKHOPADHYAY 1 AND G. VIK 2 i Department of Statistics, University
More informationof, denoted Xij - N(~i,af). The usu~l unbiased
COCHRAN-LIKE AND WELCH-LIKE APPROXIMATE SOLUTIONS TO THE PROBLEM OF COMPARISON OF MEANS FROM TWO OR MORE POPULATIONS WITH UNEQUAL VARIANCES The problem of comparing independent sample means arising from
More informationCommon Discrete Distributions
Common Discrete Distributions Statistics 104 Autumn 2004 Taken from Statistics 110 Lecture Notes Copyright c 2004 by Mark E. Irwin Common Discrete Distributions There are a wide range of popular discrete
More informationrhtre PAID U.S. POSTAGE Can't attend? Pass this on to a friend. Cleveland, Ohio Permit No. 799 First Class
rhtr irt Cl.S. POSTAG PAD Cllnd, Ohi Prmit. 799 Cn't ttnd? P thi n t frind. \ ; n l *di: >.8 >,5 G *' >(n n c. if9$9$.jj V G. r.t 0 H: u ) ' r x * H > x > i M
More informationD. Byatt, M. L. Dalrymple and R. M. Turner
SEARCHING FOR PRIMES IN THE DIGITS OF 7r D. Byatt, M. L. Dalrymple and R. M. Turner Department of Mathematics and Statistics University of Canterbury Private Bag 4800 Christchurch, New Zealand Report Number:
More information::::l<r/ L- 1-1>(=-ft\ii--r(~1J~:::: Fo. l. AG -=(0,.2,L}> M - &-c ==- < ) I) ~..-.::.1 ( \ I 0. /:rf!:,-t- f1c =- <I _,, -2...
Math 3298 Exam 1 NAME: SCORE: l. Given three points A(I, l, 1), B(l,;2, 3), C(2, - l, 2). (a) Find vectors AD, AC, nc. (b) Find AB+ DC, AB - AC, and 2AD. -->,,. /:rf!:,-t- f1c =-
More informationVAROL'S PERMUTATION AND ITS GENERALIZATION. Bolian Liu South China Normal University, Guangzhou, P. R. of China {Submitted June 1994)
VROL'S PERMUTTION ND ITS GENERLIZTION Bolian Liu South China Normal University, Guangzhou, P. R. of China {Submitted June 994) INTRODUCTION Let S be the set of n! permutations II = a^x...a n of Z = (,,...,«}.
More informationBasic probability. Inferential statistics is based on probability theory (we do not have certainty, but only confidence).
Basic probability Inferential statistics is based on probability theory (we do not have certainty, but only confidence). I Events: something that may or may not happen: A; P(A)= probability that A happens;
More informationfur \ \,,^N/ D7,,)d.s) 7. The champion and Runner up of the previous year shall be allowed to play directly in final Zone.
OUL O GR SODRY DUTO, ODS,RT,SMTUR,USWR.l ntuctin f cnuct f Kbi ( y/gil)tunent f 2L-Lg t. 2.. 4.. 6. Mtche hll be lye e K ule f ene f tie t tie Dutin f ech tch hll be - +0 (Rece)+ = M The ticint f ech Te
More informationPAIRS OF SUCCESSES IN BERNOULLI TRIALS AND A NEW n-estimator FOR THE BINOMIAL DISTRIBUTION
APPLICATIONES MATHEMATICAE 22,3 (1994), pp. 331 337 W. KÜHNE (Dresden), P. NEUMANN (Dresden), D. STOYAN (Freiberg) and H. STOYAN (Freiberg) PAIRS OF SUCCESSES IN BERNOULLI TRIALS AND A NEW n-estimator
More informationRandom Variables. P(x) = P[X(e)] = P(e). (1)
Random Variables Random variable (discrete or continuous) is used to derive the output statistical properties of a system whose input is a random variable or random in nature. Definition Consider an experiment
More informationASYMPTOTIC VALUE OF MIXED GAMES*
MATHEMATICS OF OPERATIONS RESEARCH Vol. 5, No. 1, February 1980 Priniedin U.S.A. ASYMPTOTIC VALUE OF MIXED GAMES* FRANCOISE FOGELMAN AND MARTINE QUINZII U.E.R. Scientifique de Luminy In this paper we are
More informationStatistics and data analyses
Statistics and data analyses Designing experiments Measuring time Instrumental quality Precision Standard deviation depends on Number of measurements Detection quality Systematics and methology σ tot =
More informationAsymptotic Variance Formulas, Gamma Functions, and Order Statistics
Statistical Models and Methods for Lifetime Data, Second Edition by Jerald F. Lawless Copyright 2003 John Wiley & Sons, Inc. APPENDIX Β Asymptotic Variance Formulas, Gamma Functions, and Order Statistics
More informationNORMAL CHARACTERIZATION BY ZERO CORRELATIONS
J. Aust. Math. Soc. 81 (2006), 351-361 NORMAL CHARACTERIZATION BY ZERO CORRELATIONS EUGENE SENETA B and GABOR J. SZEKELY (Received 7 October 2004; revised 15 June 2005) Communicated by V. Stefanov Abstract
More informationThe Number of Classes of Choice Functions under Permutation Equivalence
The Number of Classes of Choice Functions under Permutation Equivalence Spyros S. Magliveras* and Wandi Weit Department of Computer Science and Engineering University of Nebraska-Lincoln Lincoln, Nebraska
More informationLECTURE 18: Inequalities, convergence, and the Weak Law of Large Numbers. Inequalities
LECTURE 18: Inequalities, convergence, and the Weak Law of Large Numbers Inequalities bound P(X > a) based on limited information about a distribution Markov inequality (based on the mean) Chebyshev inequality
More informationProbabilistic Analysis of a Parallel Algorithm for Finding Maximal lndependen t Sets
Probabilistic Analysis of a Parallel Algorithm for Finding Maximal lndependen t Sets Neil Calkin and Alan Frieze Department of Mathematics, Carnegie Mellon University, Pittsburgh, PA 152 7 3-3890 ABSTRACT
More informationn
p l p bl t n t t f Fl r d, D p rt nt f N t r l R r, D v n f nt r r R r, B r f l. n.24 80 T ll h, Fl. : Fl r d D p rt nt f N t r l R r, B r f l, 86. http://hdl.handle.net/2027/mdp.39015007497111 r t v n
More informationASYMPTOTIC EXPANSION OF A COMPLEX HYPERGEOMETRIC FUNCTION
ASYMPTOTIC EXPANSION OF A COMPLEX HYPERGEOMETRIC FUNCTION by Aksel Bertelsen TECHNICAL REPORT No. 145 November 1988 Department ofstatistics, GN-22 University.of Washington Seattle, Washington 98195 USA
More informationEssentials on the Analysis of Randomized Algorithms
Essentials on the Analysis of Randomized Algorithms Dimitris Diochnos Feb 0, 2009 Abstract These notes were written with Monte Carlo algorithms primarily in mind. Topics covered are basic (discrete) random
More informationON THE DIFFERENCE BETWEEN THE CONCEPTS "COMPOUND" AND "COMPOSED" POISSON PROCESSES. CARL PHILIPSON Stockholm, Sweden
ON THE DIFFERENCE BETWEEN THE CONCEPTS "COMPOUND" AND "COMPOSED" POISSON PROCESSES CARL PHILIPSON Stockholm, Sweden In the discussion in the ASTIN Colloquium 1962, which followed my lecture on the numerical
More informationLecture 2: Discrete Probability Distributions
Lecture 2: Discrete Probability Distributions IB Paper 7: Probability and Statistics Carl Edward Rasmussen Department of Engineering, University of Cambridge February 1st, 2011 Rasmussen (CUED) Lecture
More informationPage Max. Possible Points Total 100
Math 3215 Exam 2 Summer 2014 Instructor: Sal Barone Name: GT username: 1. No books or notes are allowed. 2. You may use ONLY NON-GRAPHING and NON-PROGRAMABLE scientific calculators. All other electronic
More informationEFFECTS OF FALSE AND INCOMPLETE IDENTIFICATION OF DEFECTIVE ITEMS ON THE RELIABILITY OF ACCEPTANCE SAMPLING
... EFFECTS OF FALSE AND NCOMPLETE DENTFCATON OF DEFECTVE TEMS ON THE RELABLTY OF ACCEPTANCE SAMPLNG by Samuel Kotz University of Maryland College Park, Maryland Norman L. Johnson University of North Carolina
More informationDiscrete Distributions
A simplest example of random experiment is a coin-tossing, formally called Bernoulli trial. It happens to be the case that many useful distributions are built upon this simplest form of experiment, whose
More informationProbabilistic Combinatorics. Jeong Han Kim
Probabilistic Combinatorics Jeong Han Kim 1 Tentative Plans 1. Basics for Probability theory Coin Tossing, Expectation, Linearity of Expectation, Probability vs. Expectation, Bool s Inequality 2. First
More information