Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDistributions of polynomials in Gaussian random variables under structural constraints
338
0
0.0
(
0
)
Authors
Egor Kosov
Ask ChatGPT about the research
No Arabic abstract
We study the regularity of densities of distributions that are polynomial images of the standard Gaussian measure on $mathbb{R}^n$. We assume that the degree of a polynomial is fixed and that each variable enters to a power bounded by another fixed number.
rate research
Read More
We study fractional smoothness of measures on $mathbb{R}^k$, that are images of a Gaussian measure under mappings from Gaussian Sobolev classes. As a consequence we obtain Nikolskii--Besov fractional regularity of these distributions under some weak nondegeneracy assumption.
We study distributions of random vectors whose components are second order polynomials in Gaussian random variables. Assuming that the law of such a vector is not absolutely continuous with respect to Lebesgue measure, we derive some interesting consequences. Our second result gives a characterization of limits in law for sequences of such vectors.
We introduce a new functional representation of probability density functions (PDFs) of non-negative random variables via a product of a monomial factor and linear combinations of decaying exponentials with complex exponents. This approximate representation of PDFs is obtained for any finite, user-selected accuracy. Using a fast algorithm involving Hankel matrices, we develop a general numerical method for computing the PDF of the sums, products, or quotients of any number of non-negative random variables yielding the result in the same type of functional representation. We present several examples to demonstrate the accuracy of the approach.
In this paper we study bounds for the total variation distance between two second degree polynomials in normal random variables provided that they essentially depend on at least three variables.
We introduce a new approximate multiresolution analysis (MRA) using a single Gaussian as the scaling function, which we call Gaussian MRA (GMRA). As an initial application, we employ this new tool to accurately and efficiently compute the probability density function (PDF) of the product of independent random variables. In contrast with Monte-Carlo (MC) type methods (the only other universal approach known to address this problem), our method not only achieves accuracies beyond the reach of MC but also produces a PDF expressed as a Gaussian mixture, thus allowing for further efficient computations. We also show that an exact MRA corresponding to our GMRA can be constructed for a matching user-selected accuracy.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
