Add to ORKGAbstract. We will investigate an almost sure central limit theorem (ASCLT) for sequences of random variables having the form of a ratio of two terms such that the numerator satisfies the ASCLT and the denominator is a positive term which converges almost surely to one. This result leads to the ASCLT for least squares estimators for Ornstein–Uhlenbeck process driven by fractional Brownian motion
We study the almost sure asymptotic behaviour of stochastic approximation algorithms for the search ...
Abstract. Almost sure limit theorems are presented for random allocations. A general almost sure lim...
Let X1, X2,... be independent, identically distributed random variables with EX1 = 0, EX12 = 1 and l...
We will investigate an almost sure central limit theorem ASCLT for sequences of random variables ha...
We prove an almost sure central limit theorem (ASCLT) for strongly mixing sequence of random variabl...
In this paper, we deal with an Ornstein–Uhlenbeck process driven by sub-fractional Brownian motion o...
We prove an almost sure central limit theorem (ASCLT) for strongly mixing sequence of random variabl...
We prove the almost sure central limit theorem for martingales via an original approach which uses t...
We use a Stochastic Differential Equation satisfied by Brownian motion taking values in the unit sph...
We prove an almost sure central limit theorem for some multidimensional stochastic algorithms used f...
Abstract. The purpose of this paper is the proof of an almost sure central limit theorem for subsequ...
We prove the almost sure central limit theorem for martingales via an original approach which uses t...
In this paper, the almost sure central limit theorem is established for sequences of negatively asso...
19 pagesInternational audienceWe prove the almost sure central limit theorem for martingales via an ...
The starting point for the thesis is an Ornstein-Uhlenbeck type stochastic differential equation dXt...
We study the almost sure asymptotic behaviour of stochastic approximation algorithms for the search ...
Abstract. Almost sure limit theorems are presented for random allocations. A general almost sure lim...
Let X1, X2,... be independent, identically distributed random variables with EX1 = 0, EX12 = 1 and l...
We will investigate an almost sure central limit theorem ASCLT for sequences of random variables ha...
We prove an almost sure central limit theorem (ASCLT) for strongly mixing sequence of random variabl...
In this paper, we deal with an Ornstein–Uhlenbeck process driven by sub-fractional Brownian motion o...
We prove an almost sure central limit theorem (ASCLT) for strongly mixing sequence of random variabl...
We prove the almost sure central limit theorem for martingales via an original approach which uses t...
We use a Stochastic Differential Equation satisfied by Brownian motion taking values in the unit sph...
We prove an almost sure central limit theorem for some multidimensional stochastic algorithms used f...
Abstract. The purpose of this paper is the proof of an almost sure central limit theorem for subsequ...
We prove the almost sure central limit theorem for martingales via an original approach which uses t...
In this paper, the almost sure central limit theorem is established for sequences of negatively asso...
19 pagesInternational audienceWe prove the almost sure central limit theorem for martingales via an ...
The starting point for the thesis is an Ornstein-Uhlenbeck type stochastic differential equation dXt...
We study the almost sure asymptotic behaviour of stochastic approximation algorithms for the search ...
Abstract. Almost sure limit theorems are presented for random allocations. A general almost sure lim...
Let X1, X2,... be independent, identically distributed random variables with EX1 = 0, EX12 = 1 and l...