Related papers: Upper bounds on Rubinstein distances on configurat…
We derive upper and lower bounds on the gradients of Wachspress coordinates defined over any simple convex d-dimensional polytope P. The bounds are in terms of a single geometric quantity h_*, which denotes the minimum distance between a…
We give a complete description of the Poisson boundary of wreath products $A\wr B= \bigoplus_{B} A\rtimes B$ of countable groups $A$ and $B$, for probability measures $\mu$ with finite entropy where lamp configurations stabilize almost…
We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…
In the paper we prove two inequalities in the setting of ${\sf RCD}(K,\infty)$ spaces using similar techniques. The first one is an indeterminacy estimate involving the $p$-Wasserstein distance between the positive part and the negative…
We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…
We consider the problem of simultaneously inferring the heterogeneous coefficient field for a Robin boundary condition on an inaccessible part of the boundary along with the shape of the boundary for the Poisson problem. Such a problem…
We review the methods of constructing confidence intervals that account for a priori information about one-sided constraints on the parameter being estimated. We show that the so-called method of sensitivity limit yields a correct solution…
We analyse the maximum achievable rate of sustained computation for a given convex region of three dimensional space subject to geometric constraints on power delivery and heat dissipation. We find a universal upper bound across both…
In this article, we establish a $L^1$ estimate for solutions to Poisson equation with mixed boundary condition, on complete noncompact manifolds with nonnegative Ricci curvature and compact manifolds with positive Ricci curvature…
A basic problem in operator theory is to estimate how a small perturbation effects the eigenspaces of a self-adjoint compact operator. In this paper, we prove upper bounds for the subspace distance, taylored for structured random…
Mixture distributions arise in many parametric and non-parametric settings -- for example, in Gaussian mixture models and in non-parametric estimation. It is often necessary to compute the entropy of a mixture, but, in most cases, this…
The work of Sprungk (Inverse Problems, 2020) established the local Lipschitz continuity of the misfit-to-posterior and prior-to-posterior maps with respect to the Kullback--Leibler divergence and the total variation, Hellinger, and…
We will prove a global estimate for the gradient of the solution to the {\it Poisson differential inequality} $|\Delta u(x)|\le a|\nabla u(x)|^2+b$, $x\in B^{n}$, where $a,b<\infty$ and $u|_{S^{n-1}}\in C^{1,\alpha}(S^{n-1}, \Bbb R^m)$. If…
The aim of the present note is to show that the method of our paper ArXiv:2408.11400 with minor extra efforts can be extended to obtain upper bounds for the Bures distance between quantum Gaussian states. We argue that these bounds are…
We consider the reconstruction of a heterogeneous coefficient field in a Robin boundary condition on an inaccessible part of the boundary in a Poisson problem with an uncertain (or unknown) inhomogeneous conductivity field in the interior…
We prove the chain rule in the more general framework of the Wiener-Poisson space, allowing us to obtain the so-called Nourdin-Peccati bound. From this bound we obtain a second-order Poincare-type inequality that is useful in terms of…
We consider the normal approximation of Kabanov-Skorohod integrals on a general Poisson space. Our bounds are for the Wasserstein and the Kolmogorov distance and involve only difference operators of the integrand of the Kabanov-Skorohod…
We present some upper bounds on the size of non-linear codes and their restriction to systematic codes and linear codes. These bounds are independent of other known theoretical bounds, e.g. the Griesmer bound, the Johnson bound or the…
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
We consider random i.i.d. samples of absolutely continuous measures on bounded connected domains. We prove an upper bound on the $\infty$-transportation distance between the measure and the empirical measure of the sample. The bound is…