Professional Documents
Culture Documents
Edu 2009 Fall Exam C Table
Edu 2009 Fall Exam C Table
Exam C
1 12 x2
.
e
2
Appendix A
An Inventory of Continuous
Distributions
A.1
Introduction
t1 et dt,
> 0, x > 0
with () =
t1 et dt,
> 0.
Also, define
G(; x) =
t1 et dt,
x > 0.
At times we will need this integral for nonpositive values of . Integration by parts produces the relationship
G(; x) =
x ex
1
+ G( + 1; x)
This can be repeated until the first argument of G is + k, a positive number. Then it can be evaluated
from
G( + k; x) = ( + k)[1 ( + k; x)].
The incomplete beta function is given by
Z
(a + b) x a1
t (1 t)b1 dt,
(a, b; x) =
(a)(b) 0
A.2
A.2.2
Three-parameter distributions
A.2.2.1
f (x) =
( + ) x 1
()( ) (x + )+
E[X k ] =
k ( + k)( k)
,
()( )
E[X k ] =
k ( + 1) ( + k 1)
,
( 1) ( k)
F (x) = ( , ; u),
u=
x
x+
< k <
if k is an integer
k ( + k)( k)
( + k, k; u) + xk [1 F (x)],
()( )
1
=
, > 1, else 0
+1
E[(X x)k ] =
mode
A.2.2.2
k >
(x/)
x[1 + (x/) ]+1
F (x) = 1 u ,
k (1 + k/)( k/)
,
()
u=
1
1 + (x/)
< k <
k (1 + k/)( k/)
(1 + k/, k/; 1 u) + xk u ,
()
1/
1
=
, > 1, else 0
+ 1
E[(X x)k ] =
mode
A.2.2.3
k >
(x/)
x[1 + (x/) ] +1
k ( + k/)(1 k/)
,
( )
F (x) = u ,
u=
(x/)
1 + (x/)
< k <
k ( + k/)(1 k/)
( + k/, 1 k/; u) + xk [1 u ],
( )
1/
1
=
, > 1, else 0
+1
E[(X x)k ] =
mode
k >
A.2.3
Two-parameter distributions
A.2.3.1
(x + )+1
F (x) = 1
x+
E[X k ] =
k (k + 1)( k)
,
()
E[X k ] =
k k!
, if k is an integer
( 1) ( k)
1 < k <
(1 p)1/
TVaRp (X) = VaRp (X) +
, >1
1
"
1 #
, =
6 1
E[X x] =
1
1
x+
E[X x] = ln
, =1
x+
k (k + 1)( k)
[k + 1, k; x/(x + )] + xk
()
= 0
E[(X x)k ] =
mode
A.2.3.2
x+
all k
Inverse Pareto ,
f (x) =
x 1
(x + ) +1
F (x) =
x
x+
E[X k ] =
k ( + k)(1 k)
,
( )
E[X k ] =
k (k)!
, if k is a negative integer
( 1) ( + k)
< k < 1
Z x/(x+)
x
E[(X x)k ] = k
y +k1 (1 y)k dy + xk 1
,
x+
0
1
mode =
, > 1, else 0
2
A.2.3.3
k >
Loglogistic (Fisk),
f (x) =
(x/)
x[1 + (x/) ]2
F (x) = u,
u=
(x/)
1 + (x/)
< k <
1
, > 1, else 0
mode =
+1
k >
Paralogistic,
This is a Burr distribution with = .
2 (x/)
x[1 + (x/) ]+1
f (x) =
F (x) = 1 u ,
k (1 + k/)( k/)
,
()
E[X k ] =
u=
1
1 + (x/)
< k < 2
k (1 + k/)( k/)
(1 + k/, k/; 1 u) + xk u ,
()
1/
1
=
, > 1, else 0
2 + 1
E[(X x)k ] =
mode
A.2.3.5
k >
Inverse paralogistic ,
This is an inverse Burr distribution with = .
2 (x/)
x[1 + (x/) ] +1
f (x) =
F (x) = u ,
k ( + k/ )(1 k/ )
,
( )
E[X k ] =
u=
(x/)
1 + (x/)
2 < k <
k ( + k/ )(1 k/ )
( + k/ , 1 k/ ; u) + xk [1 u ],
( )
E[(X x)k ] =
mode
A.3
= ( 1)1/ ,
k > 2
> 1, else 0
A.3.2
Two-parameter distributions
A.3.2.1
Gamma,
f (x) =
(x/) ex/
x()
M (t) = (1 t) ,
F (x) = (; x/)
t < 1/
E[X k ] = k ( + k 1) ,
E[(X x)k ] =
mode
E[X k ] =
k ( + k)
,
()
k >
if k is an integer
k ( + k)
( + k; x/) + xk [1 (; x/)],
()
k >
k an integer
f (x) =
(/x) e/x
x()
E[X k ] =
k ( k)
,
()
E[(X x)k ] =
F (x) = 1 (; /x)
E[X k ] =
k<
k
,
( 1) ( k)
if k is an integer
k ( k)
[1 ( k; /x)] + xk (; /x)
()
k ( k)
G( k; /x) + xk (; /x), all k
()
= /( + 1)
=
mode
A.3.2.3
Weibull,
(x/) e(x/)
f (x) =
F (x) = 1 e(x/)
x
E[X k ] = k (1 + k/ ), k >
VaRp (X) = [ ln(1 p)]1/
1/
1
, > 1, else 0
mode =
A.3.2.4
k >
(/x) e(/x)
x
E[X k ] = k (1 k/ ), k <
VaRp (X) = ( ln p)1/
f (x) =
F (x) = e(/x)
h
i
1/
mode =
+1
all k
A.3.3
One-parameter distributions
A.3.3.1
Exponential
f (x) =
M (t)
E[X k ]
VaRp (X)
TVaRp (X)
=
=
=
=
ex/
F (x) = 1 ex/
(1 t)1
E[X k ] = k (k + 1),
k
k!, if k is an integer
ln(1 p)
ln(1 p) +
k > 1
E[X x] = (1 ex/ )
E[(X x)k ] = k (k + 1)(k + 1; x/) + xk ex/ , k > 1
= k k!(k + 1; x/) + xk ex/ , k an integer
mode = 0
A.3.3.2
Inverse exponential
e/x
x2
k
k
E[X ] = (1 k),
VaRp (X) = ( ln p)1
f (x) =
F (x) = e/x
k<1
A.5
A.5.1.1
all k
Other distributions
Lognormal, ( can be negative)
1
ln x
exp(z 2 /2) = (z)/(x), z =
x 2
k
2 2
E[X ] = exp(k + k /2)
ln x k 2
k
2 2
E[(X x) ] = exp(k + k /2)
+ xk [1 F (x)]
f (x) =
mode = exp( 2 )
F (x) = (z)
Inverse Gaussian,
f (x) =
F (x) =
M (t) =
E[X x] =
A.5.1.3
1/2
z 2
x
exp
, z=
2x3
2x
" #
" 1/2 #
1/2
2
x+
+ exp
, y=
z
y
x
"
!#
r
2t2
exp
E[X] = ,
1 1
, t < 2,
2
" #
" 1/2 #
1/2
x z z
y exp
y
x
Var[X] = 3 /
Let Y have a t distribution with r degrees of freedom. Then X = exp(Y + ) has the log-t distribution.
Positive moments do not exist for this distribution. Just as the t distribution has a heavier tail than the
normal distribution, this distribution has a heavier tail than the lognormal distribution.
r+1
2
f (x) =
,
"
2 #(r+1)/2
r
1 ln x
x r
1+
2
r
ln x
F (x) = Fr
with Fr (t) the cdf of a t distribution with r d.f.,
1
r
r 1
,
0 < x e ,
,
;
2
2 2 2
ln
x
r+
F (x) =
1
r
r 1
,
;
2 , x e .
2
2
ln
x
r+
A.5.1.4
Single-parameter Pareto,
f (x) =
,
x+1
x>
E[X k ] =
mode
k<
F (x) = 1 (/x) ,
x>
(1 p)1/
, >1
1
k
k
, x
E[(X x)k ] =
k ( k)xk
TVaRp (X) =
Note: Although there appears to be two parameters, only is a true parameter. The value of must be
set in advance.
A.6
A.6.1.1
Generalized betaa, b, ,
(a + b) a
u (1 u)b1 ,
(a)(b)
x
F (x) = (a, b; u)
f (x) =
E[X k ] =
E[(X x)k ] =
A.6.1.2
k (a + b)(a + k/ )
,
(a)(a + b + k/ )
0 < x < ,
u = (x/)
k > a
k (a + b)(a + k/ )
(a + k/ , b; u) + xk [1 (a, b; u)]
(a)(a + b + k/ )
betaa, b,
(a + b) a
1
u (1 u)b1 ,
(a)(b)
x
F (x) = (a, b; u)
f (x) =
0 < x < ,
E[X k ] =
k (a + b)(a + k)
,
(a)(a + b + k)
E[X k ] =
k a(a + 1) (a + k 1)
,
(a + b)(a + b + 1) (a + b + k 1)
E[(X x)k ] =
u = x/
k > a
if k is an integer
k a(a + 1) (a + k 1)
(a + k, b; u)
(a + b)(a + b + 1) (a + b + k 1)
Appendix B
An Inventory of Discrete
Distributions
B.1
Introduction
The 16 models fall into three classes. The divisions are based on the algorithm by which the probabilities are
computed. For some of the more familiar distributions these formulas will look dierent from the ones you
may have learned, but they produce the same probabilities. After each name, the parameters are given. All
parameters are positive unless otherwise indicated. In all cases, pk is the probability of observing k losses.
For finding moments, the most convenient form is to give the factorial moments. The jth factorial
moment is (j) = E[N (N 1) (N j + 1)]. We have E[N ] = (1) and Var(N ) = (2) + (1) 2(1) .
The estimators which are presented are not intended to be useful estimators but rather for providing
starting values for maximizing the likelihood (or other) function. For determining starting values, the
following quantities are used [where nk is the observed frequency at k (if, for the last entry, nk represents
the number of observations at k or more, assume it was at exactly k) and n is the sample size]:
1X
knk ,
n
2 =
k=1
1X 2
k nk
2.
n
k=1
is used. For
When the method of moments is used to determine the starting value, a circumflex (e.g., )
any other method, a tilde (e.g., ) is used. When the starting value formulas do not provide admissible
parameter values, a truly crude guess is to set the product of all and parameters equal to the sample
mean and set all other parameters equal to 1. If there are two and/or parameters, an easy choice is to
set each to the square root of the sample mean.
The last item presented is the probability generating function,
P (z) = E[z N ].
B.2
B.2.1.1
= e ,
E[N ] = ,
a = 0,
b=
Var[N ] =
9
pk =
e k
k!
P (z) = e(z1)
10
Geometric
p0
1
,
1+
E[N ] = ,
a=
,
1+
b=0
pk =
k
(1 + )k+1
P (z) = [1 (z 1)]1 .
Var[N ] = (1 + )
B.2.1.4
Negative binomial, r
p0
= (1 + )r ,
a=
,
1+
r(r + 1) (r + k 1) k
k!(1 + )r+k
E[N ] = r, Var[N ] = r(1 + )
pk
B.3
b=
(r 1)
1+
P (z) = [1 (z 1)]r .
To distinguish this class from the (a, b, 0) class, the probabilities are denoted Pr(N = k) = pM
k or Pr(N =
k) = pTk depending on which subclass is being represented. For this class, pM
0 is arbitrary (that is, it is a
T
parameter) and then pM
1 or p1 is a specified function of the parameters a and b. Subsequent probabilities are
M
T
obtained recursively as in the (a, b, 0) class: pM
k = (a + b/k)pk1 , k = 2, 3, . . ., with the same recursion for pk
There are two sub-classes of this class. When discussing their members, we often refer to the corresponding
member of the (a, b, 0) class. This refers to the member of that class with the same values for a and b. The
notation pk will continue to be used for probabilities for the corresponding (a, b, 0) distribution.
B.3.1
The members of this class have pT0 = 0 and therefore it need not be estimated. These distributions should
only be used when a value of zero is impossible. The first factorial moment is (1) = (a + b)/[(1 a)(1 p0 )],
where p0 is the value for the corresponding member of the (a, b, 0) class. For the logarithmic distribution
(which has no corresponding member), (1) = / ln(1+). Higher factorial moments are obtained recursively
with the same formula as with the (a, b, 0) class. The variance is (a+b)[1(a+b+1)p0 ]/[(1a)(1p0 )]2 .For
those members of the subclass which have corresponding (a, b, 0) distributions, pTk = pk /(1 p0 ).
Zero-truncated Poisson
pT1
pTk
, a = 0,
e 1
k
,
k!(e 1)
E[N ] = /(1 e ),
= ln(n
/n1 ),
z
e 1
.
P (z) =
e 1
B.3.1.2
11
b = ,
Zero-truncated geometric
pT1
1
,
1+
a=
,
1+
b = 0,
k1
,
(1 + )k
E[N ] = 1 + , Var[N ] = (1 + ),
=
1,
pTk
P (z) =
[1 (z 1)]1 (1 + )1
.
1 (1 + )1
Logarithmic
pT1
,
(1 + ) ln(1 + )
pTk
k
,
k(1 + )k ln(1 + )
E[N ] = / ln(1 + ),
a=
Var[N ] =
,
1+
b=
,
1+
[1 + / ln(1 + )]
,
ln(1 + )
2(
1)
n
1 or
,
n1
ln[1 (z 1)]
P (z) = 1
.
ln(1 + )
pTk
E[N ] =
Var[N ] =
q =
P (z) =
B.3.1.5
12
m(1 q)m1 q
q
(m + 1)q
, a=
, b=
,
m
1 (1 q)
1q
1q
m k
mk
k q (1 q)
, k = 1, 2, . . . , m,
1 (1 q)m
mq
,
1 (1 q)m
mq[(1 q) (1 q + mq)(1 q)m ]
,
[1 (1 q)m ]2
,
m
[1 + q(z 1)]m (1 q)m
.
1 (1 q)m
pTk
E[N ] =
V ar[N ] =
P (z) =
r
,
(1 + )
(r 1)
, b=
,
(1 +
1+
1+
k
r(r + 1) (r + k 1)
,
k![(1 + )r 1]
1+
r
,
1 (1 + )r
r[(1 + ) (1 + + r)(1 + )r ]
,
[1 (1 + )r ]2
)r+1
a=
2
,
1, r = 2
[1 (z 1)]r (1 + )r
.
1 (1 + )r
This distribution is sometimes called the extended truncated negative binomial distribution because the
parameter r can extend below 0.
B.3.2
A zero-modified distribution is created by starting with a truncated distribution and then placing an arbitrary
amount of probability at zero. This probability, pM
0 , is a parameter. The remaining probabilities are
adjusted accordingly. Values of pM
can
be
determined
from the corresponding zero-truncated distribution
k
M T
M
as pM
=
(1
p
)p
or
from
the
corresponding
(a,
b,
0)
distribution
as pM
0
k
k
k = (1 p0 )pk /(1 p0 ). The same
recursion used for the zero-truncated subclass applies.
The mean is 1 pM
0 times the mean for the corresponding zero-truncated distribution. The variance is
M
M
1 pM
0 times the zero-truncated variance plus p0 (1 p0 ) times the square of the zero-truncated mean. The
M
M
probability generating function is P (z) = p0 + (1 pM
0 )P (z), where P (z) is the probability generating
function for the corresponding zero-truncated distribution.
The maximum likelihood estimator of pM
0 is always the sample relative frequency at 0.