Pith. sign in

REVIEW 2 cited by

On products of Gaussian random variables

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1711.10516 v2 pith:2D4XDTJF submitted 2017-11-28 math.PR

classification math.PR
keywords randomvariablesproductscomputeindependentsumstheorywell
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sums of independent random variables form the basis of many fundamental theorems in probability theory and statistics, and therefore, are well understood. The related problem of characterizing products of independent random variables seems to be much more challenging. In this work, we investigate such products of normal random variables, products of their absolute values, and products of their squares. We compute power-log series expansions of their cumulative distribution function (CDF) based on the theory of Fox H-functions. Numerically we show that for small arguments the CDFs are well approximated by the lowest orders of this expansion. For the two non-negative random variables, we also compute the moment generating functions in terms of Meijer G-functions, and consequently, obtain a Chernoff bound for sums of such random variables.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Compressed Bayesian Tensor Regression

    stat.ME 2025-10 reject novelty 6.0 of 10

    Compressed Bayesian tensor regression uses random projections to shrink tensor inputs before a low-rank Bayesian fit, reporting better out-of-sample forecasts at lower computational cost than uncompressed tensor regression.

  2. Scalably computing metric magnitude

    math.NA 2026-07 conditional novelty 5.0 of 10

    Hierarchical low-rank solvers beat dense and sparsified approaches for metric magnitude solves in experiments up to n=30,000, with a projected path to n≈10^5 via a containerized STRUMPACK/MPI pipeline.

Pith tools