Tight Probability Processes
📂Probability TheoryTight Probability Processes
Definition
Let us say in a probability space (Ω,F,P), a stochastic process {Xn}n∈N is defined. If for every ε>0, there exists a compact set K⊂Ω such that
n∈NinfP(Xn∈K)>1−ε
is satisfied, then {Xn} is said to be tight.
Explanation
In mathematical statistics, it corresponds to the concept of boundedness in probability. Tightness is important in relation to convergence in distribution, possessing several crucial properties as follows.
Fundamental Properties
Let X, {Xn}n∈N be a probabilistic element and stochastic process defined in a metric space (S,d) and let H:=C(S,R).
- [1]: If {Xn} is tight, it is precompact.
- [2]: If {Xn} is tight, then for all h∈H, if h(Xn)→Dh(X), then Xn→DX
Assuming X, {Xn}n∈N are probabilistic element and stochastic process defined in C[0,1] respectively.
- [3]: Supposing that X is a probabilistic element in S=C[0,1]. If at all finite subsets A of points a in [0,1], Xn(a)→WX(a) and {Xn} is tight, then Xn→DX
- [4]: That {Xn} is tight implies (i) for all ε>0,
δ→0limn→∞limsupP(∣s−t∣<δsup∣Xn(s)−Xn(t)∣≥ε)=0
and (ii) {Xn(0)} being tight is equivalent.
- C[0,1] represents the space of continuous functions with domain [0,1] and codomain R.
- C(S,R) is the space of continuous functions with domain S and codomain R.
See Also