On a functional contraction method

Abstract: We prove a Berry-Esseen type inequality for approximating expectations of sufficiently smooth functions $f$, like $f=|\cdot|^3$, with respect to standardized convolutions of laws $P_1,\ldots, P_n$ on the real line by corresponding expectations based on symmetric two-point laws $Q_1,\ldots,Q_n$ isoscedastic to the $P_i$. Equality is attained for every possible constellation of the Lipschitz constant $\|f"\|^{}_{\mathrm{L}}$ and the variances and the third centred absolute moments of the $P_i$. The error bound is strictly smaller than $\frac 16$ times the Lyapunov ratio times $\|f"\|^{}_{\mathrm{L}}$, and tends to zero also if $n$ is fixed and the third standardized absolute moments of the $P_i$ tend to one. In the homoscedastic case of equal variances of the $P_i$, and hence in particular in the i.i.d. case, the approximating law is a standardized symmetric binomial one. The inequality is strong enough to yield for some constellations, in particular in the i.i.d. case with $n$ large enough given the standardized third absolute moment of $P_1$, an improvement of a more classical and already optimal Berry-Esseen type inequality of Tyurin (2009). Auxiliary results presented include some inequalities either purely analytical or concerning Zolotarev's $\zeta$-metrics, and some binomial moment calculations.

TL;DR: A la portada diu "Article-based thesis", Tesi amb diferents seccions retallades per dret de l'editor.

TL;DR: The model of independent data identically generated from a Markov chain is considered and weak convergence for the normalized process of complexities when indexed by the ranks is found while for more general Markov sources these processes are not tight under the standard normalizations.

TL;DR: The complexity of FIND is considered as a process in the rank to be selected and measured by the number of key comparisons required and weak convergence of the complexity to a centered Gaussian process as n \to \infty is shown.

TL;DR: Stochastic processes are probabilistic models of data streams such as speech, audio and video signals, stock market prices, and measurements of physical phenomena by digital sensors such as medical instruments, GPS receivers, or seismographs that are essential for understanding phenomena and processing information.

TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.

TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.

TL;DR: In this article, the General Theory of Stochastic Processes, Semimartingales, and Stochastically Integrals is discussed and the convergence of Processes with Independent Increments is discussed.