Related papers: Optimal quantization for the Cantor distribution g…

Finite precision approximations of discrete probability distributions are considered, applicable for distribution synthesis, e.g., probabilistic shaping. Two algorithms are presented that find the optimal $M$-type approximation $Q$ of a…

Consider a photon that has just emerged from a linear polarizing filter. If the photon is then subjected to an orthogonal polarization measurement-e.g., horizontal vs vertical-the photon's preparation cannot be fully expressed in the…

Let $K\subset R^n$ be a compact basic semi-algebraic set. We provide a necessary and sufficient condition (with no a priori bounding parameter) for a real sequence $y=(y_\alpha)$, $\alpha\in N^n$, to have a finite representing Borel measure…

This paper mainly addresses the optimization of $p$-th moment of $\mathbb{R}^n$-valued random variable. Through an ingenious approximation mechanism, one transforms the maximization problem into a sequence of minimization problems, which…

Let $\mu$ be an Ahlfors-David probability measure on $\mathbb{R}^q$, namely, there exist some constants $s_0>0$ and $\epsilon_0,C_1,C_2>0$ such that \[ C_1\epsilon^{s_0}\leq\mu(B(x,\epsilon))\leq…

We introduce and study the computational problem of determining statistical similarity between probability distributions. For distributions $P$ and $Q$ over a finite sample space, their statistical similarity is defined as…

In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…

Self-testing is a phenomenon where the use of specific quantum states or measurements can be inferred solely from the correlations they generate. We introduce a universal method for conducting robustness analysis in the self-testing of…

Measurements provide a novel mechanism for generating the entanglement resource necessary for performing scalable quantum computation. Recently, we proposed a method for performing parity measurements in a coupled quantum dot system. In…

Several researchers have proposed minimisation of maximum mean discrepancy (MMD) as a method to quantise probability measures, i.e., to approximate a target distribution by a representative point set. We consider sequential algorithms that…

Let $E$ be a Bedford-McMullen carpet determined by a set of affine mappings $(f_{ij})_{(i,j)\in G}$ and $\mu$ a self-affine measure on $E$ associated with a probability vector $(p_{ij})_{(i,j)\in G}$. We prove that, for every…

The study of Fourier transforms of probability measures on fractal sets plays an important role in recent research. Faster decay rates are known to yield enhanced results in areas such as metric number theory. This paper focuses on…

Quantum Clustering is a powerful method to detect clusters in data with mixed density. However, it is very sensitive to a length parameter that is inherent to the Schr\"odinger equation. In addition, linking data points into clusters…

Let $ r, s>0 $. For a given probability measure $P$ on $\mathbb{R}^d$, let $(\alpha_n)_{n \geq 1}$ be a sequence of (asymptotically) $L^r(P)$- optimal quantizers. For all $\mu \in \mathbb{R}^d $ and for every $\theta >0$, one defines the…

Let M be a compact Riemannian manifold and let $\mu$,d be the associated measure and distance on M. Robert McCann obtained, generalizing results for the Euclidean case by Yann Brenier, the polar factorization of Borel maps S : M -> M…

Approximating a convex function by a polyhedral function that has a limited number of facets is a fundamental problem with applications in various fields, from mitigating the curse of dimensionality in optimal control to bi-level…

Many causal and structural parameters in economics can be identified and estimated by computing the value of an optimization program over all distributions consistent with the model and the data. Existing tools apply when the data is…

In this paper, we focus on the packing measure of self-similar sets. Let $K$ be a self-similar set whose Hausdorff dimension and packing dimension equal $s$, we state that if $K$ satisfies the strong open set condition with an open set…

Given $m < n$, we consider the problem of ``best'' approximating an $n\text{-d}$ probability measure $\rho$ via an $m\text{-d}$ measure $\nu$ such that $\mathrm{supp}\ \nu$ has bounded total ``complexity.'' When $\rho$ is concentrated near…

Characterizations of surjective isometries with respect to the Kuiper distance on three classes of Borel probability measures of $\mathbb{R}$ (or equivalently, probability distribution functions) are presented here. These classes are the…