Jump to content

Connect SuperML | Leeroopedia MCP: Equip your AI agents with best practices, code verification, and debugging knowledge. Powered by Leeroo — building Organizational Superintelligence. Contact us at founders@leeroo.com.

Principle:Avhz RustQuant Probability Distributions

From Leeroopedia


Knowledge Sources
Domains Statistics, Probability_Theory
Last Updated 2026-02-07 21:00 GMT

Overview

Probability distribution theory providing PDF, CDF, moment generation, and sampling for common continuous and discrete distributions.

Description

Probability Distributions in RustQuant are built around a core Distribution trait that defines a uniform interface for all supported distributions. Every distribution must implement the following methods:

  • cf -- Characteristic function: φ(t)=E[eitX], returning a Complex<f64>.
  • pdf -- Probability density function (for continuous distributions).
  • pmf -- Probability mass function (for discrete distributions).
  • cdf -- Cumulative distribution function.
  • inv_cdf -- Inverse CDF (quantile function).
  • mean, median, mode -- Central tendency measures.
  • variance, skewness, kurtosis -- Spread and shape measures.
  • entropy -- Shannon entropy of the distribution.
  • mgf -- Moment generating function: M(t)=E[etX].
  • sample -- Random variate generation, returning Result<Vec<f64>, RustQuantError>.

The library also defines a DistributionClass enum distinguishing between Discrete and Continuous distributions, and provides a standard-normal convenience constant N for use in option pricing.

The following distributions are implemented:

  • Gaussian (Normal): XN(μ,σ2)
  • Bernoulli: XBern(p)
  • Binomial: XB(n,p)
  • Poisson: XPois(λ)
  • Uniform: XU(a,b)
  • Exponential: XExp(λ)
  • Gamma: XΓ(α,β)
  • Chi-Squared: Xχ2(k)

Usage

Use the Probability Distributions principle when computing option prices (via the standard normal CDF), generating Monte Carlo simulations (via the sample method), performing statistical analysis, or modeling stochastic financial processes. The trait-based design allows generic algorithms to operate over any distribution type.

Theoretical Basis

For the Gaussian distribution, the PDF is:

f(x)=12πσ2exp((xμ)22σ2)

The CDF is computed using the complementary error function to avoid subtractive cancellation in the tails:

Φ(x)=12erfc(xμ2σ)

The characteristic function is:

φ(t)=exp(iμtσ2t22)

The moment generating function is:

M(t)=exp(μt+σ2t22)

Random sampling uses the rand_distr crate for efficient variate generation.

Related Pages

Implemented By

Page Connections

Double-click a node to navigate. Hold to expand connections.
Principle
Implementation
Heuristic
Environment