# Generalized chi-squared distribution

In probability theory and statistics, the specific name generalized chi-squared distribution (also generalized chi-square distribution) arises in relation to one particular family of variants of the chi-squared distribution. There are several other such variants for which the same term is sometimes used, or which clearly are generalizations of the chi-squared distribution, and which are treated elsewhere: some are special cases of the family discussed here, for example the noncentral chi-squared distribution and the gamma distribution, while the generalized gamma distribution is outside this family. The type of generalisation of the chi-squared distribution that is discussed here is of importance because it arises in the context of the distribution of statistical estimates in cases where the usual statistical theory does not hold. For example, if a predictive model is fitted by least squares but the model errors have either autocorrelation or heteroscedasticity, then a statistical analysis of alternative model structures can be undertaken by relating changes in the sum of squares to an asymptotically valid generalized chi-squared distribution.[1] More specifically, the distribution can be defined in terms of a quadratic form derived from a multivariate normal distribution.

## Definition

One formulation of the generalized chi-squared distribution is as follows.[1] Let z have a multivariate normal distribution with zero mean and covariance matrix B, then the value of the quadratic form X = zTAz, where A is a matrix, has a generalised chi-squared distribution with parameters A and B. Note that there is some redundancy in this formulation, as for any matrix C, the distribution with parameters CTAC and B is identical to the distribution with parameters A and CBCT. The most general form of generalized chi-squared distribution is obtained by extending the above consideration in two ways: firstly, to allow z to have a non-zero mean and, secondly, to include an additional linear combination of z in the definition of X.

Note that, in the above formulation, A and B need not be positive definite. However, the case where A is restricted to be at least positive semidefinite is an important one.

For the most general case, a reduction towards a common standard form can be made by using a representation of the following form:[2]

${\displaystyle X=(z+a)^{\mathrm {T} }A(z+a)+c^{\mathrm {T} }z=(x+b)^{\mathrm {T} }D(x+b)+d^{\mathrm {T} }x+e,}$

where D is a diagonal matrix and where x represents a vector of uncorrelated standard normal random variables. An alternative representation can be stated in the form:[3][4]

${\displaystyle X=\sum _{i=1}^{r}\lambda _{i}Y_{i}+fZ_{0},}$

where the Yi represent random variables having (different) noncentral chi-squared distributions, where Z0 has a standard normal distribution, and where all these random variables are independent. Some important special cases relating to this particular form either omit the additional standard normal term and/or have central rather than non-central chi-squared distributions for the components of the summation.

## Practical implementation

Computer code for evaluating the cumulative distribution function of the generalized chi-squared distribution has been published,[2][4] but some preliminary manipulation of the parameters of the distribution is usually necessary.

## Other applications

The following application arises in the context of Fourier analysis in signal processing, renewal theory in probability theory, and multi-antenna systems in wireless communication. The common factor of these areas is that the sum of exponentially distributed variables is of importance (or identically, the sum of squared magnitudes circular symmetric complex Gaussian variables).

If ${\displaystyle Z_{i}}$ are k independent, circular symmetric complex Gaussian random variables with mean 0 and variance ${\displaystyle \sigma _{i}^{2}}$, then the random variable

${\displaystyle {\tilde {Q}}=\sum _{i=1}^{k}|Z_{i}|^{2}}$

has a generalized chi-squared distribution of a particular form. The difference from the standard chi-squared distribution is that ${\displaystyle Z_{i}}$ are complex and can have different variances, and the difference from the more general generalized chi-squared distribution is that the relevant scaling matrix A is diagonal. If ${\displaystyle \mu =\sigma _{i}^{2}}$ for all i, then ${\displaystyle {\tilde {Q}}}$, scaled down by ${\displaystyle \mu /2}$ (i.e. multiplied by ${\displaystyle 2/\mu }$), has a chi-squared distribution, ${\displaystyle \chi ^{2}(2k)}$, also known as an Erlang distribution. If ${\displaystyle \sigma _{i}^{2}}$ have distinct values for all i, then ${\displaystyle {\tilde {Q}}}$ has the pdf[5]

${\displaystyle f(x;k,\sigma _{1}^{2},\ldots ,\sigma _{k}^{2})=\sum _{i=1}^{k}{\frac {e^{-{\frac {x}{\sigma _{i}^{2}}}}}{\sigma _{i}^{2}\prod _{j=1,j\neq i}^{k}\left(1-{\frac {\sigma _{j}^{2}}{\sigma _{i}^{2}}}\right)}}\quad {\text{for }}x\geq 0.}$

If there are sets of repeated variances among ${\displaystyle \sigma _{i}^{2}}$, assume that they are divided into M sets, each representing a certain variance value. Denote ${\displaystyle \mathbf {r} =(r_{1},r_{2},\dots ,r_{M})}$ to be the number of repetitions in each group. That is, the mth set contains ${\displaystyle r_{m}}$ variables that have variance ${\displaystyle \sigma _{m}^{2}.}$ It represents an arbitrary linear combination of independent ${\displaystyle \chi ^{2}}$-distributed random variables with different degrees of freedom:

${\displaystyle {\tilde {Q}}=\sum _{m=1}^{M}\sigma _{m}^{2}Q_{m},\quad Q_{m}\sim \chi ^{2}(2r_{m})\,.}$

The pdf of ${\displaystyle {\tilde {Q}}}$ is[6]

${\displaystyle f(x;\mathbf {r} ,\sigma _{1}^{2},\dots \sigma _{M}^{2})=\prod _{m=1}^{M}{\frac {1}{\sigma _{m}^{2r_{m}}}}\sum _{k=1}^{M}\sum _{l=1}^{r_{k}}{\frac {\Psi _{k,l,\mathbf {r} }}{(r_{k}-l)!}}(-x)^{r_{k}-l}e^{-{\frac {x}{\sigma _{k}^{2}}}},\quad {\text{ for }}x\geq 0,}$

where

${\displaystyle \Psi _{k,l,\mathbf {r} }=(-1)^{r_{k}-1}\sum _{\mathbf {i} \in \Omega _{k,l}}\prod _{j\neq k}{\binom {i_{j}+r_{j}-1}{i_{j}}}\left({\frac {1}{\sigma _{j}^{2}}}\!-\!{\frac {1}{\sigma _{k}^{2}}}\right)^{-(r_{j}+i_{j})},}$

with ${\displaystyle \mathbf {i} =[i_{1},\ldots ,i_{M}]^{T}}$ from the set ${\displaystyle \Omega _{k,l}}$ of all partitions of ${\displaystyle l-1}$ (with ${\displaystyle i_{k}=0}$) defined as

${\displaystyle \Omega _{k,l}=\left\{[i_{1},\ldots ,i_{m}]\in \mathbb {Z} ^{m};\sum _{j=1}^{M}i_{j}\!=l-1,i_{k}=0,i_{j}\geq 0{\text{ for all }}j\right\}.}$