Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Some strong limit theorems in averaging - MaRDI portal

Some strong limit theorems in averaging

From MaRDI portal
Publication:6411484

arXiv2209.10364MaRDI QIDQ6411484

Yuri Kifer

Publication date: 21 September 2022

Abstract: The paper deals with the fast-slow motions setups in the discrete time Xepsilon((n+1)epsilon)=Xepsilon(nepsilon)+epsilonB(Xepsilon(nepsilon),xi(n)), n=0,1,...,[T/epsilon] and the continuous time fracdXepsilon(t)dt=B(Xepsilon(t),xi(t/epsilon)).,tin[0,T] where B is a smooth vector function and xi is a sufficiently fast mixing stationary stochastic process. It is known since 1966 (Khasminskii) that if is the averaged motion then weakly converges to a Gaussian process G. We will show that for each epsilon the processes xi and G can be redefined on a sufficiently rich probability space without changing their distributions so that Esup0leqtleqT|Gepsilon(t)G(t)|2M=O(epsilondelta), delta>0 which gives also O(epsilondelta/3) Prokhorov distance estimate between the distributions of Gepsilon and G. In the product case B(x,xi)=Sigma(x)xi we obtain almost sure convergence estimates of the form sup0leqtleqT|Gepsilon(t)G(t)|=O(epsilondelta) a.s., as well as the functional form of the law of iterated logarithm for Gepsilon. We note that our mixing assumptions are adapted to fast motions generated by important classes of dynamical systems.












This page was built for publication: Some strong limit theorems in averaging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6411484)