Displaying 1081 – 1100 of 1890

Showing per page

On the convergence of extreme distributions under power normalization

E. M. Nigm (2008)

Applicationes Mathematicae

This paper deals with the convergence in distribution of the maximum of n independent and identically distributed random variables under power normalization. We measure the difference between the actual and asymptotic distributions in terms of the double-log scale. The error committed when replacing the actual distribution of the maximum under power normalization by its asymptotic distribution is studied, assuming that the cumulative distribution function of the random variables is known. Finally,...

On the convergence of moments in the almost sure central limit theorem for stochastic approximation algorithms

Peggy Cénac (2013)

ESAIM: Probability and Statistics

We study the almost sure asymptotic behaviour of stochastic approximation algorithms for the search of zero of a real function. The quadratic strong law of large numbers is extended to the powers greater than one. In other words, the convergence of moments in the almost sure central limit theorem (ASCLT) is established. As a by-product of this convergence, one gets another proof of ASCLT for stochastic approximation algorithms. The convergence result is applied to several examples as estimation...

On the convergence of moments in the CLT for triangular arrays with an application to random polynomials

Christophe Cuny, Michel Weber (2006)

Colloquium Mathematicae

We give a proof of convergence of moments in the Central Limit Theorem (under the Lyapunov-Lindeberg condition) for triangular arrays, yielding a new estimate of the speed of convergence expressed in terms of νth moments. We also give an application to the convergence in the mean of the pth moments of certain random trigonometric polynomials built from triangular arrays of independent random variables, thereby extending some recent work of Borwein and Lockhart.

On the convergence of sequences of iterates of random-valued vector functions

Rafał Kapica (2007)

Annales Polonici Mathematici

Given a probability space (Ω,,P) and a subset X of a normed space we consider functions f:X × Ω → X and investigate the speed of convergence of the sequence (fⁿ(x,·)) of the iterates f : X × Ω X defined by f¹(x,ω ) = f(x,ω₁), f n + 1 ( x , ω ) = f ( f ( x , ω ) , ω n + 1 ) .

On the convergence of the ensemble Kalman filter

Jan Mandel, Loren Cobb, Jonathan D. Beezley (2011)

Applications of Mathematics

Convergence of the ensemble Kalman filter in the limit for large ensembles to the Kalman filter is proved. In each step of the filter, convergence of the ensemble sample covariance follows from a weak law of large numbers for exchangeable random variables, the continuous mapping theorem gives convergence in probability of the ensemble members, and L p bounds on the ensemble then give L p convergence.

On the discretization in time of parabolic stochastic partial differential equations

Jacques Printems (2001)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We first generalize, in an abstract framework, results on the order of convergence of a semi-discretization in time by an implicit Euler scheme of a stochastic parabolic equation. In this part, all the coefficients are globally Lipchitz. The case when the nonlinearity is only locally Lipchitz is then treated. For the sake of simplicity, we restrict our attention to the Burgers equation. We are not able in this case to compute a pathwise order of the approximation, we introduce the weaker notion...

On the discretization in time of parabolic stochastic partial differential equations

Jacques Printems (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

We first generalize, in an abstract framework, results on the order of convergence of a semi-discretization in time by an implicit Euler scheme of a stochastic parabolic equation. In this part, all the coefficients are globally Lipchitz. The case when the nonlinearity is only locally Lipchitz is then treated. For the sake of simplicity, we restrict our attention to the Burgers equation. We are not able in this case to compute a pathwise order of the approximation, we introduce the weaker notion...

Currently displaying 1081 – 1100 of 1890