Conway–Maxwell–Poisson distribution

Conway–Maxwell–Poisson

Probability mass function
Cumulative distribution function
Parameters	${\displaystyle \lambda >0,\nu \geq 0}$
Support	${\displaystyle x\in \{0,1,2,\dots \}}$
PMF	${\displaystyle {\frac {\lambda ^{x}}{(x!)^{\nu }}}{\frac {1}{Z(\lambda ,\nu )}}}$
CDF	${\displaystyle \sum _{i=0}^{x}\Pr(X=i)}$
Mean	${\displaystyle \sum _{j=0}^{\infty }{\frac {j\lambda ^{j}}{(j!)^{\nu }Z(\lambda ,\nu )}}}$
Median	No closed form
Mode	See text
Variance	${\displaystyle \sum _{j=0}^{\infty }{\frac {j^{2}\lambda ^{j}}{(j!)^{\nu }Z(\lambda ,\nu )}}-\operatorname {mean} ^{2}}$
Skewness	Not listed
Excess kurtosis	Not listed
Entropy	Not listed
MGF	${\displaystyle {\frac {Z(e^{t}\lambda ,\nu )}{Z(\lambda ,\nu )}}}$
CF	${\displaystyle {\frac {Z(e^{it}\lambda ,\nu )}{Z(\lambda ,\nu )}}}$
PGF	${\displaystyle {\frac {Z(t\lambda ,\nu )}{Z(\lambda ,\nu )}}}$

In probability theory and statistics, the Conway–Maxwell–Poisson (CMP or COM–Poisson) distribution is a discrete probability distribution named after Richard W. Conway, William L. Maxwell, and Siméon Denis Poisson that generalizes the Poisson distribution by adding a parameter to model overdispersion and underdispersion. It is a member of the exponential family,^[1] has the Poisson distribution and geometric distribution as special cases and the Bernoulli distribution as a limiting case.^[2]

The CMP distribution was originally proposed by Conway and Maxwell in 1962^[3] as a solution to handling queueing systems with state-dependent service rates. The CMP distribution was introduced into the statistics literature by Boatwright et al. 2003 ^[4] and Shmueli et al. (2005).^[2] The first detailed investigation into the probabilistic and statistical properties of the distribution was published by Shmueli et al. (2005).^[2] Some theoretical probability results of COM-Poisson distribution is studied and reviewed by Li et al. (2019),^[5] especially the characterizations of COM-Poisson distribution.

The CMP distribution is defined to be the distribution with probability mass function

${\displaystyle P(X=x)=f(x;\lambda ,\nu )={\frac {\lambda ^{x}}{(x!)^{\nu }}}{\frac {1}{Z(\lambda ,\nu )}}.}$

where :

${\displaystyle Z(\lambda ,\nu )=\sum _{j=0}^{\infty }{\frac {\lambda ^{j}}{(j!)^{\nu }}}.}$

The function ${\displaystyle Z(\lambda ,\nu )}$ serves as a normalization constant so the probability mass function sums to one. Note that ${\displaystyle Z(\lambda ,\nu )}$ does not have a closed form.

The domain of admissible parameters is ${\displaystyle \lambda ,\nu >0}$, and ${\displaystyle 0<\lambda <1}$, ${\displaystyle \nu =0}$.

The additional parameter ${\displaystyle \nu }$ which does not appear in the Poisson distribution allows for adjustment of the rate of decay. This rate of decay is a non-linear decrease in ratios of successive probabilities, specifically

${\displaystyle {\frac {P(X=x-1)}{P(X=x)}}={\frac {x^{\nu }}{\lambda }}.}$

When ${\displaystyle \nu =1}$, the CMP distribution becomes the standard Poisson distribution and as ${\displaystyle \nu \to \infty }$, the distribution approaches a Bernoulli distribution with parameter ${\displaystyle \lambda /(1+\lambda )}$. When ${\displaystyle \nu =0}$ the CMP distribution reduces to a geometric distribution with probability of success ${\displaystyle 1-\lambda }$ provided ${\displaystyle \lambda <1}$.^[2]

For the CMP distribution, moments can be found through the recursive formula ^[2]

${\displaystyle \operatorname {E} [X^{r+1}]={\begin{cases}\lambda \,\operatorname {E} [X+1]^{1-\nu }&{\text{if }}r=0\\\lambda \,{\frac {d}{d\lambda }}\operatorname {E} [X^{r}]+\operatorname {E} [X]\operatorname {E} [X^{r}]&{\text{if }}r>0.\\\end{cases}}}$

