SearcharxivSearch

arXiv · 2209.14483

Grid entropy in a "choose the best of D samples" model

Abstract

Grid entropy is a deterministic quantity inherent to lattice models which captures the entropy of empirical measures along paths that converge weakly to a given target measure. In this paper, we study the limiting behaviour of empirical measures in a model consisting of repeatedly taking $D$ samples from a distribution and picking out one according to an omniscient "strategy." We show that the set of limit points of empirical measures is almost surely the same whether or not we restrict ourselves to strategies which make the choices independently of all past and future choices, and furthermore, that this set coincides with the set of measures with finite grid entropy. This set is convex and weakly compact; we characterize its extreme points as those given by a natural "greedy" deterministic strategy and we compute the grid entropy of said extreme points to be 0. This yields a description of the set of limit points of empirical measures as the closed convex hull of measures given by a density which is $D \cdot Beta(1,D)$ distributed. We also derive a simplified version of a grid entropy-based variational formula for Gibbs Free Energy for this model, and we present the dual formula for grid entropy.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexandru Gatea. 2022-09-29. Grid entropy in a "choose the best of D samples" model. https://arxiv.org/abs/2209.14483

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