SearcharxivSearch

arXiv · 1703.01027

Recent Developments on the Moment Problem

Abstract

We consider univariate distributions with finite moments of all positive orders. The moment problem is to determine whether or not a given distribution is uniquely determined by the sequence of its moments. There is a huge literature on this classical topic. In this survey, we will focus only on the recent developments on the checkable moment-(in)determinacy criteria including Cramer's condition, Carleman's condition, Hardy's condition, Krein's condition and the growth rate of moments, which help us solve the problem more easily. Both Hamburger and Stieltjes cases are investigated. The former is concerned with distributions on the whole real line, while the latter deals only with distributions on the right half-line. Some new results or new simple (direct) proofs of previous criteria are provided. Finally, we review the most recent moment problem for products of independent random variables with different distributions, which occur naturally in stochastic modelling of complex random phenomena.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gwo Dong Lin. 2017-07-08. Recent Developments on the Moment Problem. https://doi.org/10.1186/s40488-017-0059-2

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