For general ${\displaystyle \nu }$, there does not exist a closed form formula for the cumulative distribution function of ${\displaystyle X\sim \mathrm {CMP} (\lambda ,\nu )}$. If ${\displaystyle \nu \geq 1}$ is an integer, we can, however, obtain the following formula in terms of the generalized hypergeometric function:^[6]

${\displaystyle F(n)=P(X\leq n)=1-{\frac {_{1}F_{\nu -1}(;n+2,\ldots ,n+2;\lambda )}{{\{(n+1)!\}^{\nu -1}}_{0}F_{\nu -1}(;1,\ldots ,1;\lambda )}}.}$

Many important summary statistics, such as moments and cumulants, of the CMP distribution can be expressed in terms of the normalizing constant ${\displaystyle Z(\lambda ,\nu )}$.^[2][7] Indeed, The probability generating function is ${\displaystyle \operatorname {E} s^{X}=Z(s\lambda ,\nu )/Z(\lambda ,\nu )}$, and the mean and variance are given by

${\displaystyle \operatorname {E} X=\lambda {\frac {d}{d\lambda }}{\big \{}\ln(Z(\lambda ,\nu )){\big \}},}$

${\displaystyle \operatorname {var} (X)=\lambda {\frac {d}{d\lambda }}\operatorname {E} X.}$

The cumulant generating function is

${\displaystyle g(t)=\ln(\operatorname {E} [e^{tX}])=\ln(Z(\lambda e^{t},\nu ))-\ln(Z(\lambda ,\nu )),}$

and the cumulants are given by

${\displaystyle \kappa _{n}=g^{(n)}(0)={\frac {\partial ^{n}}{\partial t^{n}}}\ln(Z(\lambda e^{t},\nu )){\bigg |}_{t=0},\quad n\geq 1.}$

Whilst the normalizing constant ${\displaystyle Z(\lambda ,\nu )=\sum _{i=0}^{\infty }{\frac {\lambda ^{i}}{(i!)^{\nu }}}}$ does not in general have a closed form, there are some noteworthy special cases:

• ${\displaystyle Z(\lambda ,1)=\mathrm {e} ^{\lambda }}$
• ${\displaystyle Z(\lambda ,0)=(1-\lambda )^{-1}}$
• ${\displaystyle \lim _{\nu \rightarrow \infty }Z(\lambda ,\nu )=1+\lambda }$
• ${\displaystyle Z(\lambda ,2)=I_{0}(2{\sqrt {\lambda }})}$, where ${\displaystyle I_{0}(x)=\sum _{k=0}^{\infty }{\frac {1}{(k!)^{2}}}{\big (}{\frac {x}{2}}{\big )}^{2k}}$ is a modified Bessel function of the first kind.^[7]
• For integer ${\displaystyle \nu }$, the normalizing constant can expressed ^[6] as a generalized hypergeometric function: ${\displaystyle Z(\lambda ,\nu )=_{0}F_{\nu -1}(;1,\ldots ,1;\lambda )}$.

Because the normalizing constant does not in general have a closed form, the following asymptotic expansion is of interest. Fix ${\displaystyle \nu >0}$. Then, as ${\displaystyle \lambda \rightarrow \infty }$,^[8]

${\displaystyle Z(\lambda ,\nu )={\frac {\exp \left\{\nu \lambda ^{1/\nu }\right\}}{\lambda ^{(\nu -1)/2\nu }(2\pi )^{(\nu -1)/2}{\sqrt {\nu }}}}\sum _{k=0}^{\infty }c_{k}{\big (}\nu \lambda ^{1/\nu }{\big )}^{-k},}$

where the ${\displaystyle c_{j}}$ are uniquely determined by the expansion

${\displaystyle \left(\Gamma (t+1)\right)^{-\nu }={\frac {\nu ^{\nu (t+1/2)}}{\left(2\pi \right)^{(\nu -1)/2}}}\sum _{j=0}^{\infty }{\frac {c_{j}}{\Gamma (\nu t+(1+\nu )/2+j)}}.}$

In particular, ${\displaystyle c_{0}=1}$, ${\displaystyle c_{1}={\frac {\nu ^{2}-1}{24}}}$, ${\displaystyle c_{2}={\frac {\nu ^{2}-1}{1152}}\left(\nu ^{2}+23\right)}$. Further coefficients are given in.^[8]

