相关论文: Improvement of two Hungarian bivariate theorems

Error correcting codes with a universal set of transversal gates are a desideratum for quantum computing. Such codes, however, are ruled out by the Eastin-Knill theorem. Moreover, the theorem also rules out codes which are covariant with…

We are concerned with the numerical integration of functions from the Sobolev space $H^{r,\text{mix}}([0,1]^d)$ of dominating mixed smoothness $r\in\mathbb{N}$ over the $d$-dimensional unit cube. In 1976, K. K. Frolov introduced a…

This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…

Hardy and Littlewood's approximate functional equation for quadratic Weyl sums (theta sums) provides, by iterative application, a powerful tool for the asymptotic analysis of such sums. The classical Jacobi theta function, on the other…

We consider sequences of random variables of the type $S_n= n^{-1/2} \sum_{k=1}^n \{f(X_k)-\E[f(X_k)]\}$, $n\geq 1$, where $X=(X_k)_{k\in \Z}$ is a $d$-dimensional Gaussian process and $f: \R^d \rightarrow \R$ is a measurable function. It…

We provide a new information-theoretic generalization error bound that is exactly tight (i.e., matching even the constant) for the canonical quadratic Gaussian (location) problem. Most existing bounds are order-wise loose in this setting,…

The estimation of the extremal dependence structure is spoiled by the impact of the bias, which increases with the number of observations used for the estimation. Already known in the univariate setting, the bias correction procedure is…

The Alekseev-Gr{\"o}bner lemma is combined with the theory of modified equations to obtain an \emph{a priori} estimate for the global error of numerical integrators. This estimate is correct up to a remainder term of order $h^{2p}$, where…

Four types of global error for initial value problems are considered in a common framework. They include classical forward error analysis and shadowing error analysis together with extensions of both to rescaling of time. To determine the…

Let $U$ be a Haar distributed matrix in $\mathbb U(n)$ or $\mathbb O (n)$. In a previous paper, we proved that after centering, the two-parameter process \[T^{(n)} (s,t) = \sum_{i \leq \lfloor ns \rfloor, j \leq \lfloor nt\rfloor}…

We derive a residual based a-posteriori error estimate for the outer normal flux of approximations to {the diffusion problem with variable coefficient}. By analyzing the solution of the adjoint problem, we show that error indicators in the…

The present manuscript is concerned with component-wise estimation of the positive power of ordered restricted standard deviation of two normal populations with certain restrictions on the means. We propose several improved estimators under…

Bayesian coresets speed up posterior inference in the large-scale data regime by approximating the full-data log-likelihood function with a surrogate log-likelihood based on a small, weighted subset of the data. But while Bayesian coresets…

We consider Riemann sum approximations of stochastic integrals with respect to the fractional Browian motion of index $H\geq \frac12$. We show the convergence of these schemes at first and second order. The processes obtained in the limit…

In this paper I discuss how to consistently incorporate higher-order corrections to the bubble-nucleation rate at finite temperature. Doing so I examine the merits of different approaches, with the goal of reducing uncertainties for…

We use Toponogov's triangle comparison theorem from Riemannian geometry along with quantitative scale oriented variants of classical propagation of singularities arguments to obtain logarithmic improvements of the Kakeya-Nikodym norms…

In computational inverse problems, it is common that a detailed and accurate forward model is approximated by a computationally less challenging substitute. The model reduction may be necessary to meet constraints in computing time when…

We consider a Markov chain approximation scheme for utility maximization problems in continuous time, which uses, in turn, a piecewise constant policy approximation, Euler-Maruyama time stepping, and a Gauss-Hermite approximation of the…

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two…

We consider the problem of inference for projection parameters in linear regression with increasing dimensions. This problem has been studied under a variety of assumptions in the literature. The classical asymptotic normality result for…