SearcharxivSearch

arXiv · 1309.3057

Tail behavior of sums and differences of log-normal random variables

Abstract

We present sharp tail asymptotics for the density and the distribution function of linear combinations of correlated log-normal random variables, that is, exponentials of components of a correlated Gaussian vector. The asymptotic behavior turns out to depend on the correlation between the components, and the explicit solution is found by solving a tractable quadratic optimization problem. These results can be used either to approximate the probability of tail events directly, or to construct variance reduction procedures to estimate these probabilities by Monte Carlo methods. In particular, we propose an efficient importance sampling estimator for the left tail of the distribution function of the sum of log-normal variables. As a corollary of the tail asymptotics, we compute the asymptotics of the conditional law of a Gaussian random vector given a linear combination of exponentials of its components. In risk management applications, this finding can be used for the systematic construction of stress tests, which the financial institutions are required to conduct by the regulators. We also characterize the asymptotic behavior of the Value at Risk for log-normal portfolios in the case where the confidence level tends to one.

Explore related subjects

Keep this discovery

BibTeXRIS

Archil Gulisashvili, Peter Tankov. 2016-01-06. Tail behavior of sums and differences of log-normal random variables. https://doi.org/10.3150/14-bej665

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