For general values of ${\displaystyle \nu }$, there does not exist closed form formulas for the mean, variance and moments of the CMP distribution. We do, however, have the following neat formula.^[7] Let ${\displaystyle (j)_{r}=j(j-1)\cdots (j-r+1)}$ denote the falling factorial. Let ${\displaystyle X\sim \mathrm {CMP} (\lambda ,\nu )}$, ${\displaystyle \lambda ,\nu >0}$. Then

${\displaystyle \operatorname {E} [((X)_{r})^{\nu }]=\lambda ^{r},}$

for ${\displaystyle r\in \mathbb {N} }$.

Since in general closed form formulas are not available for moments and cumulants of the CMP distribution, the following asymptotic formulas are of interest. Let ${\displaystyle X\sim \mathrm {CMP} (\lambda ,\nu )}$, where ${\displaystyle \nu >0}$. Denote the skewness ${\displaystyle \gamma _{1}={\frac {\kappa _{3}}{\sigma ^{3}}}}$ and excess kurtosis ${\displaystyle \gamma _{2}={\frac {\kappa _{4}}{\sigma ^{4}}}}$, where ${\displaystyle \sigma ^{2}=\mathrm {Var} (X)}$. Then, as ${\displaystyle \lambda \rightarrow \infty }$,^[8]

${\displaystyle \operatorname {E} X=\lambda ^{1/\nu }\left(1-{\frac {\nu -1}{2\nu }}\lambda ^{-1/\nu }-{\frac {\nu ^{2}-1}{24\nu ^{2}}}\lambda ^{-2/\nu }-{\frac {\nu ^{2}-1}{24\nu ^{3}}}\lambda ^{-3/\nu }+{\mathcal {O}}(\lambda ^{-4/\nu })\right),}$

${\displaystyle \mathrm {Var} (X)={\frac {\lambda ^{1/\nu }}{\nu }}{\bigg (}1+{\frac {\nu ^{2}-1}{24\nu ^{2}}}\lambda ^{-2/\nu }+{\frac {\nu ^{2}-1}{12\nu ^{3}}}\lambda ^{-3/\nu }+{\mathcal {O}}(\lambda ^{-4/\nu }){\bigg )},}$

${\displaystyle \kappa _{n}={\frac {\lambda ^{1/\nu }}{\nu ^{n-1}}}{\bigg (}1+{\frac {(-1)^{n}(\nu ^{2}-1)}{24\nu ^{2}}}\lambda ^{-2/\nu }+{\frac {(-2)^{n}(\nu ^{2}-1)}{48\nu ^{3}}}\lambda ^{-3/\nu }+{\mathcal {O}}(\lambda ^{-4/\nu }){\bigg )},}$

${\displaystyle \gamma _{1}={\frac {\lambda ^{-1/2\nu }}{\sqrt {\nu }}}{\bigg (}1-{\frac {5(\nu ^{2}-1)}{48\nu ^{2}}}\lambda ^{-2/\nu }-{\frac {7(\nu ^{2}-1)}{24\nu ^{3}}}\lambda ^{-3/\nu }+{\mathcal {O}}(\lambda ^{-4/\nu }){\bigg )},}$

${\displaystyle \gamma _{2}={\frac {\lambda ^{-1/\nu }}{\nu }}{\bigg (}1-{\frac {(\nu ^{2}-1)}{24\nu ^{2}}}\lambda ^{-2/\nu }+{\frac {(\nu ^{2}-1)}{6\nu ^{3}}}\lambda ^{-3/\nu }+{\mathcal {O}}(\lambda ^{-4/\nu }){\bigg )},}$

${\displaystyle \operatorname {E} [X^{n}]=\lambda ^{n/\nu }{\bigg (}1+{\frac {n(n-\nu )}{2\nu }}\lambda ^{-1/\nu }+a_{2}\lambda ^{-2/\nu }+{\mathcal {O}}(\lambda ^{-3/\nu }){\bigg )},}$

where

${\displaystyle a_{2}=-{\frac {n(\nu -1)(6n\nu ^{2}-3n\nu -15n+4\nu +10)}{24\nu ^{2}}}+{\frac {1}{\nu ^{2}}}{\bigg \{}{\binom {n}{3}}+3{\binom {n}{4}}{\bigg \}}.}$

