相关论文: Improvement of two Hungarian bivariate theorems

Let $Z_1,\ldots,Z_n$ be i.i.d. isotropic random vectors in $\mathbb{R}^p$, and $T \subset \mathbb{R}^p$ be a compact set. A classical line of empirical process theory characterizes the size of the suprema of the quadratic process…

The sample paths of Brownian motion are known to admit the exact Besov-type smoothness exponent 1/2 when measured in the sub-Gaussian Orlicz norm. We extend these regularity results by deriving the exact limit of the sub-Gaussian Orlicz…

We present a numerical method for rigorous over-approximation of a reachable set of differential inclusions. The method gives high-order error bounds for single step approximations and a uniform bound on the error over the finite time…

For a given normalized Gaussian symmetric matrix-valued process $Y^{(n)}$, we consider the process of its eigenvalues $\{(\lambda_{1}^{(n)}(t),\dots, \lambda_{n}^{(n)}(t)); t\ge 0\}$ as well as its corresponding process of empirical…

Expectation Propagation is a very popular algorithm for variational inference, but comes with few theoretical guarantees. In this article, we prove that the approximation errors made by EP can be bounded. Our bounds have an asymptotic…

In this paper we obtain non-uniform Berry-Esseen bounds for normal approximations by the Malliavin-Stein method. The techniques rely on a detailed analysis of the solutions of Stein's equations and will be applied to functionals of a…

The strong $L^2$-approximation of occupation time functionals is studied with respect to discrete observations of a $d$-dimensional c\`adl\`ag process. Upper bounds on the error are obtained under weak assumptions, generalizing previous…

A reinforcement algorithm introduced by H.A. Simon \cite{Simon} produces a sequence of uniform random variables with memory as follows. At each step, with a fixed probability $p\in(0,1)$, $\hat U_{n+1}$ is sampled uniformly from $\hat U_1,…

In the present article we study strong approximation of solutions of scalar stochastic differential equations (SDEs) with bounded and $\alpha$-H\"older continuous drift coefficient and constant diffusion coefficient at time point $1$.…

In this paper, we prove a universality result of convergence for a bivariate random process defined by the eigenvectors of a sample covariance matrix. Let $V_n=(v_{ij})_{i \leq n,\, j\leq m}$ be a $n\times m$ random matrix, where $(n/m)\to…

In this paper we estimate the rest of the approximation of a stationary process by a martingale in terms of the projections of partial sums. Then, based on this estimate, we obtain almost sure approximation of partial sums by a martingale…

A new formulation is derived for the commutator-errors in large-eddy simulation of incompressible flow. These commutator-errors arise from the application of non-uniform filters to the Navier-Stokes equations. As a consequence, the filtered…

This article presents a weak law of large numbers and a central limit theorem for the scaled realised covariation of a bivariate Brownian semistationary process. The novelty of our results lies in the fact that we derive the suitable…

In this paper we present the Edgeworth expansion for the Euler approximation scheme of a continuous diffusion process driven by a Brownian motion. Our methodology is based upon a recent work \cite{Yoshida2013}, which establishes Edgeworth…

In this paper, we develop a general approach to proving global and local uniform limit theorems for the Horvitz-Thompson empirical process arising from complex sampling designs. Global theorems such as Glivenko-Cantelli and Donsker…

Let $B$ be a bifractional Brownian motion with parameters $H\in (0, 1)$ and $K\in(0,1]$. For any $n\geq1$, set $Z_n =\sum_{i=0}^{n-1}\big[n^{2HK}(B_{(i+1)/n}-B_{i/n})^2-\E((B_{i+1}-B_{i})^2)\big]$. We use the Malliavin calculus and the…

We study the quantum summation (QS) algorithm of Brassard, Hoyer, Mosca and Tapp, that approximates the arithmetic mean of a Boolean function defined on N elements. We improve error bounds presented in [1] in the worst-probabilistic…

We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function $f$ is computable by a 1-query quantum algorithm with error bounded by $\epsilon<1/2$ iff $f$ can be…

Variational inference has become an increasingly attractive fast alternative to Markov chain Monte Carlo methods for approximate Bayesian inference. However, a major obstacle to the widespread use of variational methods is the lack of…

Two proofs of the Koml\'os-Major-Tusn\'ady embedding theorems, one for the uniform empirical process and one for the simple symmetric random walk, are given. More precisely, what are proved are the univariate coupling results needed in the…