首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 125 毫秒
1.
Let {Xn} be a stationary Gaussian sequence with E{X0} = 0, {X20} = 1 and E{X0Xn} = rnn Let cn = (2ln n)built12, bn = cn? 12c-1n ln(4π ln n), and set Mn = max0 ?k?nXk. A classical result for independent normal random variables is that
P[cn(Mn?bn)?x]→exp[-e-x] as n → ∞ for all x.
Berman has shown that (1) applies as well to dependent sequences provided rnlnn = o(1). Suppose now that {rn} is a convex correlation sequence satisfying rn = o(1), (rnlnn)-1 is monotone for large n and o(1). Then
P[rn-12(Mn ? (1?rn)12bn)?x] → Ф(x)
for all x, where Ф is the normal distribution function. While the normal can thus be viewed as a second natural limit distribution for {Mn}, there are others. In particular, the limit distribution is given below when rn is (sufficiently close to) γ/ln n. We further exhibit a collection of limit distributions which can arise when rn decays to zero in a nonsmooth manner. Continuous parameter Gaussian processes are also considered. A modified version of (1) has been given by Pickands for some continuous processes which possess sufficient asymptotic independence properties. Under a weaker form of asymptotic independence, we obtain a version of (2).  相似文献   

2.
3.
4.
The message m = {m(t)} is a Gaussian process that is to be transmitted through the white Gaussian channel with feedback: Y(t) = ∫0tF(s, Y0s, m)ds + W(t). Under the average power constraint, E[F2(s, Y0s, m)] ≤ P0, we construct causally the optimal coding, in the sense that the mutual information It(m, Y) between the message m and the channel output Y (up to t) is maximized. The optimal coding is presented by Y(t) = ∫0t A(s)[m(s) ? m?(s)] ds + W(t), where m?(s) = E[m(s) ¦ Y(u), 0 ≤ u ≤ s] and A(s) is a positive function such that A2(s) E |m(s) ? m?(s)|2 = P0.  相似文献   

5.
Let X1, X2, X3, … be i.i.d. r.v. with E|X1| < ∞, E X1 = μ. Given a realization X = (X1,X2,…) and integers n and m, construct Yn,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution P1(Yn,i = Xj) = 1n for 1 ? j ? n. (P1 denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X1 are given to ensure the almost sure convergence of (1mmi=1 Yn,i toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).  相似文献   

6.
Let {Xi, i?0} be a sequence of independent identically distributed random variables with finite absolute third moment. Then Darling and Erdös have shown that
for -∞<t<∞ where μn = max0?k?n k-12ki=0xi and Xn = (2 ln ln n)12. The result is extended to dependent sequences but assuming that {Xi} is a standard stationary Gaussian sequence with covariance function {ri}. When {Xi} is moderately dependent (e.g. when v(∑ni=1Xi) ? na, 0 < a < 2) we get
where Ha is a constant. In the strongly dependent case (e.g. when v(∑ni=1Xi) ? n2r(n)) we get
for-∞<t<∞.  相似文献   

7.
The probability measure of X = (x0,…, xr), where x0,…, xr are independent isotropic random points in Rn (1 ≤ rn ? 1) with absolutely continuous distributions is, for a certain class of distributions of X, expressed as a product measure involving as factors the joint probability measure of (ω, ?), the probability measure of p, and the probability measure of Y1 = (y01,…, yr1). Here ω is the r-subspace parallel to the r-flat η determined by X, ? is a unit vector in ω with ‘initial’ point at the origin [ω is the (n ? r)-subspace orthocomplementary to ω], p is the norm of the vector z from the origin to the orthogonal projection of the origin on η, and yi1 = (xi ? z)α(p2), where α is a scale factor determined by p. The probability measure for ω is the unique probability measure on the Grassmann manifold of r-subspaces in Rn invariant under the group of rotations in Rn, while the conditional probability measure of ? given ω is uniform on the boundary of the unit (n ? r)-ball in ω with centre at the origin. The decomposition allows the evaluation of the moments, for a suitable class of distributions of X, of the r-volume of the simplicial convex hull of {x0,…, xr} for 1 ≤ rn.  相似文献   

8.
Let Ω = {1, 0} and for each integer n ≥ 1 let Ωn = Ω × Ω × … × Ω (n-tuple) and Ωnk = {(a1, a2, …, an)|(a1, a2, … , an) ? Ωnand Σi=1nai = k} for all k = 0,1,…,n. Let {Ym}m≥1 be a sequence of i.i.d. random variables such that P(Y1 = 0) = P(Y1 = 1) = 12. For each A in Ωn, let TA be the first occurrence time of A with respect to the stochastic process {Ym}m≥1. R. Chen and A.Zame (1979, J. Multivariate Anal. 9, 150–157) prove that if n ≥ 3, then for each element A in Ωn, there is an element B in Ωn such that the probability that TB is less than TA is greater than 12. This result is sharpened as follows: (I) for n ≥ 4 and 1 ≤ kn ? 1, each element A in Ωnk, there is an element B also in Ωnk such that the probability that TB is less than TA is greater than 12; (II) for n ≥ 4 and 1 ≤ kn ? 1, each element A = (a1, a2,…,an) in Ωnk, there is an element C also in Ωnk such that the probability that TA is less than TC is greater than 12 if n ≠ 2m or n = 2m but ai = ai + 1 for some 1 ≤ in?1. These new results provide us with a better and deeper understanding of the fair coin tossing process.  相似文献   

9.
Let Sp×p ~ Wishart (Σ, k), Σ unknown, k > p + 1. Minimax estimators of Σ?1 are given for L1, an Empirical Bayes loss function; and L2, a standard loss function (RiE(LiΣ), i = 1, 2). The estimators are Σ??1 = aS?1 + br(S)Ip×p, a, b ≥ 0, r(·) a functional on Rp(p+2)2. Stein, Efron, and Morris studied the special cases Σa?1 = aS?1 (EΣ?k?p?1?1 = Σ?1) and Σ?1?1 = aS?1 + (b/tr S)I, for certain, a, b. From their work R1?1, Σ?1?1; S) ≤ R1?1, Σ?a?1; S) (?Σ), a = k ? p ? 1, b = p2 + p ? 2; whereas, we prove R2?1Σ?a?1; S) ≤ R2?1, Σ?1?1; S) (?Σ). The reversal is surprising because L1?1, Σ?1?1; S) → L2?1, Σ?1?1; S) a.e. (for a particular L2). Assume R (compact) ? S, S the set of p × p p.s.d. matrices. A “divergence theorem” on functions Fp×p : RS implies identities for Ri, i = 1, 2. Then, conditions are given for Ri?1, Σ??1; S) ≤ Ri?1, Σ?1?1; S) ≤ Ri?1, Σ?a?1; S) (?Σ), i = 1, 2. Most of our results concern estimators with r(S) = t(U)/tr(S), U = p ∣S1/p/tr(S).  相似文献   

