相关论文: On weighted approximations in $D[0, 1]$ with appli…

The complete convergence for weighted sums of sequences of independent, identically distributed random variables under sublinear expectations space was studied. By moment inequality and truncation methods, we establish the equivalent…

We consider random polynomials of the form $G_n(z):= \sum_{|\alpha|\leq n} \xi^{(n)}_{\alpha}p_{n,\alpha}(z)$ where $\{\xi^{(n)}_{\alpha}\}_{|\alpha|\leq n}$ are i.i.d. (complex) random variables and $\{p_{n,\alpha}\}_{|\alpha|\leq n}$ form…

Let $\{{\bf \mathcal{Z}}_n:n\geq 1\}$ be a sequence of i.i.d. random probability measures. Independently, for each $n\geq 1$, let $(X_{n1},\ldots, X_{nn})$ be a random vector of positive random variables that add up to one. This paper…

A distributed network is modeled by a graph having $n$ nodes (processors) and diameter $D$. We study the time complexity of approximating {\em weighted} (undirected) shortest paths on distributed networks with a $O(\log n)$ {\em bandwidth…

The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…

Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…

We consider the rate of piecewise constant approximation to a locally stationary process $X(t),t\in [0,1]$, having a variable smoothness index $\alpha(t)$. Assuming that $\alpha(\cdot)$ attains its unique minimum at zero and satisfies the…

We derive in this article the exact non-asymptotical exponential and power estimates for self-normalized sums of centered independent random variables (r.v.) under natural norming. We will use also the theory of the so-called Grand Lebesgue…

Subset sum is a very old and fundamental problem in theoretical computer science. In this problem, $n$ items with weights $w_1, w_2, w_3, \ldots, w_n$ are given as input and the goal is to find out if there is a subset of them whose weights…

Massive sizes of real-world graphs, such as social networks and web graph, impose serious challenges to process and perform analytics on them. These issues can be resolved by working on a small summary of the graph instead . A summary is a…

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

We studied linear weighted sampling algorithms and their optimality for approximate recovery of functions with mixed smoothness on $\mathbb{R}^d$ from a set of $n$ their sampled values. Functions to be recovered are in weighted Sobolev…

We study the central limit theorem in the non-normal domain of attraction to symmetric $\alpha$-stable laws for $0<\alpha\leq2$. We show that for i.i.d. random variables $X_i$, the convergence rate in $L^\infty$ of both the densities and…

We consider again the fast-slow motions setups in the continuous time $\frac {dX_N(t)}{dt}=N^{1/2} \sig(X_N(t))(\xi(tN))+b(X_N(t)),\, t\in [0,T]$ and the discrete time $X_N((n+1)/N)=X_N(n/N)+N^{-1/2}\sig(X_N(n/N))\xi(n)+N^{-1}b(X_N(n/N)),\,…

This work proposes and analyzes a compressed sensing approach to polynomial approximation of complex-valued functions in high dimensions. Of particular interest is the setting where the target function is smooth, characterized by a rapidly…

The statistics of the sum of random weights where the number of weights is Poisson distributed has important applications in nuclear physics, particle physics and astrophysics. Events are frequently weighted according to their acceptance or…

We design efficient approximation algorithms for maximizing the expectation of the supremum of families of Gaussian random variables. In particular, let $\mathrm{OPT}:=\max_{\sigma_1,\cdots,\sigma_n}\mathbb{E}\left[\sum_{j=1}^{m}\max_{i\in…

Let $(X,\mathcal{B},m,\tau)$ be a dynamical system with $\ds (X,\mathcal{B},m)$ a probability space and $\ds \tau$ an invertible, measure preserving transformation. The present paper deals with the almost everywhere convergence in…

Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated, in particular when X 1 is not…

We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…