Related papers: Computable Bounds for Strong Approximations with A…
We study the Cram\'er type moderate deviation for partial sums of random fields by applying the conjugate method. The results are applicable to the partial sums of linear random fields with short or long memory and to nonparametric…
Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…
We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.
In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…
We derive both Azuma-Hoeffding and Burkholder-type inequalities for partial sums over a rectangular grid of dimension $d$ of a random field satisfying a weak dependency assumption of projective type: the difference between the expectation…
We provide non-asymptotic, relative deviation bounds for the eigenvalues of empirical covariance and Gram matrices in general settings. Unlike typical uniform bounds, which may fail to capture the behavior of smaller eigenvalues, our…
We provide non-asymptotic bounds and asymptotic limits for convex transport costs between the distribution of partial sums of independent and identically distributed square integrable and centered random variables and the normal…
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 work [8] established memory loss in the time-dependent (non-random) case of uniformly expanding maps of the interval. Here we find conditions under which we have convergence to the normal distribution of the appropriately scaled…
Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…
Computable and sharp error bounds are derived for asymptotic expansions for linear differential equations having a simple turning point. The expansions involve Airy functions and slowly varying coefficient functions. The sharpness of the…
In this paper we prove an analogue of the Koml\'os-Major-Tusn\'ady (KMT) embedding theorem for random walk bridges. The random bridges we consider are constructed through random walks with i.i.d jumps that are conditioned on the locations…
We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…
It is known that the normalized algorithmic information distance $N$ is not computable and not semicomputable. We show that for all $\epsilon < 1/2$, there exist no semicomputable functions that differ from $N$ by at most~$\epsilon$.…
The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…
In this article we establish Cram\'er type moderate deviation results for (intermediate) trimmed means $T_n=n^{-1} \sum_{i=k_n+1}^{n-m_n}X_{i:n}$, where $X_{i:n}$ -- the order statistics corresponding to the first $n$ observations of…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
In this work, we show that uniform integrability is not a necessary condition for central limit theorems (CLT) to hold for normalized multilevel Monte Carlo (MLMC) estimators and we provide near optimal weaker conditions under which the CLT…
Ratios of integrals can be bounded in terms of ratios of integrands under certain monotonicity conditions. This result, related with L'H\^{o}pital's monotone rule, can be used to obtain sharp bounds for cumulative distribution functions. We…
We develop a Hungarian construction for the partial sum process of independent non-identically distributed random variables. The process is indexed by functions $f$ from a class $\mathcal{H}$, but the supremum over $f\in $ $\mathcal{H}$ is…