The asymptotic series for ${\displaystyle \kappa _{n}}$ holds for all ${\displaystyle n\geq 2}$, and ${\displaystyle \kappa _{1}=\operatorname {E} X}$.

When ${\displaystyle \nu }$ is an integer explicit formulas for moments can be obtained. The case ${\displaystyle \nu =1}$ corresponds to the Poisson distribution. Suppose now that ${\displaystyle \nu =2}$. For ${\displaystyle m\in \mathbb {N} }$,^[7]

${\displaystyle \operatorname {E} [(X)_{m}]={\frac {\lambda ^{m/2}I_{m}(2{\sqrt {\lambda }})}{I_{0}(2{\sqrt {\lambda }})}},}$

where ${\displaystyle I_{r}(x)}$ is the modified Bessel function of the first kind.

Using the connecting formula for moments and factorial moments gives

${\displaystyle \operatorname {E} X^{m}=\sum _{k=1}^{m}\left\{{m \atop k}\right\}{\frac {\lambda ^{k/2}I_{k}(2{\sqrt {\lambda }})}{I_{0}(2{\sqrt {\lambda }})}}.}$

In particular, the mean of ${\displaystyle X}$ is given by

${\displaystyle \operatorname {E} X={\frac {{\sqrt {\lambda }}I_{1}(2{\sqrt {\lambda }})}{I_{0}(2{\sqrt {\lambda }})}}.}$

Also, since ${\displaystyle \operatorname {E} X^{2}=\lambda }$, the variance is given by

${\displaystyle \mathrm {Var} (X)=\lambda \left(1-{\frac {I_{1}(2{\sqrt {\lambda }})^{2}}{I_{0}(2{\sqrt {\lambda }})^{2}}}\right).}$

Suppose now that ${\displaystyle \nu \geq 1}$ is an integer. Then ^[6]

${\displaystyle \operatorname {E} [(X)_{m}]={\frac {\lambda ^{m}}{(m!)^{\nu -1}}}{\frac {_{0}F_{\nu -1}(;m+1,\ldots ,m+1;\lambda )}{_{0}F_{\nu -1}(;1,\ldots ,1;\lambda )}}.}$

In particular,

${\displaystyle \operatorname {E} [X]=\lambda {\frac {_{0}F_{\nu -1}(;2,\ldots ,2;\lambda )}{_{0}F_{\nu -1}(;1,\ldots ,1;\lambda )}},}$

and

${\displaystyle \mathrm {Var} (X)={\frac {\lambda ^{2}}{2^{\nu -1}}}{\frac {_{0}F_{\nu -1}(;3,\ldots ,3;\lambda )}{_{0}F_{\nu -1}(;1,\ldots ,1;\lambda )}}+\operatorname {E} [X]-(\operatorname {E} [X])^{2}.}$

Let ${\displaystyle X\sim \mathrm {CMP} (\lambda ,\nu )}$. Then the mode of ${\displaystyle X}$ is ${\displaystyle \lfloor \lambda ^{1/\nu }\rfloor }$ if ${\displaystyle \lambda ^{1/\nu }<m}$ is not an integer. Otherwise, the modes of ${\displaystyle X}$ are ${\displaystyle \lambda ^{1/\nu }}$ and ${\displaystyle \lambda ^{1/\nu }-1}$.^[7]

The mean deviation of ${\displaystyle X^{\nu }}$ about its mean ${\displaystyle \lambda }$ is given by ^[7]

${\displaystyle \operatorname {E} |X^{\nu }-\lambda |=2Z(\lambda ,\nu )^{-1}{\frac {\lambda ^{\lfloor \lambda ^{1/\nu }\rfloor +1}}{\lfloor \lambda ^{1/\nu }\rfloor !}}.}$

No explicit formula is known for the median of ${\displaystyle X}$, but the following asymptotic result is available.^[7] Let ${\displaystyle m}$ be the median of ${\displaystyle X\sim {\mbox{CMP}}(\lambda ,\nu )}$. Then

${\displaystyle m=\lambda ^{1/\nu }+{\mathcal {O}}\left(\lambda ^{1/2\nu }\right),}$

as ${\displaystyle \lambda \rightarrow \infty }$.

