有界变量的强大数定理
合集下载
相关主题
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
ຫໍສະໝຸດ Baidu
@2000 by
North Atlantic Science Publishing Company
261
262
M. AMINI and A. BOZORGNIA
ables.
Definition 1" The random variables
X1,...,X n
are pairwise negatively dependent
h2c2.
the c-1 result with X
[5]. For general c, apply
2. An Extension of the Theorem of Hoeffding for ND Random Variables
In this section we extended the theorem of Hoeffding (Theorem 1 below) and then obtain the strong law of large numbers for ND uniformly bounded random variables. Theorem 1: (Hoeffding [10]) .Let X1,...,X n be independent random variables satisfying P[a <_ X <_ b]- 1 for each where a < b, and let S n l(Xk- EXk). Then for any t > O and c b-a
=
P[S n >_ nt] <_ exp
c2.
j.
Journal
of Applied Mathematics
and Stochastic Analysis, 13:3
(2000), 261-267.
NEGATIVELY DEPENDENT BOUNDED RANDOM VARIABLE PROBABILITY INEQUALITIES AND THE STRONG LAW OF LARGE NUMBERS
263
F(x, v)- 1/9 > Fx(x)Fv(v -(3/9)(2/9).
(iii)
U X 2 and V y2 are not ND random variables nor are since0_<u<l, 0<v<l we have
IX land YI
F(u, v)- 1/9 > Fu(u)Vv(v -(2/9)(3/9).
the^
pn
p
pn
p.
p.
p
Complete Convergence. AMS subject classifications: 60E15, 60F15.
1. Introduction
In many stochastic models, the assumption that random variables are independent is not plausible. Increases in some random variables are often related to decreases in other random variables so an assumption of negative dependence is more appropriate
f(- 1,
1)
f(1,0)
0, f(- 1,0)
f(0,0)
f(0,
1)
f(0,1)
f(1,1)
1/9,
f(-1,1)- f(1,-1)-2/9.
Then
X and Y
are
ND random variables since for each x, y G R
we have
F(x,y) <_ Fx(x)Fy(y ).
Taylor [3]. Lemma 1: Let {Xn, n > 1} be a sequence of ND random variables let {fn, n > 1} be a sequence of Borel functions all of which are monotone increasing (or all are monotone decreasing). Then {fn(Xn),n > 1} is a sequence of NO random variables. Lemma 2: Let X1,...,X n be ND random variables and let tl,...,t n be all nonnegative (or all nonpositive). Then
E[e
i=1
<
i=1
Ee tiXi
and
Lemma3: Let X be a r.v. such that every real number h we have
E(X)-O
e
XI
<_c<oc
a.e.
Then
for
Ee hX <
Proof: For c- 1, see Chow replaced by X/c.
than an assumption of independence. Lehmann [12] investigated various conceptions of positive and negative dependence in the bivariate case. Strong definitions of bivariate positive and negative dependence were introduced by Esary and Proschen [7]. Also Esary, Proschen and Walkup [8] introduced a concept of association which implied a strong form of positive dependence. Their concept has been very useful in reliability theory and applications. Multivariate generalizations of conceptions of dependence were initiated by Harris [9] and Brindley and Thompson [4]. These were later developed by Ebrahimi and Ghosh [6], Karlin [11], Block and Ting [2], and Block, Savits and Shaked [1]. Furthermore, Matula [13] studied the almost sure convergence of sums of negatively dependent (ND) random variables and Bozorgnia, Patterson and Taylor [3] studied limit theorems for dependent random variables. In this paper we study the asymptotic behavior of quantiles for negatively dependent random variPrinted in the U.S.A.
P(X > xi, X j > xj) <_ p(X > xi)P(X j > xj)
X1,... X n are said to be ND
if we have
P(NY= I(Xj <- xj))
and
P(N= I(Xj > xj))
__ (1)
(1)
is equivalent to
H= 1P(XJ
if
P(Xi <_ xi, X j <_ xj) <_ P(X <_ xi)P(X j <_ xj)
for all x i, x j
e R,
7 j. It can be shown that
for all xj, x E # j. Defmition 2: The random variables
,
xj),
(3)
IIY= 1P(Xj > xj),
(4)
for all Xl,...,x n R. Conditions (3) and (4) are equivalent for n- 2. However, Ebrahimi and Ghosh [6] show that these definitions do not agree for n >_ 3. An infinite sequence {Xn, n >_ 1} is said to be ND if every finite subset {X1,...,Xn} is ND. Definition 3: For parametric function g(0), a sequence of estimators {Tn, n >_ 1} is strongly consistent if
(ii)
X and V-y2 are not ND random variables because for -1 <x<0 and 0<v<l we have
Negatively Dependent Bounded Random Variable Probability Inequalities
The following lemmas are used to obtain the main result in the next section. Detailed proofs of these lemmas can be founded in the Bozorgnia, Patterson and
M. AMINI and A. BOZORGNIA
Faculty
Ferdowsi University of Mathematical Sciences
Mashhad, Iran
E-maih Bozorg@science2.um.ac.ir
(Received January, 1998; Revised January, 2000)
P[IXl >1
n--1
<c.
(5)
In the following example, we will show that the ND properties are not preserved for absolute values and squares of random variables. Example: Let (X, Y) have the following p.d.f:
Let Xl,...,X n be negatively dependent uniformly bounded random variables with d.f. F(x). In this paperwe obtain bounds for probabiliis the ties P(I Y=IXil >_nt) and P(l(pn-pl >e) where is the pth quantile of F(x). Moreover, we sample pth ^quantile and show that under mild^ is a strongly consistent estimator of restrictions on F(x) in the neighborhood of We also show that (pn converges completely to Key words: Probability Inequalities, Strong Law of Large Numbers,
Tn--og(O
Definition 4: The sequence completely (denoted limn__,ocX n
a.e.
{Xn, n > 1}
of random variables converges to zero 0 completely) if for every > 0,
@2000 by
North Atlantic Science Publishing Company
261
262
M. AMINI and A. BOZORGNIA
ables.
Definition 1" The random variables
X1,...,X n
are pairwise negatively dependent
h2c2.
the c-1 result with X
[5]. For general c, apply
2. An Extension of the Theorem of Hoeffding for ND Random Variables
In this section we extended the theorem of Hoeffding (Theorem 1 below) and then obtain the strong law of large numbers for ND uniformly bounded random variables. Theorem 1: (Hoeffding [10]) .Let X1,...,X n be independent random variables satisfying P[a <_ X <_ b]- 1 for each where a < b, and let S n l(Xk- EXk). Then for any t > O and c b-a
=
P[S n >_ nt] <_ exp
c2.
j.
Journal
of Applied Mathematics
and Stochastic Analysis, 13:3
(2000), 261-267.
NEGATIVELY DEPENDENT BOUNDED RANDOM VARIABLE PROBABILITY INEQUALITIES AND THE STRONG LAW OF LARGE NUMBERS
263
F(x, v)- 1/9 > Fx(x)Fv(v -(3/9)(2/9).
(iii)
U X 2 and V y2 are not ND random variables nor are since0_<u<l, 0<v<l we have
IX land YI
F(u, v)- 1/9 > Fu(u)Vv(v -(2/9)(3/9).
the^
pn
p
pn
p.
p.
p
Complete Convergence. AMS subject classifications: 60E15, 60F15.
1. Introduction
In many stochastic models, the assumption that random variables are independent is not plausible. Increases in some random variables are often related to decreases in other random variables so an assumption of negative dependence is more appropriate
f(- 1,
1)
f(1,0)
0, f(- 1,0)
f(0,0)
f(0,
1)
f(0,1)
f(1,1)
1/9,
f(-1,1)- f(1,-1)-2/9.
Then
X and Y
are
ND random variables since for each x, y G R
we have
F(x,y) <_ Fx(x)Fy(y ).
Taylor [3]. Lemma 1: Let {Xn, n > 1} be a sequence of ND random variables let {fn, n > 1} be a sequence of Borel functions all of which are monotone increasing (or all are monotone decreasing). Then {fn(Xn),n > 1} is a sequence of NO random variables. Lemma 2: Let X1,...,X n be ND random variables and let tl,...,t n be all nonnegative (or all nonpositive). Then
E[e
i=1
<
i=1
Ee tiXi
and
Lemma3: Let X be a r.v. such that every real number h we have
E(X)-O
e
XI
<_c<oc
a.e.
Then
for
Ee hX <
Proof: For c- 1, see Chow replaced by X/c.
than an assumption of independence. Lehmann [12] investigated various conceptions of positive and negative dependence in the bivariate case. Strong definitions of bivariate positive and negative dependence were introduced by Esary and Proschen [7]. Also Esary, Proschen and Walkup [8] introduced a concept of association which implied a strong form of positive dependence. Their concept has been very useful in reliability theory and applications. Multivariate generalizations of conceptions of dependence were initiated by Harris [9] and Brindley and Thompson [4]. These were later developed by Ebrahimi and Ghosh [6], Karlin [11], Block and Ting [2], and Block, Savits and Shaked [1]. Furthermore, Matula [13] studied the almost sure convergence of sums of negatively dependent (ND) random variables and Bozorgnia, Patterson and Taylor [3] studied limit theorems for dependent random variables. In this paper we study the asymptotic behavior of quantiles for negatively dependent random variPrinted in the U.S.A.
P(X > xi, X j > xj) <_ p(X > xi)P(X j > xj)
X1,... X n are said to be ND
if we have
P(NY= I(Xj <- xj))
and
P(N= I(Xj > xj))
__ (1)
(1)
is equivalent to
H= 1P(XJ
if
P(Xi <_ xi, X j <_ xj) <_ P(X <_ xi)P(X j <_ xj)
for all x i, x j
e R,
7 j. It can be shown that
for all xj, x E # j. Defmition 2: The random variables
,
xj),
(3)
IIY= 1P(Xj > xj),
(4)
for all Xl,...,x n R. Conditions (3) and (4) are equivalent for n- 2. However, Ebrahimi and Ghosh [6] show that these definitions do not agree for n >_ 3. An infinite sequence {Xn, n >_ 1} is said to be ND if every finite subset {X1,...,Xn} is ND. Definition 3: For parametric function g(0), a sequence of estimators {Tn, n >_ 1} is strongly consistent if
(ii)
X and V-y2 are not ND random variables because for -1 <x<0 and 0<v<l we have
Negatively Dependent Bounded Random Variable Probability Inequalities
The following lemmas are used to obtain the main result in the next section. Detailed proofs of these lemmas can be founded in the Bozorgnia, Patterson and
M. AMINI and A. BOZORGNIA
Faculty
Ferdowsi University of Mathematical Sciences
Mashhad, Iran
E-maih Bozorg@science2.um.ac.ir
(Received January, 1998; Revised January, 2000)
P[IXl >1
n--1
<c.
(5)
In the following example, we will show that the ND properties are not preserved for absolute values and squares of random variables. Example: Let (X, Y) have the following p.d.f:
Let Xl,...,X n be negatively dependent uniformly bounded random variables with d.f. F(x). In this paperwe obtain bounds for probabiliis the ties P(I Y=IXil >_nt) and P(l(pn-pl >e) where is the pth quantile of F(x). Moreover, we sample pth ^quantile and show that under mild^ is a strongly consistent estimator of restrictions on F(x) in the neighborhood of We also show that (pn converges completely to Key words: Probability Inequalities, Strong Law of Large Numbers,
Tn--og(O
Definition 4: The sequence completely (denoted limn__,ocX n
a.e.
{Xn, n > 1}
of random variables converges to zero 0 completely) if for every > 0,