首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
LetX be the solution of the SDE:dX t = (X t)dB t +b(X t)dt, with andb C b (R) such that >0 for some constant , andB a real Brownian motion. Let be the law ofX onE=C([0, 1],R) andk E* – {0}, whereE* is the topological dual space ofE. Consider the classical form: k (u, v)=u / kv / kd, whereu andv are smooth functions onE. We prove that, if k is closable for anyk in a dense subset ofE* and if the smooth functions are contained in the domain of the generator of the closure of k , must be a constant function.  相似文献   

2.
Consider a triangular array of standard Gaussian random variables {n,i, i 0, n 1} such that {n,i, i 0} is a stationary normal sequence for each n 1. Let n,k = corr(n,i,n,i+k). If (1-n,k)log n k (0,) as n for some k, then the locations where the extreme values occur cluster and the limiting distribution of the maxima is still the Gumbel distribution as in the stationary or i.i.d. case, but shifted by a parameter measuring the clustering. Triangular arrays of Gaussian sequences are used to approximate a continuous Gaussian process X(t), t 0. The cluster behavior of the random sequence refers to the behavior of the extremes values of the continuous process. The relation is analyzed. It reveals a new definition of the constants H used for the limiting distribution of maxima of continuous Gaussian processes and provides further understanding of the limit result for these extremes.  相似文献   

3.
The imaginary powersA it of a closed linear operatorA, with inverse, in a Banach spaceX are considered as aC 0-group {exp(itlogA);t R} of bounded linear operators onX, with generatori logA. Here logA is defined as the closure of log(1+A) – log(1+A –1). LetA be a linearm-sectorial operator of typeS(tan ), 0(/2), in a Hilbert spaceX. That is, |Im(Au, u)| (tan )Re(Au, u) foru D(A). Then ±ilog(1+A) ism-accretive inX andilog(1+A) is the generator of aC 0-group {(1+A) it ;t R} of bounded imaginary powers, satisfying the estimate (1+A) it exp(|t|),t R. In particular, ifA is invertible, then ±ilogA ism-accretive inX, where logA is exactly given by logA=log(1+A)–log(1+A –1), and {A it;t R} forms aC 0-group onX, with the estimate A it exp(|t|),t R. This yields a slight improvement of the Heinz-Kato inequality.  相似文献   

4.
Let be a Poisson process on d of intensity and letW 1(t),W 2 (t),..., be a sequence of independent Wiener processes. LetW i (t)=X i +W i (t) whereX 1,X 2,..., are the points of . Consider the processess(t)=#{i:X i (t)1}. These and related processes are studied.  相似文献   

5.
Summary For a strictly stationary random sequence (X i) i0 we find sufficient conditions such that the distribution of the last exit time t = max{i X i>i} (>0) tends weakly to a nondegenerate limit distribution as 0.  相似文献   

6.
Summary A random timeT is a future independent time for a Markov chain (X n ) 0 ifT is independent of (X T+n ) n / =0 and if (X T+n ) n / =0 is a Markov chain with initial distribution and the same transition probabilities as (X n ) 0 . This concept is used (with the conditional stationary measure) to give a new and short proof of the basic limit theorem of Markov chains, improving somewhat the result in the null-recurrent case.This work was supported by the Swedish Natural Science Research Council and done while the author was visiting the Department of Statistics, Stanford University  相似文献   

7.
We study limit distribution of partial sums SN,k(t) = s = 1 [N t] Ak(Xs) of Appell polynomials of the long-range dependent moving average process Xt> = i t bt - i i, where {i} is a strictly stationary and weakly dependent martingale difference sequence, and bi id - 1 (0 < d < 1/2). We show that if k(1-2 d)<1, then suitably normalized partial sums SN,k(t) converge in distribution to the kth order Hermite process. This result generalizes the corresponding results of Surgailis, and Avram and Taqqu obtained in the case of the i.i.d. sequence { i}.  相似文献   

