共查询到20条相似文献,搜索用时 31 毫秒
1.
Let {εt;t ∈ Z} be a sequence of m-dependent B-valued random elements with mean zeros and finite second moment. {a3;j ∈ Z} is a sequence of real numbers satisfying ∑j=-∞^∞|aj| 〈 ∞. Define a moving average process Xt = ∑j=-∞^∞aj+tEj,t ≥ 1, and Sn = ∑t=1^n Xt,n ≥ 1. In this article, by using the weak convergence theorem of { Sn/√ n _〉 1}, we study the precise asymptotics of the complete convergence for the sequence {Xt; t ∈ N}. 相似文献
2.
Eike Born 《Journal of Theoretical Probability》1989,2(3):325-342
LetG be a locally compact group and (t)t 0 a continuous convolution semigroup of probability measures onG. We show that an operatorN is the infinitesimal generator of (t)t 0 iffN is defined at least on the spaceC
2(G) of twice right differentiable functions and if
相似文献
3.
Summary LetX be a diffusion in natural scale on (0,1], with 1 reflecting, and letc(x)(H
x
) andv(x)var (H
x
), whereH
x
=inf{t: X
t
=x}. Let
x
=sup{t:X
t
=x}. The main results of this paper are firstly that (i)c is slowly varying; (ii)
are all equivalent: and secondly that (v)
are all equivalent, and are implied by the condition
. Other partial results for more general limit theorems are proved, and new results on regular variation are established. 相似文献
4.
Ilwoo Cho 《Acta Appl Math》2007,95(2):95-134
In this paper, we will define a graph von Neumann algebra over a fixed von Neumann algebra M, where G is a countable directed graph, by a crossed product algebra = M ×
α
, where is the graph groupoid of G and α is the graph-representation. After defining a certain conditional expectation from onto its M-diagonal subalgebra we can see that this crossed product algebra is *-isomorphic to an amalgamated free product
where = vN(M ×
α
where is the subset of consisting of all reduced words in {e, e
–1} and M ×
α
is a W
*-subalgebra of as a new graph von Neumann algebra induced by a graph G
e
. Also, we will show that, as a Banach space, a graph von Neumann algebra is isomorphic to a Banach space ⊕
where is a certain subset of the set E(G)* of all words in the edge set E(G) of G.
The author really appreciates to Prof F. Radulescu and Prof P. Jorgensen for the valuable discussion and kind advice. Also,
he appreciates all supports from St. Ambrose Univ.. In particular, he thanks to Prof T. Anderson and Prof V. Vega for the
useful conversations and suggestions. 相似文献
5.
E. B. Dynkin 《Probability Theory and Related Fields》1993,94(3):399-411
Summary We consider Markov processes with a fixed transition functionp(r, x; t, B) and with random birth times. We show that a process
can be obtained from (X
t
,P) by birth delay if and only if
for allt andB. As an application, we give a new version and a new proof of the results of Rost [R] and Fitzsimmons [F2] on stopping distributions of Markov processes. The key Lemma 1.1 replaces the filling scheme used by the previous authors.Birth delay was considered from a different prospective in [F1].Partially supported by the National Science Foundation Grant DMS-8802667 相似文献
6.
The Komlós-Révész theorem states: For r.v.s.X
n
with X
n
1M there exists a subsequenceX
k
n
and a r.v.X with X1M such that
|