Large Deviations for a matching problem related to the ∞ -Wasserstein distance

The existence of finite degree matching networks that can achieve the optimal reflection level in a desired frequency band when plugged on to the given load is discussed..

On the link between small ball probabilities and the quantization problem for Gaussian measures on Banach spaces.. Transportation cost-information inequalities for random

Convergence of an estimator of the Wasserstein distance between two continuous probability distributions.. Thierry Klein, Jean-Claude Fort,

the spectral theory of orthogonal polynomials on the unit circle (OPUC), which we briefly recall here. In the next section, we will use these parametrizations in order to recall

Object Matching Algorithms Using Robust Hausdorff Distance Measures IEEE Transactions on Image Processing 8 425–429. [19]

In all of these examples, the assumptions of Theorem 1.4 on the small ball function are satisfied, so that the convergence rate is also the proper one for empirical

i) We need two image charges, one for each one of the real charges producing the constant external electric field.. The first term is just the potential due to the external field

This note describes a one dimensional problem that is related to the study of the symmetry properties of minimisers for the best constant in the trace inequality in a ball..