Related papers: Central limit theorem and Diophantine approximatio…
We prove functional central limit theorems for the dynamic elephant random walk in the $\sqrt{n}$ and $\sqrt{n\log n}$ orders, by applying the martingale convergence theorem and Karamata's theory of regular variation.
In this paper, we develop local expansions for the ratio of the centered matrix-variate $T$ density to the centered matrix-variate normal density with the same covariances. The approximations are used to derive upper bounds on several…
The number of comparisons X_n used by Quicksort to sort an array of n distinct numbers has mean mu_n of order n log n and standard deviation of order n. Using different methods, Regnier and Roesler each showed that the normalized variate…
We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…
It is shown that the Kolmogorov distance between the spectral distribution function of a random covariance matrix $\frac1p XX^T$, where $X$ is a $n\times p$ matrix with independent entries and the distribution function of the…
Under the Kolmogorov--Smirnov metric, an upper bound on the rate of convergence to the Gaussian distribution is obtained for linear statistics of the matrix ensembles in the case of the Gaussian, Laguerre, and Jacobi weights. The main lemma…
We prove the large-dimensional Gaussian approximation of a sum of $n$ independent random vectors in $\mathbb{R}^d$ together with fourth-moment error bounds on convex sets and Euclidean balls. We show that compared with classical…
We prove for the rescaled convolution map $f\to f\circledast f$ propagation of polynomial, exponential and gaussian localization. The gaussian localization is then used to prove an optimal bound on the rate of entropy production by this…
We derive a central limit theorem for the probability distribution of the sum of many critically correlated random variables. The theorem characterizes a variety of different processes sharing the same asymptotic form of anomalous scaling…
In this paper we survey and further study partial sums of a stationary process via approximation with a martingale with stationary differences. Such an approximation is useful for transferring from the martingale to the original process the…
We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…
We study the asymptotic shape of the trajectory of the stochastic gradient descent algorithm applied to a convex objective function. Under mild regularity assumptions, we prove a functional central limit theorem for the properly rescaled…
The log-partition function $ \log W_N(\beta)$ of the two-dimensional directed polymer in random environment is known to converge in distribution to a normal distribution when considering temperature in the subcritical regime…
We derive asymptotic formulas for central extended binomial coefficients, which are generalizations of binomial coefficients. To do so, we relate the exact distribution of the sum of independent discrete uniform random variables to the…
For rescaled additive functionals of the sine-process, upper bounds are obtained for their speed of convergence to the Gaussian distribution with respect to the Kolmogorov-Smirnov metric. Under scaling with coefficient $R$ the…
Suppose $F:=(f_1,\ldots,f_n)$ is a system of random $n$-variate polynomials with $f_i$ having degree $\leq\!d_i$ and the coefficient of $x^{a_1}_1\cdots x^{a_n}_n$ in $f_i$ being an independent complex Gaussian of mean $0$ and variance…
We obtain a functional central limit theorem (CLT) for sums of the form $\xi_N(t)=\frac1{\sqrt N}\sum_{n=1}^{[Nt]}\big(F(X(q_1(n)),...,X(q_\ell(n)))-\bar F\big)$ where $q_1,...,q_\ell$ are polynomials.
We develop techniques for determining an explicit Berry-Esseen bound in the Kolmogorov distance for the normal approximation of a ratio of Gaussian functionals. We provide an upper bound in terms of the third and fourth cumulants, using…
In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally…
The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in…