Hubbry Logo
Big O in probability notationBig O in probability notationMain
Open search
Big O in probability notation
Community hub
Big O in probability notation
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Big O in probability notation
Big O in probability notation
from Wikipedia

The order in probability notation is used in probability theory and statistical theory in direct parallel to the big O notation that is standard in mathematics. Where the big O notation deals with the convergence of sequences or sets of ordinary numbers, the order in probability notation deals with convergence of sets of random variables, where convergence is in the sense of convergence in probability.[1]

Definitions

[edit]

Small o: convergence in probability

[edit]

For a set of random variables Xn and corresponding set of constants an (both indexed by n, which need not be discrete), the notation

means that the set of values Xn/an converges to zero in probability as n approaches an appropriate limit. Equivalently, Xn = op(an) can be written as Xn/an = op(1), i.e.

for every positive ε.[2]

Big O: stochastic boundedness

[edit]

The notation

means that the set of values Xn/an is stochastically bounded. That is, for any ε > 0, there exists a finite M > 0 and a finite N > 0 such that

Comparison of the two definitions

[edit]

The difference between the definitions is subtle. If one uses the definition of the limit, one gets:

  • Big :
  • Small :

The difference lies in the : for stochastic boundedness, it suffices that there exists one (arbitrary large) to satisfy the inequality, and is allowed to be dependent on (hence the ). On the other hand, for convergence, the statement has to hold not only for one, but for any (arbitrary small) . In a sense, this means that the sequence must be bounded, with a bound that gets smaller as the sample size increases.

This suggests that if a sequence is , then it is , i.e. convergence in probability implies stochastic boundedness. But the reverse does not hold.

Example

[edit]

If is a stochastic sequence such that each element has finite variance, then

(see Theorem 14.4-1 in Bishop et al.)

If, moreover, is a null sequence for a sequence of real numbers, then converges to zero in probability by Chebyshev's inequality, so

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In and asymptotic statistics, Big O notation in probability, commonly denoted as OpO_p, provides a framework for describing the of sequences of random variables, extending the deterministic to account for probabilistic . Formally, a sequence of random variables {Xn}\{X_n\} satisfies Xn=Op(an)X_n = O_p(a_n) for a deterministic sequence an>0a_n > 0 if Xn/an=Op(1)X_n / a_n = O_p(1), meaning that Xn/anX_n / a_n is bounded in probability: for every , there exists a finite M(ϵ)>0M(\epsilon) > 0 such that P(Xn/an>M(ϵ))ϵP(|X_n / a_n| > M(\epsilon)) \leq \epsilon for all sufficiently large nn. This notation captures that XnX_n does not grow faster than ana_n asymptotically, up to a stochastic bound, and is particularly useful for analyzing the limiting of estimators and test statistics in large-sample inference. Closely related is the little o notation in probability, denoted opo_p, which strengthens the condition: Xn=op(an)X_n = o_p(a_n) if Xn/an=op(1)X_n / a_n = o_p(1), or equivalently, Xn/anP0X_n / a_n \xrightarrow{P} 0
Add your contribution
Related Hubs
User Avatar
No comments yet.