On the Rate of Convergence in the CLT with Respect to the Kantorovich Metric

1994 ◽  
pp. 193-207 ◽  
Author(s):  
S. T. Rachev ◽  
L. Rüschendorf
2019 ◽  
Vol 14 (1) ◽  
pp. 105-122
Author(s):  
Chuang Xu

AbstractThis paper studies the distributional asymptotics of the slowly changing sequence of logarithms (logb n) with b ∈ 𝕅 \ {1}. It is known that (logbn) is not uniformly distributed modulo one, and its omega limit set is composed of a family of translated exponential distributions with constant log b. An improved upper estimate (\sqrt {\log N} /N) is obtained for the rate of convergence with respect to (w. r. t.)the Kantorovich metric on the circle, compared to the general results on rates of convergence for a class of slowly changing sequences in the author’s companion in-progress work. Moreover, a sharp rate of convergence (log N/N)w. r. t. the Kantorovich metric on the interval [0, 1], is derived. As a byproduct, the rate of convergence w.r.t. the discrepancy metric (or the Kolmogorov metric) turns out to be (log N/N) as well, which verifies that an upper bound for this rate derived in [Ohkubo, Y.—Strauch, O.: Distribution of leading digits of numbers, Unif. Distrib. Theory, 11 (2016), no.1, 23–45.] is sharp.


1986 ◽  
Vol 23 (04) ◽  
pp. 1019-1024
Author(s):  
Walter Van Assche

The limit of a product of independent 2 × 2 stochastic matrices is given when the entries of the first column are independent and have the same symmetric beta distribution. The rate of convergence is considered by introducing a stopping time for which asymptotics are given.


Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 880
Author(s):  
Igoris Belovas

In this research, we continue studying limit theorems for combinatorial numbers satisfying a class of triangular arrays. Using the general results of Hwang and Bender, we obtain a constructive proof of the central limit theorem, specifying the rate of convergence to the limiting (normal) distribution, as well as a new proof of the local limit theorem for the numbers of the tribonacci triangle.


2020 ◽  
Vol 20 (4) ◽  
pp. 783-798
Author(s):  
Shukai Du ◽  
Nailin Du

AbstractWe give a factorization formula to least-squares projection schemes, from which new convergence conditions together with formulas estimating the rate of convergence can be derived. We prove that the convergence of the method (including the rate of convergence) can be completely determined by the principal angles between {T^{\dagger}T(X_{n})} and {T^{*}T(X_{n})}, and the principal angles between {X_{n}\cap(\mathcal{N}(T)\cap X_{n})^{\perp}} and {(\mathcal{N}(T)+X_{n})\cap\mathcal{N}(T)^{\perp}}. At the end, we consider several specific cases and examples to further illustrate our theorems.


2021 ◽  
Vol 58 (1) ◽  
pp. 22-41
Author(s):  
Fabian A. Harang ◽  
Marc Lagunas-Merino ◽  
Salvador Ortiz-Latorre

AbstractWe propose a new multifractional stochastic process which allows for self-exciting behavior, similar to what can be seen for example in earthquakes and other self-organizing phenomena. The process can be seen as an extension of a multifractional Brownian motion, where the Hurst function is dependent on the past of the process. We define this by means of a stochastic Volterra equation, and we prove existence and uniqueness of this equation, as well as giving bounds on the p-order moments, for all $p\geq1$. We show convergence of an Euler–Maruyama scheme for the process, and also give the rate of convergence, which is dependent on the self-exciting dynamics of the process. Moreover, we discuss various applications of this process, and give examples of different functions to model self-exciting behavior.


2020 ◽  
Vol 57 (4) ◽  
pp. 1029-1044
Author(s):  
Svante Janson

AbstractConsider a Pólya urn with balls of several colours, where balls are drawn sequentially and each drawn ball is immediately replaced together with a fixed number of balls of the same colour. It is well known that the proportions of balls of the different colours converge in distribution to a Dirichlet distribution. We show that the rate of convergence is $\Theta(1/n)$ in the minimal $L_p$ metric for any $p\in[1,\infty]$, extending a result by Goldstein and Reinert; we further show the same rate for the Lévy distance, while the rate for the Kolmogorov distance depends on the parameters, i.e. on the initial composition of the urn. The method used here differs from the one used by Goldstein and Reinert, and uses direct calculations based on the known exact distributions.


Sign in / Sign up

Export Citation Format

Share Document