Let ${\displaystyle X\sim {\mbox{CMP}}(\lambda ,\nu )}$, and suppose that ${\displaystyle f:\mathbb {Z} ^{+}\mapsto \mathbb {R} }$ is such that ${\displaystyle \operatorname {E} |f(X+1)|<\infty }$ and ${\displaystyle \operatorname {E} |X^{\nu }f(X)|<\infty }$. Then

${\displaystyle \operatorname {E} [\lambda f(X+1)-X^{\nu }f(X)]=0.}$

Conversely, suppose now that ${\displaystyle W}$ is a real-valued random variable supported on ${\displaystyle \mathbb {Z} ^{+}}$ such that ${\displaystyle \operatorname {E} [\lambda f(W+1)-W^{\nu }f(W)]=0}$ for all bounded ${\displaystyle f:\mathbb {Z} ^{+}\mapsto \mathbb {R} }$. Then ${\displaystyle W\sim {\mbox{CMP}}(\lambda ,\nu )}$.^[7]

Let ${\displaystyle Y_{n}}$ have the Conway–Maxwell–binomial distribution with parameters ${\displaystyle n}$, ${\displaystyle p=\lambda /n^{\nu }}$ and ${\displaystyle \nu }$. Fix ${\displaystyle \lambda >0}$ and ${\displaystyle \nu >0}$. Then, ${\displaystyle Y_{n}}$ converges in distribution to the ${\displaystyle \mathrm {CMP} (\lambda ,\nu )}$ distribution as ${\displaystyle n\rightarrow \infty }$.^[7] This result generalises the classical Poisson approximation of the binomial distribution. More generally, the CMP distribution arises as a limiting distribution of Conway–Maxwell–Poisson binomial distribution.^[7] Apart from the fact that COM-binomial approximates to COM-Poisson, Zhang et al. (2018)^[9] illustrates that COM-negative binomial distribution with probability mass function

${\displaystyle \mathrm {P} (X=k)={\frac {{{({\frac {\Gamma (r+k)}{k!\Gamma (r)}})}^{\nu }}{p^{k}}{{(1-p)}^{r}}}{\sum \limits _{i=0}^{\infty }{{({\frac {\Gamma (r+i)}{i!\Gamma (r)}})}^{\nu }}{p^{i}}{{(1-p)}^{r}}}}={{\left({\frac {\Gamma (r+k)}{k!\Gamma (r)}}\right)}^{\nu }}{{p^{k}}{{(1-p)}^{r}}}{\frac {1}{C(r,\nu ,p)}},\quad (k=0,1,2,\ldots ),}$

convergents to a limiting distribution which is the COM-Poisson, as ${\displaystyle {r\to +\infty }}$ .

• ${\displaystyle X\sim \operatorname {CMP} (\lambda ,1)}$, then ${\displaystyle X}$ follows the Poisson distribution with parameter ${\displaystyle \lambda }$.
• Suppose ${\displaystyle \lambda <1}$. Then if ${\displaystyle X\sim \mathrm {CMP} (\lambda ,0)}$, we have that ${\displaystyle X}$ follows the geometric distribution with probability mass function ${\displaystyle P(X=k)=\lambda ^{k}(1-\lambda )}$, ${\displaystyle k\geq 0}$.
• The sequence of random variable ${\displaystyle X_{\nu }\sim \mathrm {CMP} (\lambda ,\nu )}$ converges in distribution as ${\displaystyle \nu \rightarrow \infty }$ to the Bernoulli distribution with mean ${\displaystyle \lambda (1+\lambda )^{-1}}$.

There are a few methods of estimating the parameters of the CMP distribution from the data. Two methods will be discussed: weighted least squares and maximum likelihood. The weighted least squares approach is simple and efficient but lacks precision. Maximum likelihood, on the other hand, is precise, but is more complex and computationally intensive.

The weighted least squares provides a simple, efficient method to derive rough estimates of the parameters of the CMP distribution and determine if the distribution would be an appropriate model. Following the use of this method, an alternative method should be employed to compute more accurate estimates of the parameters if the model is deemed appropriate.

This method uses the relationship of successive probabilities as discussed above. By taking logarithms of both sides of this equation, the following linear relationship arises

${\displaystyle \log {\frac {p_{x-1}}{p_{x}}}=-\log \lambda +\nu \log x}$

where ${\displaystyle p_{x}}$ denotes ${\displaystyle \Pr(X=x)}$. When estimating the parameters, the probabilities can be replaced by the relative frequencies of ${\displaystyle x}$ and ${\displaystyle x-1}$. To determine if the CMP distribution is an appropriate model, these values should be plotted against ${\displaystyle \log x}$ for all ratios without zero counts. If the data appear to be linear, then the model is likely to be a good fit.