8.
1.IntroductionConsiderthemodelY=X"0 g(T) E,(1'1)whereX"~(xl,',xo)areexplanatoryvariablesthatenterlinearly,Pisakx1vectorofunknownparameters,Tisanotherexplanatoryvariablesthatentersinanonlinearfashion,g')isanunknownsmoothfunctionofTinR',(X,T)andeareindependent,andeistheerrorwithmean0andvariancea2.Trangesoveranondegeneratecompact1-dimensionalilltervalC*;withoutlossofgenerality,C*=[0,1].Chenl2]discussedasymptoticnormalityofestimatorsP.of0byusingpiecewisepolynthacaltoapproximateg.Speckmanls…  相似文献   

9.
Summary LetX, Y, Z be arbitrary nonempty sets,E be a nonempty subset ofZ z andK be a groupoid. Assume that {F t} t K Z X, {G t} t K Y X, {H t} t K Z Y are families of functions satisfying the functional equationF st = k(s,t) Hs Gt for (s, t) D(K), whereD(K) stands for the domain of the binary operation on the groupoidK andk (s,t) E for (s, t) D(K). Conditions are established under which the equation can be reduced to the corresponding Cauchy equation. This paper generalizes some results from [4] and [1].  相似文献   

10.
Consider a min-max problem in the form of min xX max1im {f i (x)}. It is well-known that the non-differentiability of the max functionF(x) max1im {f i (x)} presents difficulty in finding an optimal solution. An entropic regularization procedure provides a smooth approximationF p(x) that uniformly converges toF(x) overX with a difference bounded by ln(m)/p, forp > 0. In this way, withp being sufficiently large, minimizing the smooth functionF p(x) overX provides a very accurate solution to the min-max problem. The same procedure can be applied to solve systems of inequalities, linear programming problems, and constrained min-max problems.This research work was supported in part by the 1995 NCSC-Cray Research Grant and the National Textile Center Research Grant S95-2.  相似文献   

11.
Rovira  Carles  Tindel  Samy 《Potential Analysis》2001,14(4):409-435
We consider the family {X , 0} of solution to the heat equation on [0,T]×[0,1] perturbed by a small space-time white noise, that is t X = X +b({X })+({X }) . Then, for a large class of Borelian subsets of the continuous functions on [0,T]×[0,1], we get an asymptotic expansion of P({X }A) as 0. This kind of expansion has been handled for several stochastic systems, ranging from Wiener integrals to diffusion processes.  相似文献   

12.
We shall derive existence, uniqueness and comparison results for the functional differential equationx(t)=f(t, x), a. e.tI, with classical Nicoletti boundary conditionsx i(ti)=y iX, iA, whereI is a real interval,A is a nonempty set andX is a Banach space.  相似文献   

13.
Summary In this paper we give the construction of a parametrix for a class of differential operators of the type 2/t2–t2k+1 + tq(/xi), k N, q N, qk.  相似文献   

