SearcharxivSearch

arXiv · 1601.01763

Orthonormal polynomial expansions and lognormal sum densities

Abstract

Approximations for an unknown density $g$ in terms of a reference density $f_\nu$ and its associated orthonormal polynomials are discussed. The main application is the approximation of the density $f$ of a sum $S$ of lognormals which may have different variances or be dependent. In this setting, $g$ may be $f$ itself or a transformed density, in particular that of $\log S$ or an exponentially tilted density. Choices of reference densities $f_\nu$ that are considered include normal, gamma and lognormal densities. For the lognormal case, the orthonormal polynomials are found in closed form and it is shown that they are not dense in $L_2(f_\nu)$, a result that is closely related to the lognormal distribution not being determined by its moments and provides a warning to the most obvious choice of taking $f_\nu$ as lognormal. Numerical examples are presented and comparisons are made to established approaches such as the Fenton--Wilkinson method and skew-normal approximations. Also extensions to density estimation for statistical data sets and non-Gaussian copulas are outlined.

Explore related subjects

Keep this discovery

BibTeXRIS

Søren Asmussen, Pierre-Olivier Goffard, Patrick J. Laub. 2016-01-08. Orthonormal polynomial expansions and lognormal sum densities. https://arxiv.org/abs/1601.01763

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