Once the appropriateness of the model is determined, the parameters can be estimated by fitting a regression of ${\displaystyle \log({\hat {p}}_{x-1}/{\hat {p}}_{x})}$ on ${\displaystyle \log x}$. However, the basic assumption of homoscedasticity is violated, so a weighted least squares regression must be used. The inverse weight matrix will have the variances of each ratio on the diagonal with the one-step covariances on the first off-diagonal, both given below.

${\displaystyle \operatorname {var} \left[\log {\frac {{\hat {p}}_{x-1}}{{\hat {p}}_{x}}}\right]\approx {\frac {1}{np_{x}}}+{\frac {1}{np_{x-1}}}}$

${\displaystyle {\text{cov}}\left(\log {\frac {{\hat {p}}_{x-1}}{{\hat {p}}_{x}}},\log {\frac {{\hat {p}}_{x}}{{\hat {p}}_{x+1}}}\right)\approx -{\frac {1}{np_{x}}}}$

The CMP likelihood function is

${\displaystyle {\mathcal {L}}(\lambda ,\nu \mid x_{1},\dots ,x_{n})=\lambda ^{S_{1}}\exp(-\nu S_{2})Z^{-n}(\lambda ,\nu )}$

where ${\displaystyle S_{1}=\sum _{i=1}^{n}x_{i}}$ and ${\displaystyle S_{2}=\sum _{i=1}^{n}\log x_{i}!}$. Maximizing the likelihood yields the following two equations

${\displaystyle \operatorname {E} [X]={\bar {X}}}$

${\displaystyle \operatorname {E} [\log X!]={\overline {\log X!}}}$

which do not have an analytic solution.

Instead, the maximum likelihood estimates are approximated numerically by the Newton–Raphson method. In each iteration, the expectations, variances, and covariance of ${\displaystyle X}$ and ${\displaystyle \log X!}$ are approximated by using the estimates for ${\displaystyle \lambda }$ and ${\displaystyle \nu }$ from the previous iteration in the expression

${\displaystyle \operatorname {E} [f(x)]=\sum _{j=0}^{\infty }f(j){\frac {\lambda ^{j}}{(j!)^{\nu }Z(\lambda ,\nu )}}.}$

This is continued until convergence of ${\displaystyle {\hat {\lambda }}}$ and ${\displaystyle {\hat {\nu }}}$.

The basic CMP distribution discussed above has also been used as the basis for a generalized linear model (GLM) using a Bayesian formulation. A dual-link GLM based on the CMP distribution has been developed,^[10] and this model has been used to evaluate traffic accident data.^[11][12] The CMP GLM developed by Guikema and Coffelt (2008) is based on a reformulation of the CMP distribution above, replacing ${\displaystyle \lambda }$ with ${\displaystyle \mu =\lambda ^{1/\nu }}$. The integral part of ${\displaystyle \mu }$ is then the mode of the distribution. A full Bayesian estimation approach has been used with MCMC sampling implemented in WinBugs with non-informative priors for the regression parameters.^[10][11] This approach is computationally expensive, but it yields the full posterior distributions for the regression parameters and allows expert knowledge to be incorporated through the use of informative priors.

A classical GLM formulation for a CMP regression has been developed which generalizes Poisson regression and logistic regression.^[13] This takes advantage of the exponential family properties of the CMP distribution to obtain elegant model estimation (via maximum likelihood), inference, diagnostics, and interpretation. This approach requires substantially less computational time than the Bayesian approach, at the cost of not allowing expert knowledge to be incorporated into the model.^[13] In addition it yields standard errors for the regression parameters (via the Fisher Information matrix) compared to the full posterior distributions obtainable via the Bayesian formulation. It also provides a statistical test for the level of dispersion compared to a Poisson model. Code for fitting a CMP regression, testing for dispersion, and evaluating fit is available.^[14]

The two GLM frameworks developed for the CMP distribution significantly extend the usefulness of this distribution for data analysis problems.

• Conway–Maxwell–Poisson distribution package for R (compoisson) by Jeffrey Dunn, part of Comprehensive R Archive Network (CRAN)
• Conway–Maxwell–Poisson distribution package for R (compoisson) by Tom Minka, third party package