10.
If r, k are positive integers, then Tkr(n) denotes the number of k-tuples of positive integers (x1, x2, …, xk) with 1 ≤ xin and (x1, x2, …, xk)r = 1. An explicit formula for Tkr(n) is derived and it is shown that limn→∞Tkr(n)nk = 1ζ(rk).If S = {p1, p2, …, pa} is a finite set of primes, then 〈S〉 = {p1a1p2a2psas; piS and ai ≥ 0 for all i} and Tkr(S, n) denotes the number of k-tuples (x1, x3, …, xk) with 1 ≤ xin and (x1, x2, …, xk)r ∈ 〈S〉. Asymptotic formulas for Tkr(S, n) are derived and it is shown that limn→∞Tkr(S, n)nk = (p1 … pa)rkζ(rk)(p1rk ? 1) … (psrk ? 1).  相似文献   

11.
Wr,p(R)-splines     
In [3] Golomb describes, for 1 < p < ∞, the Hr,p(R)-extremal extension F1 of a function ?:E → R (i.e., the Hr,p-spline with knots in E) and studies the cone H1Er,p of all such splines. We study the problem of determining when F1 is in Wr,pHr,pLp. If F1 ? Wr,p, then F1 is called a Wr,p-spline, and we denote by W1Er,p the cone of all such splines. If E is quasiuniform, then F1 ? Wr,p if and only if {?(ti)}ti?E ? lp. The cone W1Er,p with E quasiuniform is shown to be homeomorphic to lp. Similarly, H1Er,p is homeomorphic to hr,p. Approximation properties of the Wr,p-splines are studied and error bounds in terms of the mesh size ¦ E ¦ are calculated. Restricting ourselves to the case p = 2 and to quasiuniform partitions E, the second integral relation is proved and better error bounds in terms of ¦ E ¦ are derived.  相似文献   

12.
Let Fn(x) be the empirical distribution function based on n independent random variables X1,…,Xn from a common distribution function F(x), and let X = Σi=1nXin be the sample mean. We derive the rate of convergence of Fn(X) to normality (for the regular as well as nonregular cases), a law of iterated logarithm, and an invariance principle for Fn(X).  相似文献   

