Related papers: Approximation of Discrete Measures by Finite Point…
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…
The approximation of a discrete probability distribution $\mathbf{t}$ by an $M$-type distribution $\mathbf{p}$ is considered. The approximation error is measured by the informational divergence $\mathbb{D}(\mathbf{t}\Vert\mathbf{p})$, which…
Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of trigonometric polynomials with frequencies from an arbitrary finite set…
Let $\mu$ be a probability measure with an infinite compact support on $\mathbb{R}$. Let us further assume that $(F_n)_{n=1}^\infty$ is a sequence of orthogonal polynomials for $\mu$ where $(f_n)_{n=1}^\infty$ is a sequence of nonlinear…
It is natural to expect the following loosely stated approximation principle to hold: a numerical approximation solution should be in some sense as smooth as its target exact solution in order to have optimal convergence. For piecewise…
We study the set M(X) of full non-atomic Borel (finite or infinite) measures on a non-compact locally compact Cantor set X. For an infinite measure $\mu$ in M(X), the set $\mathfrak{M}_\mu = \{x \in X : {for any compact open set} U \ni x…
We show that the isotropic discrepancy of a lattice point set can be bounded from below and from above in terms of the spectral test of the corresponding integration lattice. From this we deduce that the isotropic discrepancy of any…
Suppose that we have $n$ agents and $n$ items which lie in a shared metric space. We would like to match the agents to items such that the total distance from agents to their matched items is as small as possible. However, instead of having…
Stern's diatomic sequence with its intrinsic repetition and refinement structure between consecutive powers of $2$ gives rise to a rather natural probability measure on the unit interval. We construct this measure and show that it is purely…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
We study the extreme and the periodic $L_p$ discrepancy of point sets in the $d$-dimensional unit cube. The extreme discrepancy uses arbitrary sub-intervals of the unit cube as test sets, whereas the periodic discrepancy is based on…
This paper investigates the soft covering lemma under both the relative entropy and the total variation distance as the measures of deviation. The exact order of the expected deviation of the random i.i.d. code for the soft covering problem…
The moment measure problem consists in finding a convex function $\psi$ whose moment measure, i.e., the pushforward by $\nabla \psi$ of the measure with density $e^{-\psi(\,\cdot\,)}$, is prescribed. It is highly non-linear and less…
We analyze the accuracy of the discrete least-squares approximation of a function $u$ in multivariate polynomial spaces $\mathbb{P}_\Lambda:={\rm span} \{y\mapsto y^\nu \,: \, \nu\in \Lambda\}$ with $\Lambda\subset \mathbb{N}_0^d$ over the…
We study the discrimination of N mixed quantum states in an optimal measurement that maximizes the probability of correct results while the probability of inconclusive results is fixed at a given value. After considering the discrimination…
We establish lower bounds on the complexity of finding $\epsilon$-stationary points of smooth, non-convex high-dimensional functions using first-order methods. We prove that deterministic first-order methods, even applied to arbitrarily…
Let $X$ be a locally compact Polish space. A random measure on $X$ is a probability measure on the space of all (nonnegative) Radon measures on $X$. Denote by $\mathbb K(X)$ the cone of all Radon measures $\eta$ on $X$ which are of the form…
It is known that there is a constant $c > 0$ such that for every sequence $x_1, x_2, \ldots$ in $[0,1)$ we have for the star discrepancy $D_N^*$ of the first $N$ elements of the sequence that $N D_N^* \ge c \cdot \log N$ holds for…
Numerical analysis for the stochastic Stokes equations is still challenging even though it has been well done for the corresponding deterministic equations. In particular, the pre-existing error estimates of finite element methods for the…
In this article we survey recent results on the explicit construction of finite point sets and infinite sequences with optimal order of $\mathcal{L}_q$ discrepancy. In 1954 Roth proved a lower bound for the $\mathcal{L}_2$ discrepancy of…