We introduce different ways of being dependent for the input noise of stochastic algorithms. We are aimed to prove that such innovations allow to use the ODE (ordinary differential equation) method. Illustrations to the linear regression frame and to the law of large numbers for triangular arrays of weighted dependent random variables are also given.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The aim of this paper is to refine a weak invariance principle for stationary sequences given by Doukhan and Louhichi [10]. Since our conditions are not causal, our assumptions need to be stronger than the mixing and causal 0-weak dependence assumptions used in Dedecker and Doukhan [5]. Here, if moments of order greater than 2 exist, a weak invariance principle and convergence rates in the CLT are obtained; Doukhan and Louhichi [10] assumed the existence of moments with order greater than 4. Besides the η and к-weak dependence conditions used previously, we introduce a weaker one, λ, which fits the Bernoulli shifts with dependent inputs.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.