SearcharxivSearch

arXiv · 2605.07920

Primitive Sequences for Probability Measures on Compact Intervals

Abstract

We introduce a sequence representation of a random variable $X$ supported on a compact interval $[a,b]$, which we call a primitive sequence. We construct this sequence by repeatedly antidifferentiating the associated cumulative distribution function of $X$ and evaluating the antiderivatives at the endpoint $b$. We show that the primitive sequence of $X$ can be identified as a factorially rescaled moment sequence of the reflected random variable $b-X$. Through this identification, we show that the primitive sequence transparently captures qualitative features of the distribution of $X$. We then connect primitive sequences directly to classical moment theory and exploit this connection to characterize admissible primitive sequences and to show that under natural topologies, the map from probability measures to primitive sequences is a homeomorphism. We end by examining the set of probability measures whose first $m$ primitive sequence terms are fixed, and thereby obtaining sharp upper and lower bounds on two functionals of those measures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert Zimmerman. 2026-05-08. Primitive Sequences for Probability Measures on Compact Intervals. https://arxiv.org/abs/2605.07920

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