13.
A variety of continuous parameter Markov chains arising in applied probability (e.g. epidemic and chemical reaction models) can be obtained as solutions of equations of the form
XN(t)=x0+∑1NlY1N ∫t0 f1(XN(s))ds
where l∈Zt, the Y1 are independent Poisson processes, and N is a parameter with a natural interpretation (e.g. total population size or volume of a reacting solution).The corresponding deterministic model, satisfies
X(t)=x0+ ∫t0 ∑ lf1(X(s))ds
Under very general conditions limN→∞XN(t)=X(t) a.s. The process XN(t) is compared to the diffusion processes given by
ZN(t)=x0+∑1NlB1N∫t0 ft(ZN(s))ds
and
V(t)=∑ l∫t0f1(X(s))dW?1+∫t0 ?F(X(s))·V(s)ds.
Under conditions satisfied by most of the applied probability models, it is shown that XN,ZN and V can be constructed on the same sample space in such a way that
XN(t)=ZN(t)+OlogNN
and
N(XN(t)?X(t))=V(t)+O log NN
  相似文献   

14.
Let Xn be an irreducible aperiodic recurrent Markov chain with countable state space I and with the mean recurrence times having second moments. There is proved a global central limit theorem for the properly normalized sojourn times. More precisely, if t(n)ink=1i?i(Xk), then the probability measures induced by {t(n)i/√n?√i}i?Ii being the ergotic distribution) on the Hilbert-space of square summable I-sequences converge weakly in this space to a Gaussian measure determined by a certain weak potential operator.  相似文献   

15.
Let Ni, i?1, be i.i.d. observable Cox processes on a compact metric space E, directed by unobservable random measures Mi. Assume that the probability law of the Mi is completely unknown. Techniques are developed for approximation of state estimators E[exp(?Mn+1(?))|FNn+1] using data from the processes N1,…,Nn to estimate necessary attributes of the unknown probability law of the time Mi. The techniques are based on representation of the state estimators in terms of reduced Palm distributions of the Ni and on estimation of these Palm distributions. Estimators of Palm distributions are shown to be strongly consistent and asymptotically normal. The difference between the true and the pseudo-state estimators converges to zero in L2 at rate n?14+δ for each δ > 0.  相似文献   

16.
The following estimate of the pth derivative of a probability density function is examined: Σk = 0Na?khk(x), where hk is the kth Hermite function and a?k = ((?1)pn)Σi = 1nhk(p)(Xi) is calculated from a sequence X1,…, Xn of independent random variables having the common unknown density. If the density has r derivatives the integrated square error converges to zero in the mean and almost completely as rapidly as O(n?α) and O(n?α log n), respectively, where α = 2(r ? p)(2r + 1). Rates for the uniform convergence both in the mean square and almost complete are also given. For any finite interval they are O(n?β) and O(n2log n), respectively, where β = (2(r ? p) ? 1)(2r + 1).  相似文献   

17.
Let Xj = (X1j ,…, Xpj), j = 1,…, n be n independent random vectors. For x = (x1 ,…, xp) in Rp and for α in [0, 1], let Fj1(x) = αI(X1j < x1 ,…, Xpj < xp) + (1 ? α) I(X1jx1 ,…, Xpjxp), where I(A) is the indicator random variable of the event A. Let Fj(x) = E(Fj1(x)) and Dn = supx, α max1 ≤ Nn0n(Fj1(x) ? Fj(x))|. It is shown that P[DnL] < 4pL exp{?2(L2n?1 ? 1)} for each positive integer n and for all L2n; and, as n → ∞, Dn = 0((nlogn)12) with probability one.  相似文献   

18.
Real constant coefficient nth order elliptic operators, Q, which generate strongly continuous semigroups on L2(Rk) are analyzed in terms of the elementary generator,
A = (?n)(n2 ? 1)(n!)?1kj = 1?n?xjn
, for n even. Integral operators are defined using the fundamental solutions pn(x, t) to ut = Au and using real polynomials ql,…, qk on Rm by the formula, for q = (ql,…, qk),
(F(t)?)(x) = ∫
Rm
?(x + q(z)) Pn(z, t)dz
. It is determined when, strongly on L2(Rk),
etQ = limj → ∞ Ftjj
. If n = 2 or k = 1, this can always be done. Otherwise the symbol of Q must have a special form.  相似文献   

19.
20.
In a recent paper [3] the authors derived maximum principles which involved u(x) and q = ¦grad, where u(x) is a classical solution of an alliptic differential equation of the form (g(q2)u,i),i + ?(u) ?(q2) = 0. In this paper these results are extended to the more general case in which g = g(u, q2) and ?(u) ?(q2) is replaced by h(u, q2).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号