Related papers: Approximation by mixtures of multivariate Erlang d…

We consider estimating the parameters of a Gaussian mixture density with a given number of components best representing a given set of weighted samples. We adopt a density interpretation of the samples by viewing them as a discrete Dirac…

This article offers a simplified approach to the distribution theory of randomly weighted averages or $P$-means $M_P(X):= \sum_{j} X_j P_j$, for a sequence of i.i.d.random variables $X, X_1, X_2, \ldots$, and independent random weights $P:=…

Posterior inference for Dirichlet process mixture models is analytically intractable and typically relies on Markov chain Monte Carlo methods, which can become computationally prohibitive at moderate to large sample sizes. In this work, we…

Near-deterministic positive delays require highly concentrated distributions, but phase-type models are constrained by the Erlang variance limit. While matrix-exponential distributions can empirically bypass this barrier, prior low-variance…

Given a normalized Orlicz function $M$ we provide an easy formula for a distribution such that, if $X$ is a random variable distributed accordingly and $X_1,...,X_n$ are independent copies of $X$, then the expected value of the p-norm of…

We give direct and inverse theorems for the weighted approximation of functions with endpoint singularities by combinations of Bernstein operators.

Using Chen-Stein method in combination with size-biased couplings, we obtain the multivariate Poisson approximation in terms of the Wasserstein distance. As applications, we study the multivariate Poisson approximation of the distribution…

Exact-order estimates are obtained for some approximation characteristics of the classes of periodic multivariate functions with mixed smoothness (the Nikol'skii-Besov classes $B^{\boldsymbol{r}}_{p, \theta}$) in the space $B_{q,1}$, $1…

As it is known, universal codes, which estimate the entropy rate consistently, exist for stationary ergodic sources over finite alphabets but not over countably infinite ones. We generalize universal coding as the problem of universal…

For a variant of the algorithm in [Pit19] (arXiv:1903.10816) to compute the approximate density or distribution function of a linear mixture of independent random variables known by a finite sample, it is presented a proof of the functional…

Using a transference result, several inequalities of approximation by entire functions of exponential type in $\mathcal{C}(\mathbf{R})$, the class of bounded uniformly continuous functions defined on $\mathbf{R}:=\left( -\infty ,+\infty…

This article contributes to the new summation of Sz\'asz operators with the help of Appell polynomials of class $A^{2}$. We verified Bohman-Korovkin's theorem and prove the convergence results like Lipschitz-type space, Voronvaskaja-type…

We show that if an essentially arbitrary sequence supported on an interval containing $x$ integers, is convolved with a tiny Siegel-Walfisz-type sequence supported on an interval containing $\exp((\log x)^{\varepsilon})$ integers then the…

Gaussian errors are sometimes inappropriate in a multivariate linear regression setting because, for example, the data contain outliers. In such situations, it is often assumed that the error density is a scale mixture of multivariate…

We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…

We study maximal averages associated with singular measures on $\rr$. Our main result is a construction of singular Cantor-type measures supported on sets of Hausdorff dimension $1 - \epsilon$, $0 \leq \epsilon < {1/3}$ for which the…

Approximation of high-dimensional functions is a problem in many scientific fields that is only feasible if advantageous structural properties, such as sparsity in a given basis, can be exploited. A relevant tool for analysing sparse…

Over the past decade, a combinatorial framework for discrete, finite, and irreversibly aggregating systems has emerged. This work reviews its progress, practical applications, and limitations. We outline the approach's assumptions and…

Given a compact metric space (X,d) equipped with a non-atomic, probability measure m and a real, positive decreasing function p we consider a `natural' class of limsup subsets La(p) of X. The classical limsup sets of `well approximable'…

We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…