SearcharxivSearch

arXiv · 2008.03255

Optimal quantization for nonuniform discrete distributions

Abstract

This paper explores the process of optimal quantization for several types of discrete probability distributions. Quantization is a technique used to approximate a complex distribution with a smaller set of representative points, which is important in fields such as data compression and signal processing. We begin by examining two specific nonuniform distributions over a finite set of values and identify the best representative points for different levels of approximation. We then extend our analysis to two infinite discrete distributions: one supported on the reciprocals of natural numbers and another on the natural numbers themselves. For these distributions, we compute the optimal sets of representatives and assess how well they approximate the original distributions. Finally, we address the reverse problem-determining the underlying distribution when the optimal sets are known. Our results provide both theoretical insights and computational techniques useful in information theory and data analysis.

Explore related subjects

Keep this discovery

BibTeXRIS

Russel Cabasag, Samir Huq, Eric Mendoza, Mrinal Kanti Roychowdhury. 2020-08-07. Optimal quantization for nonuniform discrete distributions. https://arxiv.org/abs/2008.03255

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR