Related papers: Approximation complexity of homogeneous sums of ra…

In this paper, we present finite element approximations of a class of Generalized random fields defined over a bounded domain of R d or a smooth d-dimensional Riemannian manifold (d $\ge$ 1). An explicit expression for the covariance matrix…

We prove normal approximation bounds for statistics of randomly weighted (simplicial) complexes. In particular, we consider the complete $d$-dimensional complex on $n$ vertices with $d$-simplices equipped with i.i.d. weights. Our normal…

Let $\bX=\{X_n\}_{n\geq 1}$ and $\bY=\{Y_n\}_{n\geq 1}$ be two independent random sequences. We obtain rates of convergence to the normal law of randomly weighted self-normalized sums $$ \psi_n(\bX,\bY)=\sum_{i=1}^nX_iY_i/V_n,\quad…

We consider a problem of approximation of $d$-variate functions defined on $\mathbb{R}^d$ which belong to the Hilbert space with tensor product-type reproducing Gaussian kernel with constant shape parameter. Within worst case setting, we…

We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…

In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…

We study critera for a pair $ (\{ X_n \} $, $ \{ Y_n \}) $ of approximating processes which guarantee closeness of moments by generalizing known results for the special case that $ Y_n = Y $ for all $n$ and $ X_n $ converges to $Y$ in…

In this paper, we consider approximating expansions for the distribution of integer valued random variables, in circumstances in which convergence in law cannot be expected. The setting is one in which the simplest approximation to the…

Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with some theoretical frameworks.…

It is well known that any pair of random variables $(X,Y)$ with values in Polish spaces, provided that $Y$ is nonatomic, can be approximated in joint law by random variables of the form $(X',Y)$ where $X'$ is $Y$-measurable and $X'…

Let $AP_k=\{a,a+d,\ldots,a+(k-1)d\}$ be an arithmetic progression. For $\epsilon>0$ we call a set $AP_k(\epsilon)=\{x_0,\ldots,x_{k-1}\}$ an $\epsilon$-approximate arithmetic progression if for some $a$ and $d$, $|x_i-(a+id)|<\epsilon d$…

We study the asymptotic behaviour of stochastic processes that are generated by sums of partial sums of i.i.d. random variables and their renewals. We conclude that these processes cannot converge weakly to any nondegenerate random element…

We derive theorems which outline explicit mechanisms by which anomalous scaling for the probability density function of the sum of many correlated random variables asymptotically prevails. The results characterize general anomalous scaling…

Slowly convergent or divergent sequences and series occur abundantly in quantum physics and quantum chemistry. These convergence problems can be overcome with the help of nonlinear sequence transformations (Wynn's epsilon or rho algorithm,…

We consider a type of nonnormal approximation of infinitely divisible distributions that incorporates compound Poisson, Gamma, and normal distributions. The approximation relies on achieving higher orders of cumulant matching, to obtain…

We study the asymptotic behaviour of partial sums of long range dependent random variables and that of their counting process, together with an appropriately normalized integral process of the sum of these two processes, the so-called…

We consider the problem of evaluating certain types of functional aggregation queries on relational data subject to additive inequalities. Such aggregation queries, with a smallish number of additive inequalities, arise naturally/commonly…

We establish a quantitative normal approximation result for sums of random variables with multilevel local dependencies. As a corollary, we obtain a quantitative normal approximation result for linear functionals of random fields which may…

The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of $n$ data, permuted uniformly at random, the appropriately normalized complexity $Y_n$ is…

In this paper, we precisely quantify the wavelet compressibility of compound Poisson processes. To that end, we expand the given random process over the Haar wavelet basis and we analyse its asymptotic approximation properties. By only…