SearcharxivSearch

arXiv · 1208.2691

On the Efficient Calculation of a Linear Combination of Chi-Square Random Variables with an Application in Counting String Vacua

Abstract

Linear combinations of chi square random variables occur in a wide range of fields. Unfortunately, a closed, analytic expression for the pdf is not yet known. As a first result of this work, an explicit analytic expression for the density of the sum of two gamma random variables is derived. Then a computationally efficient algorithm to numerically calculate the linear combination of chi square random variables is developed. An explicit expression for the error bound is obtained. The proposed technique is shown to be computationally efficient, i.e. only polynomial in growth in the number of terms compared to the exponential growth of most other methods. It provides a vast improvement in accuracy and shows only logarithmic growth in the required precision. In addition, it is applicable to a much greater number of terms and currently the only way of computing the distribution for hundreds of terms. As an application, the exponential dependence of the eigenvalue fluctuation probability of a random matrix model for 4d supergravity with N scalar fields is found to be of the asymptotic form exp(-0.35N).

Explore related subjects

Keep this discovery

BibTeXRIS

Johannes Bausch. 2012-08-13. On the Efficient Calculation of a Linear Combination of Chi-Square Random Variables with an Application in Counting String Vacua. https://doi.org/10.1088/1751-8113/46/50/505202

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