SearcharxivSearch

arXiv · math/0510240

Distributional transformations, orthogonal polynomials, and Stein characterizations

Abstract

A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's higher order derivatives. The class includes the size and zero bias transformations, and when specializing to weighting by polynomial functions, relates distributional families closed under independent addition, and in particular the infinitely divisible distributions, to the family of transformations induced by their associated orthogonal polynomial systems. For these families, generalizing a well known property of size biasing, sums of independent variables are transformed by replacing summands chosen according to a multivariate distribution on its index set by independent variables whose distributions are transformed by members of that same family. A variety of the transformations associated with the classical orthogonal polynomial systems have as fixed points the original distribution, or a member of the same family with different parameter.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Larry Goldstein, Gesine Reinert. 2005-10-12. Distributional transformations, orthogonal polynomials, and Stein characterizations. https://arxiv.org/abs/math/0510240

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