SearcharxivSearch

arXiv subjects

M Peligrad

Publications and source records attributed to M Peligrad.

4 recordsLinked to original sources

On Berry Esseen type estimates for randomized Martingales in the non stationary setting

In this paper, we consider partial sums of triangular martingale differences weighted by random variables drawn uniformly on the sphere, and globally independent of the martingale differences. Starting from the so-called principle of conditioning and using some arguments developed by Klartag-Sodin and Bobkov-Chistyakov-G{\"o}tze, we give some upper bounds for the Kolmogorov distance between the distribution of these weighted sums and a Normal distribution. Under some conditions on the conditional variances of the martingale differences, the obtained rates are always faster than those obtained in case of usual partial sums.

math.PR

Rates in the central limit theorem for random projections of Martingales

In this paper, we consider partial sums of martingale differences weighted by random variables drawn uniformly on the sphere, and globally independent of the martingale differences. Combining Lindeberg's method and a series of arguments due to Bobkov, Chistyakov and G{\"o}tze, we show that the Kolmogorov distance between the distribution of these weighted sums and the limiting Gaussian is "super-fast" of order (log n)^2 /n, under conditions allowing us to control the higher-order conditional moments of the martingale differences. We give an application of this result to the least squares estimator of the slope in the linear model with Gaussian design.

math.PR

Berry-Esseen type bounds for the Left Random Walk on GL d (R) under polynomial moment conditions

Let $A_n= \varepsilon_n \cdots \varepsilon_1$, where $(\varepsilon_n)_{n \geq 1}$ is a sequence of independent random matrices taking values in $ GL_d(\mathbb R)$, $d \geq 2$, with common distribution $μ$. In this paper, under standard assumptions on $μ$ (strong irreducibility and proximality), we prove Berry-Esseen type theorems for $\log ( \Vert A_n \Vert)$ when $μ$ has a polynomial moment. More precisely, we get the rate $((\log n) / n)^{q/2-1}$ when $μ$ has a moment of order $q \in ]2,3]$ and the rate $1/ \sqrt{n} $ when $μ$ has a moment of order $4$, which significantly improves earlier results in this setting.

math.PR