English
Related papers

Related papers: Quantization for uniform distributions on stretche…

200 papers

The question of optimally approximating an arbitrary probability measure in the Wasserstein distance by a discrete one with uniform weights is considered. Estimates are obtained for the optimal approximation distance, with an explicit rate…

Probability · Mathematics 2026-04-14 Benjamin Seeger

The quantization scheme in probability theory deals with finding a best approximation of a given probability distribution by a probability distribution that is supported on finitely many points. In this paper, first we state and prove a…

Probability · Mathematics 2023-05-05 Juan Gomez , Haily Martinez , Mrinal K. Roychowdhury , Alexis Salazar , Daniel J. Vallez

We consider the problem of estimating the total probability of all symbols that appear with a given frequency in a string of i.i.d. random variables with unknown distribution. We focus on the regime in which the block length is large yet no…

Information Theory · Computer Science 2016-11-15 Aaron B. Wagner , Pramod Viswanath , Sanjeev R. Kulkarni

We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\em unknown} discrete domain $\mathbf{\Omega}$, we want to distinguish,…

Data Structures and Algorithms · Computer Science 2017-09-08 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

In this work, we revisit the problem of uniformity testing of discrete probability distributions. A fundamental problem in distribution testing, testing uniformity over a known domain has been addressed over a significant line of works, and…

Data Structures and Algorithms · Computer Science 2017-08-17 Tuğkan Batu , Clément L. Canonne

We consider the problem of estimating the probability of an observed string drawn i.i.d. from an unknown distribution. The key feature of our study is that the length of the observed string is assumed to be of the same order as the size of…

Information Theory · Computer Science 2007-07-13 Aaron B. Wagner , Pramod Viswanath , Sanjeev R. Kulkarni

Zador's celebrated theorem is a cornerstone of optimal quantisation, establishing both the weak limit of the empirical distribution of an $n$-point optimal quantiser in $R^d$ and the decay rate of the associated $L_s$-mean quantisation…

Statistics Theory · Mathematics 2026-05-14 Luc Pronzato , Anatoly Zhigljavsky

The geometry of unit $N$-dimensional $\ell_{p}$ balls has been intensively investigated in the past decades. A particular topic of interest has been the study of the asymptotics of their projections. Apart from their intrinsic interest,…

Probability · Mathematics 2010-10-22 Franck Barthe , Fabrice Gamboa , Li-Vang Lozada-Chang , Alain Rouault

In this paper we study the quantization problem for probability measures on Riemannian manifolds. Under a suitable assumption on the growth at infinity of the measure we find asymptotic estimates for the quantization error, generalizing the…

Analysis of PDEs · Mathematics 2014-12-15 Mikaela Iacobelli

In this paper, we analyze the set of all possible aggregate distributions of the sum of standard uniform random variables, a simply stated yet challenging problem in the literature of distributions with given margins. Our main results are…

Probability · Mathematics 2019-10-02 Tiantian Mao , Bin Wang , Ruodu Wang

Quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with support containing a finite number of elements. If in the quantization some of the elements in the support are…

Probability · Mathematics 2025-03-24 Pigar Biteng , Mathieu Caguiat , Tsianna Dominguez , Mrinal Kanti Roychowdhury

We study the convergence rate of the optimal quantization for a probability measure sequence $(\mu_{n})_{n\in\mathbb{N}^{*}}$ on $\mathbb{R}^{d}$ converging in the Wasserstein distance in two aspects: the first one is the convergence rate…

Statistics Theory · Mathematics 2020-02-20 Yating Liu , Gilles Pagès

We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit…

Information Theory · Computer Science 2010-08-24 Yuriy A. Reznik

By a classical theorem of Koksma the sequence of fractional parts $(\{x^n\})_{n \geq 1}$ is uniformly distributed for almost all values of $x$. In the present paper we obtain an exact quantitative version of Koksma's theorem, by calculating…

Number Theory · Mathematics 2013-08-16 Christoph Aistleitner

We establish several new probabilistic, dynamical, dimensional and number theoretical phenomena connected with Ostrogradsky-Sierpi\'nski-Pierce expansion. First of all, we develop metric, ergodic and dimensional theories of the…

Probability · Mathematics 2015-06-16 Sergio Albeverio , Gregory Torbin

The distribution function of a random distance in three dimensions is given and some new three-dimensional d2-tests of randomness are suggested. We show that our test statistics are not correlated with the usual test statistics and are…

Applications · Statistics 2014-02-24 Sergii Koliada

In this paper we propose a method to construct probability measures on the space of convex bodies with a given pushforward distribution. Concretely we show that there is a measure on the metric space of centrally symmetric convex bodies,…

Probability · Mathematics 2012-04-27 Á. G. Horváth

We propose a new probabilistic characterization of the uniform distribution on the hypersphere in terms of the distribution of pairwise inner products, extending the ideas of \citep{cuesta2009projection,cuesta2007sharp} in a data-driven…

Statistics Theory · Mathematics 2026-04-14 Tiefeng Jiang , Tuan Pham

Sequential probability assignment and universal compression go hand in hand. We propose sequential probability assignment for non-binary (and large alphabet) sequences with empirical distributions whose parameters are known to be bounded…

Information Theory · Computer Science 2021-02-09 Michael Drmota , Gil Shamir , Wojciech Szpankowski

We study distributional similarity measures for the purpose of improving probability estimation for unseen cooccurrences. Our contributions are three-fold: an empirical comparison of a broad range of measures; a classification of similarity…

Computation and Language · Computer Science 2007-05-23 Lillian Lee