On the simulation of expectations of random variables depending on a stopping time (Q4039248)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 179297
Language Label Description Also known as
default for all languages
No label defined
    English
    On the simulation of expectations of random variables depending on a stopping time
    scientific article; zbMATH DE number 179297

      Statements

      On the simulation of expectations of random variables depending on a stopping time (English)
      0 references
      0 references
      9 December 1993
      0 references
      simulation of expectations
      0 references
      stopping time
      0 references
      Markov chain
      0 references
      random variables
      0 references
      rate of convergence
      0 references
      numerical examples
      0 references
      Let \((X_ n)\) be a Markov chain defined by \(X_{n+1}=H(X_ n,n,h(U_{nd+1},\dots,U_{(n+1)d}))\), \(X_ 0=x\), where \(U_ n\) are i.i.d. random variables on [0,1]. Let \(T\) be the reading time \(T=\inf\{n\geq 1: X_ n\in A\}\) of a Borel set \(A\). The shift operator is defined by \(H(U_ 1,U_ 2,\dots,U_ k,\dots)=(U_ 2,U_ 3,\dots,U_ k,\dots)\). The expectation \(\text{EG}(X_ T,T)\) can be evaluated by Birkhoff's pointwise ergodic theorem, that is: \(\text{EG}(X_ T,T)=\lim_{N\to\infty}(1/N)\sum^{N-1}_{n=0} G(X_ T,T)\circ H^{nd}\) (a.s.) if \(G(X_ T,T)\in L^ 1\). Numerical aspects, the convergence in distribution, the rate of convergence and numerical examples are discussed.
      0 references

      Identifiers