14.
Let {W(s)} s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)2, of the R2-valued process Y(t)=(1/t W(t), {12/t 3 int0 t s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup t [, 1] Y(t)2 > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.  相似文献   

15.
Let (K(s,t), 0s1, t1) be a Kiefer process, i.e., a continuous two-parameter centered Gaussian process indexed by [0,1]×+ whose covariance function is given by (K(s1,t1) K(s2,t2))=(s1s2-s1s2)t1t2, 0s1, s21, t1, t2 0. For each t>0, the process K(·,t) is a Brownian bridge on the scale of . Let M 1 * (t) M 2 * (t) M j * (t) 0 be the ranked excursion heights of K(,t). In this paper, we study the path properties of the process tM j * (t). Two laws of the iterated logarithm are established to describe the asymptotic behaviors of M j * (t) as t goes to infinity.  相似文献   

16.
One says thatt>0 is an increase time for a real-valued path if stays above the level (t) immediately after timet, and below (t) immediately before timet. Dvoretzkyet al.,(10) proved that Brownian motion has no increase times a.s. This result is extended here to (strictly) stable processes. Specifically, the probability that a stable processX possesses increase times is 0 if and only ifP(X 10)1/2.  相似文献   

17.
For a fixed unit vectora=(a 1,...,a n )S n-1, consider the 2 n sign vectors=(1,..., n ){±1{ n and the corresponding scalar products·a = n i=1 = i a i . The question that we address is: for how many of the sign vectors must.a lie between–1 and 1. Besides the straightforward interpretation in terms of the sums ±a 2 , this question has appealing reformulations using the language of probability theory or of geometry.The natural conjectures are that at least 1/2 the sign vectors yield |.a|1 and at least 3/8 of the sign vectors yield |.a|<1 (the latter excluding the case when |a i |=1 for somei). These conjectured lower bounds are easily seen to be the best possible. Here we prove a lower bound of 3/8 for both versions of the problem, thus completely solving the version with strict inequality. The main part of the proof is cast in a more general probabilistic framework: it establishes a sharp lower bound of 3/8 for the probability that |X+Y|<1, whereX andY are independent random variables, each having a symmetric distribution with variance 1/2.We also consider an asymptotic version of the question, wheren along a sequence of instances of the problem satisfying ||a||0. Our result, best expressed in probabilistic terms, is that the distribution of .a converges to the standard normal distribution, and in particular the fraction of sign vectors yielding .a between –1 and 1 tends to 68%.This research was supported in part by the Institute for Mathematics and its Applications with funds provided by the National Science Foundation.  相似文献   

18.
Let W be a non-negative random variable with EW=1, and let {W i } be a family of independent copies of W, indexed by all the finite sequences i=i 1i n of positive integers. For fixed r and n the random multiplicative measure n r has, on each r-adic interval at nth level, the density with respect to the Lebesgue measure on [0,1]. If EW log Wr, the sequence { n r } n converges a.s. weakly to the Mandelbrot measure r . For each fixed 1n, we study asymptotic properties for the sequence of random measures { n r } r as r. We prove uniform laws of large numbers, functional central limit theorems, a functional law of iterated logarithm, and large deviation principles. The function-indexed processes is a natural extension to a tree-indexed process at nth level of the usual smoothed partial-sum process corresponding to n=1. The results extend the classical ones for { 1 r } r , and the recent ones for the masses of { r } r established in Ref. 23.  相似文献   

19.
Let X=X 1,...,X n be the ring of formal power series inn indeterminates over . LetF:XAX+B(X)=(F (1)(X),...,F (n)(X))(X) n denote an automorphism of X and let 1,..., n be the eigenvalues of the linear partA ofF. We will say thatF has an analytic iteration (a. i.) if there exists a family (F t (itX)) t of automorphisms such thatF t(X) has coefficients analytic int and such thatF 0=X,F 1=F,F t+t=FtFt for allt,t. Let now a set=(ln1,...,ln n ) of determinations of the logarithms be given. We ask if there exists an a. i. ofF such that the eigenvalues of the linear partA(t) ofF t(X) are . We will give necessary and sufficient conditions forF to have such an a. i., namely thatF is conjugate to a semicanonical formN=T –1FT such that inN (k)(X) there appear at most monomialsX 1 1 ...X n n . This generalizes a result of Shl.Sternberg.

Herrn Prof. Dr. E. Hlawka zum 60. Geburtstag gewidmet  相似文献   

20.
LetX 1,X 2,... be a time-homogeneous {0, 1}-valued Markov chain. LetF 0 be the event thatl runs of 0 of lengthr occur and letF 1 be the event thatm runs of 1 of lengthk occur in the sequenceX 1,X 2, ... We obtained the recurrence relations of the probability generating functions of the distributions of the waiting time for the sooner and later occurring events betweenF 0 andF 1 by the non-overlapping way of counting and overlapping way of counting. We also obtained the recurrence relations of the probability generating functions of the distributions of the sooner and later waiting time by the non-overlapping way of counting of 0-runs of lengthr or more and 1-runs of lengthk or more.  相似文献   

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

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