beta distribution

In probability theory and statistics, the beta distribution is a family of continuous probability distributions defined on the interval , 1in terms of two positive parameters, denoted by ''alpha'' (''α'') and ''beta'' (''β''), that appear as exponents of the random variable and control the shape of the distribution.

The beta distribution has been applied to model the behavior of random variables limited to intervals of finite length in a wide variety of disciplines. The beta distribution is a suitable model for the random behavior of percentages and proportions.

In Bayesian inference, the beta distribution is the conjugate prior probability distribution for the Bernoulli, binomial, negative binomial and geometric distributions.

The formulation of the beta distribution discussed here is also known as the beta distribution of the first kind, whereas ''beta distribution of the second kind'' is an alternative name for the beta prime distribution. The generalization to multiple variables is called a Dirichlet distribution.

Definitions

Probability density function

The probability density function (PDF) of the beta distribution, for , and shape parameters ''α'', ''β'' > 0, is a power function of the variable ''x'' and of its reflection as follows:

:
\begin
f(x;\alpha,\beta) & = \mathrm\cdot x^(1-x)^ \\ pt& = \frac \\ pt& = \frac\, x^(1-x)^ \\ pt& = \frac x^(1-x)^
\end

where Γ(''z'') is the gamma function. The beta function, $\Beta$, is a normalization constant to ensure that the total probability is 1. In the above equations ''x'' is a realization—an observed value that actually occurred—of a random process ''X''.

This definition includes both ends and , which is consistent with definitions for other continuous distributions supported on a bounded interval which are special cases of the beta distribution, for example the arcsine distribution, and consistent with several authors, like N. L. Johnson and S. Kotz. However, the inclusion of and does not work for ; accordingly, several other authors, including W. Feller, choose to exclude the ends and , (so that the two ends are not actually part of the domain of the density function) and consider instead .

Several authors, including N. L. Johnson and S. Kotz, use the symbols ''p'' and ''q'' (instead of ''α'' and ''β'') for the shape parameters of the beta distribution, reminiscent of the symbols traditionally used for the parameters of the Bernoulli distribution, because the beta distribution approaches the Bernoulli distribution in the limit when both shape parameters ''α'' and ''β'' approach the value of zero.

In the following, a random variable ''X'' beta-distributed with parameters ''α'' and ''β'' will be denoted by:

:$X \sim \operatorname(\alpha, \beta)$

Other notations for beta-distributed random variables used in the statistical literature are $X \sim \mathcale(\alpha, \beta)$ and $X \sim \beta_$.

Cumulative distribution function

The cumulative distribution function is

:$F(x;\alpha,\beta) = \frac = I_x(\alpha,\beta)$

where $\Beta(x;\alpha,\beta)$ is the incomplete beta function and $I_x(\alpha,\beta)$ is the regularized incomplete beta function.

Alternative parameterizations

Two parameters

=Mean and sample size

=
The beta distribution may also be reparameterized in terms of its mean ''μ'' and the sum of the two shape parameters ( p. 83). Denoting by αPosterior and βPosterior the shape parameters of the posterior beta distribution resulting from applying Bayes theorem to a binomial likelihood function and a prior probability, the interpretation of the addition of both shape parameters to be sample size = ''ν'' = ''α''·Posterior + ''β''·Posterior is only correct for the Haldane prior probability Beta(0,0). Specifically, for the Bayes (uniform) prior Beta(1,1) the correct interpretation would be sample size = ''α''·Posterior + ''β'' Posterior − 2, or ''ν'' = (sample size) + 2. For sample size much larger than 2, the difference between these two priors becomes negligible. (See section Bayesian inference for further details.) ν = α + β is referred to as the "sample size" of a Beta distribution, but one should remember that it is, strictly speaking, the "sample size" of a binomial likelihood function only when using a Haldane Beta(0,0) prior in Bayes theorem.

This parametrization may be useful in Bayesian parameter estimation. For example, one may administer a test to a number of individuals. If it is assumed that each person's score (0 ≤ ''θ'' ≤ 1) is drawn from a population-level Beta distribution, then an important statistic is the mean of this population-level distribution. The mean and sample size parameters are related to the shape parameters α and β via

: ''α'' = ''μν'', ''β'' = (1 − ''μ'')''ν''

Under this parametrization, one may place an uninformative prior probability over the mean, and a vague prior probability (such as an exponential or gamma distribution) over the positive reals for the sample size, if they are independent, and prior data and/or beliefs justify it.

=Mode and concentration

=
Concave beta distributions, which have $\alpha,\beta>1$, can be parametrized in terms of mode and "concentration". The mode, $\omega=\frac$, and concentration, $\kappa = \alpha + \beta$, can be used to define the usual shape parameters as follows:
:$\begin \alpha &= \omega (\kappa - 2) + 1\\ \beta &= (1 - \omega)(\kappa - 2) + 1 \end$
For the mode, $0<\omega<1$, to be well-defined, we need $\alpha,\beta>1$, or equivalently $\kappa>2$. If instead we define the concentration as $c=\alpha+\beta-2$, the condition simplifies to $c>0$ and the beta density at $\alpha=1+c\omega$ and $\beta=1+c(1-\omega)$ can be written as:
:$f(x;\omega,c) = \frac$
where $c$ directly scales the sufficient statistics, $\log(x)$ and $\log(1-x)$. Note also that in the limit, $c\to0$, the distribution becomes flat.

=Mean and variance

=

Solving the system of (coupled) equations given in the above sections as the equations for the mean and the variance of the beta distribution in terms of the original parameters ''α'' and ''β'', one can express the ''α'' and ''β'' parameters in terms of the mean (''μ'') and the variance (var):

:$\begin \nu &= \alpha + \beta = \frac-1, \text\nu =(\alpha + \beta) >0,\text\text< \mu(1-\mu)\\ \alpha&= \mu \nu =\mu \left(\frac-1\right), \text \text< \mu(1-\mu)\\ \beta &= (1 - \mu) \nu = (1 - \mu)\left(\frac-1\right), \text\text< \mu(1-\mu). \end$

This parametrization of the beta distribution may lead to a more intuitive understanding than the one based on the original parameters ''α'' and ''β''. For example, by expressing the mode, skewness, excess kurtosis and differential entropy in terms of the mean and the variance:

Four parameters

A beta distribution with the two shape parameters α and β is supported on the range ,1or (0,1). It is possible to alter the location and scale of the distribution by introducing two further parameters representing the minimum, ''a'', and maximum ''c'' (''c'' > ''a''), values of the distribution, by a linear transformation substituting the non-dimensional variable ''x'' in terms of the new variable ''y'' (with support 'a'',''c''or (''a'',''c'')) and the parameters ''a'' and ''c'':

:$y = x(c-a) + a, \textx = \frac.$

The probability density function of the four parameter beta distribution is equal to the two parameter distribution, scaled by the range (''c''-''a''), (so that the total area under the density curve equals a probability of one), and with the "y" variable shifted and scaled as follows:
::$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

That a random variable ''Y'' is Beta-distributed with four parameters α, β, ''a'', and ''c'' will be denoted by:

:$Y \sim \operatorname(\alpha, \beta, a, c).$

Some measures of central location are scaled (by (''c''-''a'')) and shifted (by ''a''), as follows:

:$\begin \mu_Y &= \mu_X(c-a) + a = \left(\frac\right)(c-a) + a = \frac \\ \text(Y) &=\text(X)(c-a) + a = \left(\frac\right)(c-a) + a = \frac\ ,\qquad \text \alpha, \beta>1 \\ \text(Y) &= \text(X)(c-a) + a = \left (I_^(\alpha,\beta) \right )(c-a)+a \\ \end$

Note: the geometric mean and harmonic mean cannot be transformed by a linear transformation in the way that the mean, median and mode can.

The shape parameters of ''Y'' can be written in term of its mean and variance as

:$\begin \alpha &= \frac \\ \beta &= -\frac \\ \end$

The statistical dispersion measures are scaled (they do not need to be shifted because they are already centered on the mean) by the range (c-a), linearly for the mean deviation and nonlinearly for the variance:

::$\text(Y)=$
::$(\text(X))(c-a) =\frac(c-a)$
::$\text(Y) =\text(X)(c-a)^2 =\frac.$

Since the skewness and excess kurtosis are non-dimensional quantities (as moments centered on the mean and normalized by the standard deviation), they are independent of the parameters ''a'' and ''c'', and therefore equal to the expressions given above in terms of ''X'' (with support ,1or (0,1)):

::$\text(Y) =\text(X) = \frac.$

::$\text(Y) =\text(X)=\frac$

Properties

Measures of central tendency

Mode

The mode of a Beta distributed random variable ''X'' with ''α'', ''β'' > 1 is the most likely value of the distribution (corresponding to the peak in the PDF), and is given by the following expression:

:$\frac .$

When both parameters are less than one (''α'', ''β'' < 1), this is the anti-mode: the lowest point of the probability density curve.

Letting ''α'' = ''β'', the expression for the mode simplifies to 1/2, showing that for ''α'' = ''β'' > 1 the mode (resp. anti-mode when ), is at the center of the distribution: it is symmetric in those cases. See Shapes section in this article for a full list of mode cases, for arbitrary values of ''α'' and ''β''. For several of these cases, the maximum value of the density function occurs at one or both ends. In some cases the (maximum) value of the density function occurring at the end is finite. For example, in the case of ''α'' = 2, ''β'' = 1 (or ''α'' = 1, ''β'' = 2), the density function becomes a right-triangle distribution which is finite at both ends. In several other cases there is a singularity at one end, where the value of the density function approaches infinity. For example, in the case ''α'' = ''β'' = 1/2, the Beta distribution simplifies to become the arcsine distribution. There is debate among mathematicians about some of these cases and whether the ends (''x'' = 0, and ''x'' = 1) can be called ''modes'' or not.

* Whether the ends are part of the domain of the density function
* Whether a singularity can ever be called a ''mode''
* Whether cases with two maxima should be called ''bimodal''

Median

The median of the beta distribution is the unique real number $x = I_^(\alpha,\beta)$ for which the regularized incomplete beta function $I_x(\alpha,\beta) = \tfrac$. There is no general closed-form expression for the median of the beta distribution for arbitrary values of ''α'' and ''β''. Closed-form expressions for particular values of the parameters ''α'' and ''β'' follow:

* For symmetric cases ''α'' = ''β'', median = 1/2.
* For ''α'' = 1 and ''β'' > 0, median $=1-2^$ (this case is the mirror-image of the power function ,1distribution)
* For ''α'' > 0 and ''β'' = 1, median = $2^$ (this case is the power function ,1distribution)
* For ''α'' = 3 and ''β'' = 2, median = 0.6142724318676105..., the real solution to the quartic equation 1 − 8''x''³ + 6''x''⁴ = 0, which lies in ,1
* For ''α'' = 2 and ''β'' = 3, median = 0.38572756813238945... = 1−median(Beta(3, 2))

The following are the limits with one parameter finite (non-zero) and the other approaching these limits:

:$\begin \lim_ \text= \lim_ \text = 1,\\ \lim_ \text= \lim_ \text = 0. \end$

A reasonable approximation of the value of the median of the beta distribution, for both α and β greater or equal to one, is given by the formula

:$\text \approx \frac \text \alpha, \beta \ge 1.$

When α, β ≥ 1, the relative error (the absolute error divided by the median) in this approximation is less than 4% and for both α ≥ 2 and β ≥ 2 it is less than 1%. The absolute error divided by the difference between the mean and the mode is similarly small:

Mean

The expected value (mean) (''μ'') of a Beta distribution random variable ''X'' with two parameters ''α'' and ''β'' is a function of only the ratio ''β''/''α'' of these parameters:

: \begin
\mu = \operatorname &= \int_0^1 x f(x;\alpha,\beta)\,dx \\
&= \int_0^1 x \,\frac\,dx \\
&= \frac \\
&= \frac
\end

Letting in the above expression one obtains , showing that for the mean is at the center of the distribution: it is symmetric. Also, the following limits can be obtained from the above expression:

:$\begin \lim_ \mu = 1\\ \lim_ \mu = 0 \end$

Therefore, for ''β''/''α'' → 0, or for ''α''/''β'' → ∞, the mean is located at the right end, . For these limit ratios, the beta distribution becomes a one-point degenerate distribution with a Dirac delta function spike at the right end, , with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the right end, .

Similarly, for ''β''/''α'' → ∞, or for ''α''/''β'' → 0, the mean is located at the left end, . The beta distribution becomes a 1-point Degenerate distribution with a Dirac delta function spike at the left end, ''x'' = 0, with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the left end, ''x'' = 0. Following are the limits with one parameter finite (non-zero) and the other approaching these limits:

:$\begin \lim_ \mu = \lim_ \mu = 1\\ \lim_ \mu = \lim_ \mu = 0 \end$

While for typical unimodal distributions (with centrally located modes, inflexion points at both sides of the mode, and longer tails) (with Beta(''α'', ''β'') such that ) it is known that the sample mean (as an estimate of location) is not as robust as the sample median, the opposite is the case for uniform or "U-shaped" bimodal distributions (with Beta(''α'', ''β'') such that ), with the modes located at the ends of the distribution. As Mosteller and Tukey remark ( p. 207) "the average of the two extreme observations uses all the sample information. This illustrates how, for short-tailed distributions, the extreme observations should get more weight." By contrast, it follows that the median of "U-shaped" bimodal distributions with modes at the edge of the distribution (with Beta(''α'', ''β'') such that ) is not robust, as the sample median drops the extreme sample observations from consideration. A practical application of this occurs for example for random walks, since the probability for the time of the last visit to the origin in a random walk is distributed as the arcsine distribution Beta(1/2, 1/2): the mean of a number of realizations of a random walk is a much more robust estimator than the median (which is an inappropriate sample measure estimate in this case).

Geometric mean

The logarithm of the geometric mean ''G_X'' of a distribution with random variable ''X'' is the arithmetic mean of ln(''X''), or, equivalently, its expected value:

:\ln G_X = \operatorname ln X/math>

For a beta distribution, the expected value integral gives:

:\begin
\operatorname ln X&= \int_0^1 \ln x\, f(x;\alpha,\beta)\,dx \\ pt&= \int_0^1 \ln x \,\frac\,dx \\ pt&= \frac \, \int_0^1 \frac\,dx \\ pt&= \frac \frac \int_0^1 x^(1-x)^\,dx \\ pt&= \frac \frac \\ pt&= \frac \\ pt&= \frac - \frac \\ pt&= \psi(\alpha) - \psi(\alpha + \beta)
\end

where ''ψ'' is the digamma function.

Therefore, the geometric mean of a beta distribution with shape parameters ''α'' and ''β'' is the exponential of the digamma functions of ''α'' and ''β'' as follows:

:$G_X =e^= e^$

While for a beta distribution with equal shape parameters α = β, it follows that skewness = 0 and mode = mean = median = 1/2, the geometric mean is less than 1/2: . The reason for this is that the logarithmic transformation strongly weights the values of ''X'' close to zero, as ln(''X'') strongly tends towards negative infinity as ''X'' approaches zero, while ln(''X'') flattens towards zero as .

Along a line , the following limits apply:

:$\begin &\lim_ G_X = 0 \\ &\lim_ G_X =\tfrac \end$

Following are the limits with one parameter finite (non-zero) and the other approaching these limits:

:$\begin \lim_ G_X = \lim_ G_X = 1\\ \lim_ G_X = \lim_ G_X = 0 \end$

The accompanying plot shows the difference between the mean and the geometric mean for shape parameters α and β from zero to 2. Besides the fact that the difference between them approaches zero as α and β approach infinity and that the difference becomes large for values of α and β approaching zero, one can observe an evident asymmetry of the geometric mean with respect to the shape parameters α and β. The difference between the geometric mean and the mean is larger for small values of α in relation to β than when exchanging the magnitudes of β and α.

N. L.Johnson and S. Kotz suggest the logarithmic approximation to the digamma function ''ψ''(''α'') ≈ ln(''α'' − 1/2) which results in the following approximation to the geometric mean:

:$G_X \approx \frac\text \alpha, \beta > 1.$

Numerical values for the relative error in this approximation follow: []; []; []; []; []; []; []; [].

Similarly, one can calculate the value of shape parameters required for the geometric mean to equal 1/2. Given the value of the parameter ''β'', what would be the value of the other parameter, ''α'', required for the geometric mean to equal 1/2?. The answer is that (for ), the value of ''α'' required tends towards as . For example, all these couples have the same geometric mean of 1/2: [], [], [], [], [], [], [].

The fundamental property of the geometric mean, which can be proven to be false for any other mean, is

:$G\left(\frac\right) = \frac$

This makes the geometric mean the only correct mean when averaging ''normalized'' results, that is results that are presented as ratios to reference values. This is relevant because the beta distribution is a suitable model for the random behavior of percentages and it is particularly suitable to the statistical modelling of proportions. The geometric mean plays a central role in maximum likelihood estimation, see section "Parameter estimation, maximum likelihood." Actually, when performing maximum likelihood estimation, besides the geometric mean ''G_X'' based on the random variable X, also another geometric mean appears naturally: the geometric mean based on the linear transformation ––, the mirror-image of ''X'', denoted by ''G''_(1−''X''):

:$G_ = e^ = e^$

Along a line , the following limits apply:

:$\begin &\lim_ G_ =0 \\ &\lim_ G_ =\tfrac \end$

Following are the limits with one parameter finite (non-zero) and the other approaching these limits:

:$\begin \lim_ G_ = \lim_ G_ = 0\\ \lim_ G_ = \lim_ G_ = 1 \end$

It has the following approximate value:

:$G_ \approx \frac\text \alpha, \beta > 1.$

Although both ''G''_''X'' and ''G''_(1−''X'') are asymmetric, in the case that both shape parameters are equal , the geometric means are equal: ''G''_''X'' = ''G''_(1−''X''). This equality follows from the following symmetry displayed between both geometric means:

:$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) ).$

Harmonic mean

The inverse of the harmonic mean (''H_X'') of a distribution with random variable ''X'' is the arithmetic mean of 1/''X'', or, equivalently, its expected value. Therefore, the harmonic mean (''H_X'') of a beta distribution with shape parameters ''α'' and ''β'' is:

:$\begin H_X &= \frac \\ &=\frac \\ &=\frac \\ &= \frac\text \alpha > 1 \text \beta > 0 \\ \end$

The harmonic mean (''H_X'') of a Beta distribution with ''α'' < 1 is undefined, because its defining expression is not bounded in , 1for shape parameter ''α'' less than unity.

Letting ''α'' = ''β'' in the above expression one obtains

:$H_X = \frac,$

showing that for ''α'' = ''β'' the harmonic mean ranges from 0, for ''α'' = ''β'' = 1, to 1/2, for ''α'' = ''β'' → ∞.

Following are the limits with one parameter finite (non-zero) and the other approaching these limits:

:$\begin &\lim_ H_X \text \\ &\lim_ H_X = \lim_ H_X = 0 \\ &\lim_ H_X = \lim_ H_X = 1 \end$

The harmonic mean plays a role in maximum likelihood estimation for the four parameter case, in addition to the geometric mean. Actually, when performing maximum likelihood estimation for the four parameter case, besides the harmonic mean ''H_X'' based on the random variable ''X'', also another harmonic mean appears naturally: the harmonic mean based on the linear transformation (1 − ''X''), the mirror-image of ''X'', denoted by ''H''_{1 − ''X''}:

:$H_ = \frac = \frac \text \beta > 1, \text \alpha> 0.$

The harmonic mean (''H''_{(1 − ''X'')}) of a Beta distribution with ''β'' < 1 is undefined, because its defining expression is not bounded in , 1for shape parameter ''β'' less than unity.

Letting ''α'' = ''β'' in the above expression one obtains

:$H_ = \frac,$

showing that for ''α'' = ''β'' the harmonic mean ranges from 0, for ''α'' = ''β'' = 1, to 1/2, for ''α'' = ''β'' → ∞.

Following are the limits with one parameter finite (non-zero) and the other approaching these limits:

:$\begin &\lim_ H_ \text \\ &\lim_ H_ = \lim_ H_ = 0 \\ &\lim_ H_ = \lim_ H_ = 1 \end$

Although both ''H''_''X'' and ''H''_1−''X'' are asymmetric, in the case that both shape parameters are equal ''α'' = ''β'', the harmonic means are equal: ''H''_''X'' = ''H''_1−''X''. This equality follows from the following symmetry displayed between both harmonic means:

:$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta> 1.$

Measures of statistical dispersion

Variance

The variance (the second moment centered on the mean) of a Beta distribution random variable ''X'' with parameters α and β is:

:\operatorname(X) = \operatorname X - \mu)^2= \frac

Letting α = β in the above expression one obtains

:$\operatorname(X) = \frac,$

showing that for ''α'' = ''β'' the variance decreases monotonically as increases. Setting in this expression, one finds the maximum variance var(''X'') = 1/4 which only occurs approaching the limit, at .

The beta distribution may also be parametrized in terms of its mean ''μ'' and sample size () (see subsection Mean and sample size):

:$\begin \alpha &= \mu \nu, \text\nu =(\alpha + \beta) >0\\ \beta &= (1 - \mu) \nu, \text\nu =(\alpha + \beta) >0. \end$

Using this parametrization, one can express the variance in terms of the mean ''μ'' and the sample size ''ν'' as follows:

:$\operatorname(X) = \frac$

Since , it follows that .

For a symmetric distribution, the mean is at the middle of the distribution, , and therefore:

:$\operatorname(X) = \frac \text \mu = \tfrac$

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \operatorname(X) =\lim_ \operatorname(X) =\lim_ \operatorname(X) =\lim_ \operatorname(X) = \lim_ \operatorname(X) =\lim_ \operatorname(X) =\lim_ \operatorname(X) = 0\\ &\lim_ \operatorname(X) = \mu (1-\mu) \end$

Geometric variance and covariance

The logarithm of the geometric variance, ln(var_''GX''), of a distribution with random variable ''X'' is the second moment of the logarithm of ''X'' centered on the geometric mean of ''X'', ln(''G_X''):

:\begin
\ln \operatorname_ &= \operatorname \left \ln X - \ln G_X)^2 \right \\
&= \operatorname \ln X - \operatorname\left [\ln X^2 \right">ln_X.html" ;"title="\ln X - \operatorname\left [\ln X">\ln X - \operatorname\left [\ln X^2 \right\\
&= \operatorname\left[(\ln X)^2 \right] - (\operatorname ln X^2\\
&= \operatorname ln X\end

and therefore, the geometric variance is:

:$\operatorname_ = e^$

In the Fisher information matrix, and the curvature of the log likelihood function, the logarithm of the geometric variance of the reflected variable 1 − ''X'' and the logarithm of the geometric covariance between ''X'' and 1 − ''X'' appear:

:\begin
\ln \operatorname &= \operatorname \ln (1-X) - \ln G_)^2\\
&= \operatorname \ln (1-X) - \operatorname[\ln (1-X)^2">ln_(1-X).html" ;"title="\ln (1-X) - \operatorname[\ln (1-X)">\ln (1-X) - \operatorname[\ln (1-X)^2\\
&= \operatorname[(\ln (1-X))^2] - (\operatorname[\ln (1-X)])^2\\
&= \operatorname ln (1-X)\\
& \\
\operatorname &= e^ \\
& \\
\ln \operatorname &= \operatorname[(\ln X - \ln G_X)(\ln (1-X) - \ln G_)] \\
&= \operatorname ln X(\ln (1-X) - \operatorname \ln X - \operatorname ln X(\ln (1-X) - \operatorname[\ln (1-X)">ln (1-X)">\ln X - \operatorname ln X(\ln (1-X) - \operatorname[\ln (1-X)\\
&= \operatorname\left[\ln X \ln(1-X)\right] - \operatorname[\ln X]\operatorname[\ln(1-X)]\\
&= \operatorname ln X, \ln(1-X)\\
& \\
\operatorname_ &= e^
\end

For a beta distribution, higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions. See the section . The variance of the logarithmic variables and covariance of ln ''X'' and ln(1−''X'') are:

: \operatorname ln X \psi_1(\alpha) - \psi_1(\alpha + \beta)
: \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta)
: \operatorname ln X, \ln(1-X)= -\psi_1(\alpha+\beta)

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac.$

Therefore,

: \ln \operatorname_=\operatorname ln X \psi_1(\alpha) - \psi_1(\alpha + \beta)
: \ln \operatorname_ =\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta)
: \ln \operatorname_ =\operatorname ln X, \ln(1-X)= -\psi_1(\alpha+\beta)

The accompanying plots show the log geometric variances and log geometric covariance versus the shape parameters ''α'' and ''β''. The plots show that the log geometric variances and log geometric covariance are close to zero for shape parameters α and β greater than 2, and that the log geometric variances rapidly rise in value for shape parameter values ''α'' and ''β'' less than unity. The log geometric variances are positive for all values of the shape parameters. The log geometric covariance is negative for all values of the shape parameters, and it reaches large negative values for ''α'' and ''β'' less than unity.

Following are the limits with one parameter finite (non-zero) and the other approaching these limits:

:$\begin &\lim_ \ln \operatorname_ = \lim_ \ln \operatorname_ =\infty \\ &\lim_ \ln \operatorname_ = \lim_ \ln \operatorname_ = \lim_ \ln \operatorname_ = \lim_ \ln \operatorname_ = \lim_ \ln \operatorname_ = \lim_ \ln \operatorname_ = 0\\ &\lim_ \ln \operatorname_ = \psi_1(\alpha)\\ &\lim_ \ln \operatorname_ = \psi_1(\beta)\\ &\lim_ \ln \operatorname_ = - \psi_1(\beta)\\ &\lim_ \ln \operatorname_ = - \psi_1(\alpha) \end$

Limits with two parameters varying:

:$\begin &\lim_( \lim_ \ln \operatorname_) = \lim_( \lim_ \ln \operatorname_) = \lim_ (\lim_ \ln \operatorname_) = \lim_( \lim_ \ln \operatorname_) =0\\ &\lim_ (\lim_ \ln \operatorname_) = \lim_ (\lim_ \ln \operatorname_) = \infty\\ &\lim_ (\lim_ \ln \operatorname_) = \lim_ (\lim_ \ln \operatorname_) = - \infty \end$

Although both ln(var_''GX'') and ln(var_{''G''(1 − ''X'')}) are asymmetric, when the shape parameters are equal, α = β, one has: ln(var_''GX'') = ln(var_''G(1−X)''). This equality follows from the following symmetry displayed between both log geometric variances:

:$\ln \operatorname_(\Beta(\alpha, \beta))=\ln \operatorname_(\Beta(\beta, \alpha)).$

The log geometric covariance is symmetric:

:$\ln \operatorname_(\Beta(\alpha, \beta) )=\ln \operatorname_(\Beta(\beta, \alpha))$

Mean absolute deviation around the mean

The mean absolute deviation around the mean for the beta distribution with shape parameters α and β is:

:\operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] &=\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X]= 0 \\
\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] &=\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] = 0\\
\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X]&=\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] = 0\\
\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] &= \sqrt \\
\lim_ \operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname[, X - E ] (\Beta(\alpha, \beta))=\operatorname[, X - E ] (\Beta(\beta, \alpha))

* Skewness Symmetry (mathematics), skew-symmetry
::$\operatorname (\Beta(\alpha, \beta) )= - \operatorname (\Beta(\beta, \alpha) )$

* Excess kurtosis symmetry
::$\text (\Beta(\alpha, \beta) )= \text (\Beta(\beta, \alpha) )$

* Characteristic function symmetry of Real part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it)]$

* Characteristic function Symmetry (mathematics), skew-symmetry of Imaginary part (with respect to the origin of variable "t")
::$\text [_1F_1(\alpha; \alpha+\beta; it) ] = - \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Characteristic function symmetry of Absolute value (with respect to the origin of variable "t")
::$\text [ _1F_1(\alpha; \alpha+\beta; it) ] = \text [ _1F_1(\alpha; \alpha+\beta; - it) ]$

* Differential entropy symmetry
::$h(\Beta(\alpha, \beta) )= h(\Beta(\beta, \alpha) )$

* Relative Entropy (also called Kullback–Leibler divergence) symmetry
::$D_(X_1, , X_2) = D_(X_2, , X_1), \texth(X_1) = h(X_2)\text\alpha \neq \beta$

* Fisher information matrix symmetry
::$_ = _$

Geometry of the probability density function

Inflection points

For certain values of the shape parameters α and β, the probability density function has inflection points, at which the curvature changes sign. The position of these inflection points can be useful as a measure of the Statistical dispersion, dispersion or spread of the distribution.

Defining the following quantity:

:$\kappa =\frac$

Points of inflection occur, depending on the value of the shape parameters α and β, as follows:

*(α > 2, β > 2) The distribution is bell-shaped (symmetric for α = β and skewed otherwise), with two inflection points, equidistant from the mode:
::$x = \text \pm \kappa = \frac$

* (α = 2, β > 2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

* (α > 2, β = 2) The distribution is unimodal, negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x = \text - \kappa = 1 - \frac$

* (1 < α < 2, β > 2, α+β>2) The distribution is unimodal, positively skewed, right-tailed, with one inflection point, located to the right of the mode:
::$x =\text + \kappa = \frac$

*(0 < α < 1, 1 < β < 2) The distribution has a mode at the left end ''x'' = 0 and it is positively skewed, right-tailed. There is one inflection point, located to the right of the mode:
::$x = \frac$

*(α > 2, 1 < β < 2) The distribution is unimodal negatively skewed, left-tailed, with one inflection point, located to the left of the mode:
::$x =\text - \kappa = \frac$

*(1 < α < 2, 0 < β < 1) The distribution has a mode at the right end ''x''=1 and it is negatively skewed, left-tailed. There is one inflection point, located to the left of the mode:
::$x = \frac$

There are no inflection points in the remaining (symmetric and skewed) regions: U-shaped: (α, β < 1) upside-down-U-shaped: (1 < α < 2, 1 < β < 2), reverse-J-shaped (α < 1, β > 2) or J-shaped: (α > 2, β < 1)

The accompanying plots show the inflection point locations (shown vertically, ranging from 0 to 1) versus α and β (the horizontal axes ranging from 0 to 5). There are large cuts at surfaces intersecting the lines α = 1, β = 1, α = 2, and β = 2 because at these values the beta distribution change from 2 modes, to 1 mode to no mode.

Shapes

The beta density function can take a wide variety of different shapes depending on the values of the two parameters ''α'' and ''β''. The ability of the beta distribution to take this great diversity of shapes (using only two parameters) is partly responsible for finding wide application for modeling actual measurements:

=Symmetric (''α'' = ''β'')

=
* the density function is symmetry, symmetric about 1/2 (blue & teal plots).
* median = mean = 1/2.
*skewness = 0.
*variance = 1/(4(2α + 1))
*α = β < 1
**U-shaped (blue plot).
**bimodal: left mode = 0, right mode =1, anti-mode = 1/2
**1/12 < var(''X'') < 1/4
**−2 < excess kurtosis(''X'') < −6/5
** α = β = 1/2 is the arcsine distribution
*** var(''X'') = 1/8
***excess kurtosis(''X'') = −3/2
***CF = Rinc (t)
** α = β → 0 is a 2-point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.
*** $\lim_ \operatorname(X) = \tfrac$
*** $\lim_ \operatorname(X) = - 2$ a lower value than this is impossible for any distribution to reach.
*** The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞
*α = β = 1
**the uniform distribution (continuous), uniform , 1distribution
**no mode
**var(''X'') = 1/12
**excess kurtosis(''X'') = −6/5
**The (negative anywhere else) information entropy, differential entropy reaches its Maxima and minima, maximum value of zero
**CF = Sinc (t)
*''α'' = ''β'' > 1
**symmetric unimodal
** mode = 1/2.
**0 < var(''X'') < 1/12
**−6/5 < excess kurtosis(''X'') < 0
**''α'' = ''β'' = 3/2 is a semi-elliptic , 1distribution, see: Wigner semicircle distribution
***var(''X'') = 1/16.
***excess kurtosis(''X'') = −1
***CF = 2 Jinc (t)
**''α'' = ''β'' = 2 is the parabolic , 1distribution
***var(''X'') = 1/20
***excess kurtosis(''X'') = −6/7
***CF = 3 Tinc (t)
**''α'' = ''β'' > 2 is bell-shaped, with inflection points located to either side of the mode
***0 < var(''X'') < 1/20
***−6/7 < excess kurtosis(''X'') < 0
**''α'' = ''β'' → ∞ is a 1-point Degenerate distribution with a Dirac delta function spike at the midpoint ''x'' = 1/2 with probability 1, and zero probability everywhere else. There is 100% probability (absolute certainty) concentrated at the single point ''x'' = 1/2.
***$\lim_ \operatorname(X) = 0$
***$\lim_ \operatorname(X) = 0$
***The information entropy, differential entropy approaches a Maxima and minima, minimum value of −∞

=Skewed (''α'' ≠ ''β'')

=
The density function is Skewness, skewed. An interchange of parameter values yields the mirror image (the reverse) of the initial curve, some more specific cases:
*''α'' < 1, ''β'' < 1
** U-shaped
** Positive skew for α < β, negative skew for α > β.
** bimodal: left mode = 0, right mode = 1, anti-mode = $\tfrac$
** 0 < median < 1.
** 0 < var(''X'') < 1/4
*α > 1, β > 1
** unimodal (magenta & cyan plots),
**Positive skew for α < β, negative skew for α > β.
**$\text= \tfrac$
** 0 < median < 1
** 0 < var(''X'') < 1/12
*α < 1, β ≥ 1
**reverse J-shaped with a right tail,
**positively skewed,
**strictly decreasing, convex function, convex
** mode = 0
** 0 < median < 1/2.
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=\tfrac, \beta=1$, or α = Φ the Golden ratio, golden ratio conjugate)
*α ≥ 1, β < 1
**J-shaped with a left tail,
**negatively skewed,
**strictly increasing, convex function, convex
** mode = 1
** 1/2 < median < 1
** $0 < \operatorname(X) < \tfrac,$ (maximum variance occurs for $\alpha=1, \beta=\tfrac$, or β = Φ the Golden ratio, golden ratio conjugate)
*α = 1, β > 1
**positively skewed,
**strictly decreasing (red plot),
**a reversed (mirror-image) power function ,1distribution
** mean = 1 / (β + 1)
** median = 1 - 1/2^1/β
** mode = 0
**α = 1, 1 < β < 2
***concave function, concave
*** $1-\tfrac< \text < \tfrac$
*** 1/18 < var(''X'') < 1/12.
**α = 1, β = 2
***a straight line with slope −2, the right-triangular distribution with right angle at the left end, at ''x'' = 0
*** $\text=1-\tfrac$
*** var(''X'') = 1/18
**α = 1, β > 2
***reverse J-shaped with a right tail,
***convex function, convex
*** $0 < \text < 1-\tfrac$
*** 0 < var(''X'') < 1/18
*α > 1, β = 1
**negatively skewed,
**strictly increasing (green plot),
**the power function , 1distribution
** mean = α / (α + 1)
** median = 1/2^1/α
** mode = 1
**2 > α > 1, β = 1
***concave function, concave
*** $\tfrac < \text < \tfrac$
*** 1/18 < var(''X'') < 1/12
** α = 2, β = 1
***a straight line with slope +2, the right-triangular distribution with right angle at the right end, at ''x'' = 1
*** $\text=\tfrac$
*** var(''X'') = 1/18
**α > 2, β = 1
***J-shaped with a left tail, convex function, convex
***$\tfrac < \text < 1$
*** 0 < var(''X'') < 1/18

Related distributions

Transformations

* If ''X'' ~ Beta(''α'', ''β'') then 1 − ''X'' ~ Beta(''β'', ''α'') Mirror image, mirror-image symmetry
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac \sim (\alpha,\beta)$. The beta prime distribution, also called "beta distribution of the second kind".
* If ''X'' ~ Beta(''α'', ''β'') then $\tfrac -1 \sim (\beta,\alpha)$.
* If ''X'' ~ Beta(''n''/2, ''m''/2) then $\tfrac \sim F(n,m)$ (assuming ''n'' > 0 and ''m'' > 0), the F-distribution, Fisher–Snedecor F distribution.
* If $X \sim \operatorname\left(1+\lambda\tfrac, 1 + \lambda\tfrac\right)$ then min + ''X''(max − min) ~ PERT(min, max, ''m'', ''λ'') where ''PERT'' denotes a PERT distribution used in PERT analysis, and ''m''=most likely value.Herrerías-Velasco, José Manuel and Herrerías-Pleguezuelo, Rafael and René van Dorp, Johan. (2011). Revisiting the PERT mean and Variance. European Journal of Operational Research (210), p. 448–451. Traditionally ''λ'' = 4 in PERT analysis.
* If ''X'' ~ Beta(1, ''β'') then ''X'' ~ Kumaraswamy distribution with parameters (1, ''β'')
* If ''X'' ~ Beta(''α'', 1) then ''X'' ~ Kumaraswamy distribution with parameters (''α'', 1)
* If ''X'' ~ Beta(''α'', 1) then −ln(''X'') ~ Exponential(''α'')

Special and limiting cases

* Beta(1, 1) ~ uniform distribution (continuous), U(0, 1).
* Beta(n, 1) ~ Maximum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1), sometimes called a ''a standard power function distribution'' with density ''n'' ''x''^''n''-1 on that interval.
* Beta(1, n) ~ Minimum of ''n'' independent rvs. with uniform distribution (continuous), U(0, 1)
* If ''X'' ~ Beta(3/2, 3/2) and ''r'' > 0 then 2''rX'' − ''r'' ~ Wigner semicircle distribution.
* Beta(1/2, 1/2) is equivalent to the arcsine distribution. This distribution is also Jeffreys prior probability for the Bernoulli and binomial distributions. The arcsine probability density is a distribution that appears in several random-walk fundamental theorems. In a fair coin toss random walk, the probability for the time of the last visit to the origin is distributed as an (U-shaped) arcsine distribution. In a two-player fair-coin-toss game, a player is said to be in the lead if the random walk (that started at the origin) is above the origin. The most probable number of times that a given player will be in the lead, in a game of length 2''N'', is not ''N''. On the contrary, ''N'' is the least likely number of times that the player will be in the lead. The most likely number of times in the lead is 0 or 2''N'' (following the arcsine distribution).
* $\lim_ n \operatorname(1,n) = \operatorname(1)$ the exponential distribution.
* $\lim_ n \operatorname(k,n) = \operatorname(k,1)$ the gamma distribution.
* For large $n$, $\operatorname(\alpha n,\beta n) \to \mathcal\left(\frac,\frac\frac\right)$ the normal distribution. More precisely, if $X_n \sim \operatorname(\alpha n,\beta n)$ then $\sqrt\left(X_n -\tfrac\right)$ converges in distribution to a normal distribution with mean 0 and variance $\tfrac$ as ''n'' increases.

Derived from other distributions

* The ''k''th order statistic of a sample of size ''n'' from the Uniform distribution (continuous), uniform distribution is a beta random variable, ''U''_(''k'') ~ Beta(''k'', ''n''+1−''k'').
* If ''X'' ~ Gamma(α, θ) and ''Y'' ~ Gamma(β, θ) are independent, then $\tfrac \sim \operatorname(\alpha, \beta)\,$.
* If $X \sim \chi^2(\alpha)\,$ and $Y \sim \chi^2(\beta)\,$ are independent, then $\tfrac \sim \operatorname(\tfrac, \tfrac)$.
* If ''X'' ~ U(0, 1) and ''α'' > 0 then ''X''^1/''α'' ~ Beta(''α'', 1). The power function distribution.
* If $X \sim\operatorname(k;n;p)$, then $\sim \operatorname(\alpha, \beta)$ for discrete values of ''n'' and ''k'' where $\alpha=k+1$ and $\beta=n-k+1$.
* If ''X'' ~ Cauchy(0, 1) then $\tfrac \sim \operatorname\left(\tfrac12, \tfrac12\right)\,$

Combination with other distributions

* ''X'' ~ Beta(''α'', ''β'') and ''Y'' ~ F(2''β'',2''α'') then $\Pr(X \leq \tfrac \alpha ) = \Pr(Y \geq x)\,$ for all ''x'' > 0.

Compounding with other distributions

* If ''p'' ~ Beta(α, β) and ''X'' ~ Bin(''k'', ''p'') then ''X'' ~ beta-binomial distribution
* If ''p'' ~ Beta(α, β) and ''X'' ~ NB(''r'', ''p'') then ''X'' ~ beta negative binomial distribution

Generalisations

* The generalization to multiple variables, i.e. a Dirichlet distribution, multivariate Beta distribution, is called a Dirichlet distribution. Univariate marginals of the Dirichlet distribution have a beta distribution. The beta distribution is Conjugate prior, conjugate to the binomial and Bernoulli distributions in exactly the same way as the Dirichlet distribution is conjugate to the multinomial distribution and categorical distribution.
* The Pearson distribution#The Pearson type I distribution, Pearson type I distribution is identical to the beta distribution (except for arbitrary shifting and re-scaling that can also be accomplished with the four parameter parametrization of the beta distribution).
* The beta distribution is the special case of the noncentral beta distribution where $\lambda = 0$: $\operatorname(\alpha, \beta) = \operatorname(\alpha,\beta,0)$.
* The generalized beta distribution is a five-parameter distribution family which has the beta distribution as a special case.
* The matrix variate beta distribution is a distribution for positive-definite matrices.

Statistical inference

Parameter estimation

Method of moments

=Two unknown parameters

=
Two unknown parameters ($(\hat, \hat)$ of a beta distribution supported in the ,1interval) can be estimated, using the method of moments, with the first two moments (sample mean and sample variance) as follows. Let:

: $\text=\bar = \frac\sum_^N X_i$

be the sample mean estimate and

: $\text =\bar = \frac\sum_^N (X_i - \bar)^2$

be the sample variance estimate. The method of moments (statistics), method-of-moments estimates of the parameters are

:$\hat = \bar \left(\frac - 1 \right),$ if $\bar <\bar(1 - \bar),$
: $\hat = (1-\bar) \left(\frac - 1 \right),$ if $\bar<\bar(1 - \bar).$

When the distribution is required over a known interval other than , 1with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace $\bar$ with $\frac,$ and $\bar$ with $\frac$ in the above couple of equations for the shape parameters (see the "Alternative parametrizations, four parameters" section below)., where:

: $\text=\bar = \frac\sum_^N Y_i$
: $\text = \bar = \frac\sum_^N (Y_i - \bar)^2$

=Four unknown parameters

=

All four parameters ($\hat, \hat, \hat, \hat$ of a beta distribution supported in the [''a'', ''c''] interval -see section Beta distribution#Four parameters 2, "Alternative parametrizations, Four parameters"-) can be estimated, using the method of moments developed by Karl Pearson, by equating sample and population values of the first four central moments (mean, variance, skewness and excess kurtosis). The excess kurtosis was expressed in terms of the square of the skewness, and the sample size ν = α + β, (see previous section Beta distribution#Kurtosis, "Kurtosis") as follows:

:$\text =\frac\left(\frac (\text)^2 - 1\right)\text^2-2< \text< \tfrac (\text)^2$

One can use this equation to solve for the sample size ν= α + β in terms of the square of the skewness and the excess kurtosis as follows:

:$\hat = \hat + \hat = 3\frac$
:$\text^2-2< \text< \tfrac (\text)^2$

This is the ratio (multiplied by a factor of 3) between the previously derived limit boundaries for the beta distribution in a space (as originally done by Karl Pearson) defined with coordinates of the square of the skewness in one axis and the excess kurtosis in the other axis (see ):

The case of zero skewness, can be immediately solved because for zero skewness, α = β and hence ν = 2α = 2β, therefore α = β = ν/2

: $\hat = \hat = \frac= \frac$
: $\text= 0 \text -2<\text<0$

(Excess kurtosis is negative for the beta distribution with zero skewness, ranging from -2 to 0, so that $\hat$ -and therefore the sample shape parameters- is positive, ranging from zero when the shape parameters approach zero and the excess kurtosis approaches -2, to infinity when the shape parameters approach infinity and the excess kurtosis approaches zero).

For non-zero sample skewness one needs to solve a system of two coupled equations. Since the skewness and the excess kurtosis are independent of the parameters $\hat, \hat$, the parameters $\hat, \hat$ can be uniquely determined from the sample skewness and the sample excess kurtosis, by solving the coupled equations with two known variables (sample skewness and sample excess kurtosis) and two unknowns (the shape parameters):

:$(\text)^2 = \frac$
:$\text =\frac\left(\frac (\text)^2 - 1\right)$
:$\text^2-2< \text< \tfrac(\text)^2$

resulting in the following solution:

: $\hat, \hat = \frac \left (1 \pm \frac \right )$

: $\text\neq 0 \text (\text)^2-2< \text< \tfrac (\text)^2$

Where one should take the solutions as follows: $\hat>\hat$ for (negative) sample skewness < 0, and $\hat<\hat$ for (positive) sample skewness > 0.

The accompanying plot shows these two solutions as surfaces in a space with horizontal axes of (sample excess kurtosis) and (sample squared skewness) and the shape parameters as the vertical axis. The surfaces are constrained by the condition that the sample excess kurtosis must be bounded by the sample squared skewness as stipulated in the above equation. The two surfaces meet at the right edge defined by zero skewness. Along this right edge, both parameters are equal and the distribution is symmetric U-shaped for α = β < 1, uniform for α = β = 1, upside-down-U-shaped for 1 < α = β < 2 and bell-shaped for α = β > 2. The surfaces also meet at the front (lower) edge defined by "the impossible boundary" line (excess kurtosis + 2 - skewness² = 0). Along this front (lower) boundary both shape parameters approach zero, and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p=\tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1. The two surfaces become further apart towards the rear edge. At this rear edge the surface parameters are quite different from each other. As remarked, for example, by Bowman and Shenton, sampling in the neighborhood of the line (sample excess kurtosis - (3/2)(sample skewness)² = 0) (the just-J-shaped portion of the rear edge where blue meets beige), "is dangerously near to chaos", because at that line the denominator of the expression above for the estimate ν = α + β becomes zero and hence ν approaches infinity as that line is approached. Bowman and Shenton write that "the higher moment parameters (kurtosis and skewness) are extremely fragile (near that line). However, the mean and standard deviation are fairly reliable." Therefore, the problem is for the case of four parameter estimation for very skewed distributions such that the excess kurtosis approaches (3/2) times the square of the skewness. This boundary line is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. See for a numerical example and further comments about this rear edge boundary line (sample excess kurtosis - (3/2)(sample skewness)² = 0). As remarked by Karl Pearson himself this issue may not be of much practical importance as this trouble arises only for very skewed J-shaped (or mirror-image J-shaped) distributions with very different values of shape parameters that are unlikely to occur much in practice). The usual skewed-bell-shape distributions that occur in practice do not have this parameter estimation problem.

The remaining two parameters $\hat, \hat$ can be determined using the sample mean and the sample variance using a variety of equations. One alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample kurtosis. For this purpose one can solve, in terms of the range $(\hat- \hat)$, the equation expressing the excess kurtosis in terms of the sample variance, and the sample size ν (see and ):

:$\text =\frac\bigg(\frac - 6 - 5 \hat \bigg)$

to obtain:

:$(\hat- \hat) = \sqrt\sqrt$

Another alternative is to calculate the support interval range $(\hat-\hat)$ based on the sample variance and the sample skewness. For this purpose one can solve, in terms of the range $(\hat-\hat)$, the equation expressing the squared skewness in terms of the sample variance, and the sample size ν (see section titled "Skewness" and "Alternative parametrizations, four parameters"):

:$(\text)^2 = \frac\bigg(\frac-4(1+\hat)\bigg)$

to obtain:

:$(\hat- \hat) = \frac\sqrt$

The remaining parameter can be determined from the sample mean and the previously obtained parameters: $(\hat-\hat), \hat, \hat = \hat+\hat$:

:$\hat = (\text) - \left(\frac\right)(\hat-\hat)$

and finally, $\hat= (\hat- \hat) + \hat$.

In the above formulas one may take, for example, as estimates of the sample moments:

:$\begin \text &=\overline = \frac\sum_^N Y_i \\ \text &= \overline_Y = \frac\sum_^N (Y_i - \overline)^2 \\ \text &= G_1 = \frac \frac \\ \text &= G_2 = \frac \frac - \frac \end$

The estimators ''G''₁ for skewness, sample skewness and ''G''₂ for kurtosis, sample kurtosis are used by DAP (software), DAP/SAS System, SAS, PSPP/SPSS, and Microsoft Excel, Excel. However, they are not used by BMDP and (according to ) they were not used by MINITAB in 1998. Actually, Joanes and Gill in their 1998 study concluded that the skewness and kurtosis estimators used in BMDP and in MINITAB (at that time) had smaller variance and mean-squared error in normal samples, but the skewness and kurtosis estimators used in DAP (software), DAP/SAS System, SAS, PSPP/SPSS, namely ''G''₁ and ''G''₂, had smaller mean-squared error in samples from a very skewed distribution. It is for this reason that we have spelled out "sample skewness", etc., in the above formulas, to make it explicit that the user should choose the best estimator according to the problem at hand, as the best estimator for skewness and kurtosis depends on the amount of skewness (as shown by Joanes and Gill).

Maximum likelihood

=Two unknown parameters

=

As is also the case for maximum likelihood estimates for the gamma distribution, the maximum likelihood estimates for the beta distribution do not have a general closed form solution for arbitrary values of the shape parameters. If ''X''₁, ..., ''X_N'' are independent random variables each having a beta distribution, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta\mid X) &= \sum_^N \ln \left (\mathcal_i (\alpha, \beta\mid X_i) \right )\\ &= \sum_^N \ln \left (f(X_i;\alpha,\beta) \right ) \\ &= \sum_^N \ln \left (\frac \right ) \\ &= (\alpha - 1)\sum_^N \ln (X_i) + (\beta- 1)\sum_^N \ln (1-X_i) - N \ln \Beta(\alpha,\beta) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac = \sum_^N \ln X_i -N\frac=0$
:$\frac = \sum_^N \ln (1-X_i)- N\frac=0$

where:

:$\frac = -\frac+ \frac+ \frac=-\psi(\alpha + \beta) + \psi(\alpha) + 0$
:$\frac= - \frac+ \frac + \frac=-\psi(\alpha + \beta) + 0 + \psi(\beta)$

since the digamma function denoted ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) =\frac$

To ensure that the values with zero tangent slope are indeed a maximum (instead of a saddle-point or a minimum) one has to also satisfy the condition that the curvature is negative. This amounts to satisfying that the second partial derivative with respect to the shape parameters is negative

:$\frac= -N\frac<0$
:$\frac = -N\frac<0$

using the previous equations, this is equivalent to:

:$\frac = \psi_1(\alpha)-\psi_1(\alpha + \beta) > 0$
:$\frac = \psi_1(\beta) -\psi_1(\alpha + \beta) > 0$

where the trigamma function, denoted ''ψ''₁(''α''), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These conditions are equivalent to stating that the variances of the logarithmically transformed variables are positive, since:

:$\operatorname[\ln (X)] = \operatorname[\ln^2 (X)] - (\operatorname[\ln (X)])^2 = \psi_1(\alpha) - \psi_1(\alpha + \beta)$
:\operatorname ln (1-X)= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 = \psi_1(\beta) - \psi_1(\alpha + \beta)

Therefore, the condition of negative curvature at a maximum is equivalent to the statements:

: $\operatorname[\ln (X)] > 0$
: \operatorname ln (1-X)> 0

Alternatively, the condition of negative curvature at a maximum is also equivalent to stating that the following logarithmic derivatives of the geometric means ''G_X'' and ''G_(1−X)'' are positive, since:

: $\psi_1(\alpha) - \psi_1(\alpha + \beta) = \frac > 0$
: $\psi_1(\beta) - \psi_1(\alpha + \beta) = \frac > 0$

While these slopes are indeed positive, the other slopes are negative:

:$\frac, \frac < 0.$

The slopes of the mean and the median with respect to ''α'' and ''β'' display similar sign behavior.

From the condition that at a maximum, the partial derivative with respect to the shape parameter equals zero, we obtain the following system of coupled maximum likelihood estimate equations (for the average log-likelihoods) that needs to be inverted to obtain the (unknown) shape parameter estimates $\hat,\hat$ in terms of the (known) average of logarithms of the samples ''X''₁, ..., ''X_N'':

:$\begin \hat[\ln (X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln X_i = \ln \hat_X \\ \hat[\ln(1-X)] &= \psi(\hat) - \psi(\hat + \hat)=\frac\sum_^N \ln (1-X_i)= \ln \hat_ \end$

where we recognize $\log \hat_X$ as the logarithm of the sample geometric mean and $\log \hat_$ as the logarithm of the sample geometric mean based on (1 − ''X''), the mirror-image of ''X''. For $\hat=\hat$, it follows that $\hat_X=\hat_$.

:$\begin \hat_X &= \prod_^N (X_i)^ \\ \hat_ &= \prod_^N (1-X_i)^ \end$

These coupled equations containing digamma functions of the shape parameter estimates $\hat,\hat$ must be solved by numerical methods as done, for example, by Beckman et al. Gnanadesikan et al. give numerical solutions for a few cases. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz suggest that for "not too small" shape parameter estimates $\hat,\hat$, the logarithmic approximation to the digamma function $\psi(\hat) \approx \ln(\hat-\tfrac)$ may be used to obtain initial values for an iterative solution, since the equations resulting from this approximation can be solved exactly:

:$\ln \frac \approx \ln \hat_X$
:$\ln \frac\approx \ln \hat_$

which leads to the following solution for the initial values (of the estimate shape parameters in terms of the sample geometric means) for an iterative solution:

:$\hat\approx \tfrac + \frac \text \hat >1$
:$\hat\approx \tfrac + \frac \text \hat > 1$

Alternatively, the estimates provided by the method of moments can instead be used as initial values for an iterative solution of the maximum likelihood coupled equations in terms of the digamma functions.

When the distribution is required over a known interval other than , 1 with random variable ''X'', say [''a'', ''c''] with random variable ''Y'', then replace ln(''X_i'') in the first equation with

:$\ln \frac,$

and replace ln(1−''X_i'') in the second equation with

:$\ln \frac$

(see "Alternative parametrizations, four parameters" section below).

If one of the shape parameters is known, the problem is considerably simplified. The following logit transformation can be used to solve for the unknown shape parameter (for skewed cases such that $\hat\neq\hat$, otherwise, if symmetric, both -equal- parameters are known when one is known):

:$\hat \left[\ln \left(\frac \right) \right]=\psi(\hat) - \psi(\hat)=\frac\sum_^N \ln\frac = \ln \hat_X - \ln \left(\hat_\right)$

This logit transformation is the logarithm of the transformation that divides the variable ''X'' by its mirror-image (''X''/(1 - ''X'') resulting in the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) with support [0, +∞). As previously discussed in the section "Moments of logarithmically transformed random variables," the logit transformation $\ln\frac$, studied by Johnson, extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

If, for example, $\hat$ is known, the unknown parameter $\hat$ can be obtained in terms of the inverse digamma function of the right hand side of this equation:

:$\psi(\hat)=\frac\sum_^N \ln\frac + \psi(\hat)$
:$\hat=\psi^(\ln \hat_X - \ln \hat_ + \psi(\hat))$

In particular, if one of the shape parameters has a value of unity, for example for $\hat = 1$ (the power function distribution with bounded support [0,1]), using the identity ψ(''x'' + 1) = ψ(''x'') + 1/''x'' in the equation $\psi(\hat) - \psi(\hat + \hat)= \ln \hat_X$, the maximum likelihood estimator for the unknown parameter $\hat$ is, exactly:

:$\hat= - \frac= - \frac$

The beta has support [0, 1], therefore $\hat_X < 1$, and hence $(-\ln \hat_X) >0$, and therefore $\hat >0.$

In conclusion, the maximum likelihood estimates of the shape parameters of a beta distribution are (in general) a complicated function of the sample geometric mean, and of the sample geometric mean based on ''(1−X)'', the mirror-image of ''X''. One may ask, if the variance (in addition to the mean) is necessary to estimate two shape parameters with the method of moments, why is the (logarithmic or geometric) variance not necessary to estimate two shape parameters with the maximum likelihood method, for which only the geometric means suffice? The answer is because the mean does not provide as much information as the geometric mean. For a beta distribution with equal shape parameters ''α'' = ''β'', the mean is exactly 1/2, regardless of the value of the shape parameters, and therefore regardless of the value of the statistical dispersion (the variance). On the other hand, the geometric mean of a beta distribution with equal shape parameters ''α'' = ''β'', depends on the value of the shape parameters, and therefore it contains more information. Also, the geometric mean of a beta distribution does not satisfy the symmetry conditions satisfied by the mean, therefore, by employing both the geometric mean based on ''X'' and geometric mean based on (1 − ''X''), the maximum likelihood method is able to provide best estimates for both parameters ''α'' = ''β'', without need of employing the variance.

One can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the ''sufficient statistics'' (the sample geometric means) as follows:

:$\frac = (\alpha - 1)\ln \hat_X + (\beta- 1)\ln \hat_- \ln \Beta(\alpha,\beta).$

We can plot the joint log likelihood per ''N'' observations for fixed values of the sample geometric means to see the behavior of the likelihood function as a function of the shape parameters α and β. In such a plot, the shape parameter estimators $\hat,\hat$ correspond to the maxima of the likelihood function. See the accompanying graph that shows that all the likelihood functions intersect at α = β = 1, which corresponds to the values of the shape parameters that give the maximum entropy (the maximum entropy occurs for shape parameters equal to unity: the uniform distribution). It is evident from the plot that the likelihood function gives sharp peaks for values of the shape parameter estimators close to zero, but that for values of the shape parameters estimators greater than one, the likelihood function becomes quite flat, with less defined peaks. Obviously, the maximum likelihood parameter estimation method for the beta distribution becomes less acceptable for larger values of the shape parameter estimators, as the uncertainty in the peak definition increases with the value of the shape parameter estimators. One can arrive at the same conclusion by noticing that the expression for the curvature of the likelihood function is in terms of the geometric variances

:\frac= -\operatorname ln X/math>
:$\frac = -\operatorname[\ln (1-X)]$

These variances (and therefore the curvatures) are much larger for small values of the shape parameter α and β. However, for shape parameter values α, β > 1, the variances (and therefore the curvatures) flatten out. Equivalently, this result follows from the Cramér–Rao bound, since the Fisher information matrix components for the beta distribution are these logarithmic variances. The Cramér–Rao bound states that the variance of any ''unbiased'' estimator $\hat$ of α is bounded by the multiplicative inverse, reciprocal of the Fisher information:

:$\mathrm(\hat)\geq\frac\geq\frac$
:$\mathrm(\hat) \geq\frac\geq\frac$

so the variance of the estimators increases with increasing α and β, as the logarithmic variances decrease.

Also one can express the joint log likelihood per ''N'' independent and identically distributed random variables, iid observations in terms of the digamma function expressions for the logarithms of the sample geometric means as follows:

:$\frac = (\alpha - 1)(\psi(\hat) - \psi(\hat + \hat))+(\beta- 1)(\psi(\hat) - \psi(\hat + \hat))- \ln \Beta(\alpha,\beta)$

this expression is identical to the negative of the cross-entropy (see section on "Quantities of information (entropy)"). Therefore, finding the maximum of the joint log likelihood of the shape parameters, per ''N'' independent and identically distributed random variables, iid observations, is identical to finding the minimum of the cross-entropy for the beta distribution, as a function of the shape parameters.

:$\frac = - H = -h - D_ = -\ln\Beta(\alpha,\beta)+(\alpha-1)\psi(\hat)+(\beta-1)\psi(\hat)-(\alpha+\beta-2)\psi(\hat+\hat)$

with the cross-entropy defined as follows:

:$H = \int_^1 - f(X;\hat,\hat) \ln (f(X;\alpha,\beta)) \, X$

=Four unknown parameters

=
The procedure is similar to the one followed in the two unknown parameter case. If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters, the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\begin \ln\, \mathcal (\alpha, \beta, a, c\mid Y) &= \sum_^N \ln\,\mathcal_i (\alpha, \beta, a, c\mid Y_i)\\ &= \sum_^N \ln\,f(Y_i; \alpha, \beta, a, c) \\ &= \sum_^N \ln\,\frac\\ &= (\alpha - 1)\sum_^N \ln (Y_i - a) + (\beta- 1)\sum_^N \ln (c - Y_i)- N \ln \Beta(\alpha,\beta) - N (\alpha+\beta - 1) \ln (c - a) \end$

Finding the maximum with respect to a shape parameter involves taking the partial derivative with respect to the shape parameter and setting the expression equal to zero yielding the maximum likelihood estimator of the shape parameters:

:$\frac= \sum_^N \ln (Y_i - a) - N(-\psi(\alpha + \beta) + \psi(\alpha))- N \ln (c - a)= 0$
:$\frac = \sum_^N \ln (c - Y_i) - N(-\psi(\alpha + \beta) + \psi(\beta))- N \ln (c - a)= 0$
:$\frac = -(\alpha - 1) \sum_^N \frac \,+ N (\alpha+\beta - 1)\frac= 0$
:$\frac = (\beta- 1) \sum_^N \frac \,- N (\alpha+\beta - 1) \frac = 0$

these equations can be re-arranged as the following system of four coupled equations (the first two equations are geometric means and the second two equations are the harmonic means) in terms of the maximum likelihood estimates for the four parameters $\hat, \hat, \hat, \hat$:

:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat +\hat )= \ln \hat_X$
:$\frac\sum_^N \ln \frac = \psi(\hat)-\psi(\hat + \hat)= \ln \hat_$
:$\frac = \frac= \hat_X$
:$\frac = \frac = \hat_$

with sample geometric means:

:$\hat_X = \prod_^ \left (\frac \right )^$
:$\hat_ = \prod_^ \left (\frac \right )^$

The parameters $\hat, \hat$ are embedded inside the geometric mean expressions in a nonlinear way (to the power 1/''N''). This precludes, in general, a closed form solution, even for an initial value approximation for iteration purposes. One alternative is to use as initial values for iteration the values obtained from the method of moments solution for the four parameter case. Furthermore, the expressions for the harmonic means are well-defined only for $\hat, \hat > 1$, which precludes a maximum likelihood solution for shape parameters less than unity in the four-parameter case. Fisher's information matrix for the four parameter case is Positive-definite matrix, positive-definite only for α, β > 2 (for further discussion, see section on Fisher information matrix, four parameter case), for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. The following Fisher information components (that represent the expectations of the curvature of the log likelihood function) have mathematical singularity, singularities at the following values:

:$\alpha = 2: \quad \operatorname \left [- \frac \frac \right ]= _$
:$\beta = 2: \quad \operatorname\left [- \frac \frac \right ] = _$
:$\alpha = 2: \quad \operatorname\left [- \frac\frac\right ] = _$
:$\beta = 1: \quad \operatorname\left [- \frac\frac \right ] = _$

(for further discussion see section on Fisher information matrix). Thus, it is not possible to strictly carry on the maximum likelihood estimation for some well known distributions belonging to the four-parameter beta distribution family, like the continuous uniform distribution, uniform distribution (Beta(1, 1, ''a'', ''c'')), and the arcsine distribution (Beta(1/2, 1/2, ''a'', ''c'')). Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz ignore the equations for the harmonic means and instead suggest "If a and c are unknown, and maximum likelihood estimators of ''a'', ''c'', α and β are required, the above procedure (for the two unknown parameter case, with ''X'' transformed as ''X'' = (''Y'' − ''a'')/(''c'' − ''a'')) can be repeated using a succession of trial values of ''a'' and ''c'', until the pair (''a'', ''c'') for which maximum likelihood (given ''a'' and ''c'') is as great as possible, is attained" (where, for the purpose of clarity, their notation for the parameters has been translated into the present notation).

Fisher information matrix

Let a random variable X have a probability density ''f''(''x'';''α''). The partial derivative with respect to the (unknown, and to be estimated) parameter α of the log likelihood function is called the score (statistics), score. The second moment of the score is called the Fisher information:

:$\mathcal(\alpha)=\operatorname \left [\left (\frac \ln \mathcal(\alpha\mid X) \right )^2 \right],$

The expected value, expectation of the score (statistics), score is zero, therefore the Fisher information is also the second moment centered on the mean of the score: the variance of the score.

If the log likelihood function is twice differentiable with respect to the parameter α, and under certain regularity conditions, then the Fisher information may also be written as follows (which is often a more convenient form for calculation purposes):

:$\mathcal(\alpha) = - \operatorname \left [\frac \ln (\mathcal(\alpha\mid X)) \right].$

Thus, the Fisher information is the negative of the expectation of the second derivative with respect to the parameter α of the log likelihood function. Therefore, Fisher information is a measure of the curvature of the log likelihood function of α. A low curvature (and therefore high Radius of curvature (mathematics), radius of curvature), flatter log likelihood function curve has low Fisher information; while a log likelihood function curve with large curvature (and therefore low Radius of curvature (mathematics), radius of curvature) has high Fisher information. When the Fisher information matrix is computed at the evaluates of the parameters ("the observed Fisher information matrix") it is equivalent to the replacement of the true log likelihood surface by a Taylor's series approximation, taken as far as the quadratic terms. The word information, in the context of Fisher information, refers to information about the parameters. Information such as: estimation, sufficiency and properties of variances of estimators. The Cramér–Rao bound states that the inverse of the Fisher information is a lower bound on the variance of any estimator of a parameter α:

:$\operatorname[\hat\alpha] \geq \frac.$

The precision to which one can estimate the estimator of a parameter α is limited by the Fisher Information of the log likelihood function. The Fisher information is a measure of the minimum error involved in estimating a parameter of a distribution and it can be viewed as a measure of the resolving power of an experiment needed to discriminate between two alternative hypothesis of a parameter.

When there are ''N'' parameters

:$\begin \theta_1 \\ \theta_ \\ \dots \\ \theta_ \end,$

then the Fisher information takes the form of an ''N''×''N'' positive semidefinite matrix, positive semidefinite symmetric matrix, the Fisher Information Matrix, with typical element:

:$_=\operatorname \left [\left (\frac \ln \mathcal \right) \left(\frac \ln \mathcal \right) \right ].$

Under certain regularity conditions, the Fisher Information Matrix may also be written in the following form, which is often more convenient for computation:

:$_ = - \operatorname \left [\frac \ln (\mathcal) \right ]\,.$

With ''X''₁, ..., ''X_N'' iid random variables, an ''N''-dimensional "box" can be constructed with sides ''X''₁, ..., ''X_N''. Costa and Cover show that the (Shannon) differential entropy ''h''(''X'') is related to the volume of the typical set (having the sample entropy close to the true entropy), while the Fisher information is related to the surface of this typical set.

=Two parameters

=
For ''X''₁, ..., ''X''_''N'' independent random variables each having a beta distribution parametrized with shape parameters ''α'' and ''β'', the joint log likelihood function for ''N'' independent and identically distributed random variables, iid observations is:

:$\ln (\mathcal (\alpha, \beta\mid X) )= (\alpha - 1)\sum_^N \ln X_i + (\beta- 1)\sum_^N \ln (1-X_i)- N \ln \Beta(\alpha,\beta)$

therefore the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta\mid X)) = (\alpha - 1)\frac\sum_^N \ln X_i + (\beta- 1)\frac\sum_^N \ln (1-X_i)-\, \ln \Beta(\alpha,\beta)$

For the two parameter case, the Fisher information has 4 components: 2 diagonal and 2 off-diagonal. Since the Fisher information matrix is symmetric, one of these off diagonal components is independent. Therefore, the Fisher information matrix has 3 independent components (2 diagonal and 1 off diagonal).

Aryal and Nadarajah calculated Fisher's information matrix for the four-parameter case, from which the two parameter case can be obtained as follows:

:$- \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right ] = \ln \operatorname_$
:- \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname\left [- \frac \right]= \ln \operatorname_
:$- \frac = \operatorname[\ln X,\ln(1-X)] = -\psi_1(\alpha+\beta) =_= \operatorname\left [- \frac \right] = \ln \operatorname_$

Since the Fisher information matrix is symmetric

:$\mathcal_= \mathcal_= \ln \operatorname_$

The Fisher information components are equal to the log geometric variances and log geometric covariance. Therefore, they can be expressed as trigamma functions, denoted ψ₁(α), the second of the polygamma functions, defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac=\, \frac.$

These derivatives are also derived in the and plots of the log likelihood function are also shown in that section. contains plots and further discussion of the Fisher information matrix components: the log geometric variances and log geometric covariance as a function of the shape parameters α and β. contains formulas for moments of logarithmically transformed random variables. Images for the Fisher information components $\mathcal_, \mathcal_$ and $\mathcal_$ are shown in .

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components of the Fisher information matrix, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution is:

:\begin
\det(\mathcal(\alpha, \beta))&= \mathcal_ \mathcal_-\mathcal_ \mathcal_ \\ pt&=(\psi_1(\alpha) - \psi_1(\alpha + \beta))(\psi_1(\beta) - \psi_1(\alpha + \beta))-( -\psi_1(\alpha+\beta))( -\psi_1(\alpha+\beta))\\ pt&= \psi_1(\alpha)\psi_1(\beta)-( \psi_1(\alpha)+\psi_1(\beta))\psi_1(\alpha + \beta)\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = \infty\\ pt\lim_ \det(\mathcal(\alpha, \beta)) &=\lim_ \det(\mathcal(\alpha, \beta)) = 0
\end

From Sylvester's criterion (checking whether the diagonal elements are all positive), it follows that the Fisher information matrix for the two parameter case is Positive-definite matrix, positive-definite (under the standard condition that the shape parameters are positive ''α'' > 0 and ''β'' > 0).

=Four parameters

=

If ''Y''₁, ..., ''Y_N'' are independent random variables each having a beta distribution with four parameters: the exponents ''α'' and ''β'', and also ''a'' (the minimum of the distribution range), and ''c'' (the maximum of the distribution range) (section titled "Alternative parametrizations", "Four parameters"), with probability density function:

:$f(y; \alpha, \beta, a, c) = \frac =\frac=\frac.$

the joint log likelihood function per ''N'' independent and identically distributed random variables, iid observations is:

:$\frac \ln(\mathcal (\alpha, \beta, a, c\mid Y))= \frac\sum_^N \ln (Y_i - a) + \frac\sum_^N \ln (c - Y_i)- \ln \Beta(\alpha,\beta) - (\alpha+\beta -1) \ln (c-a)$

For the four parameter case, the Fisher information has 4*4=16 components. It has 12 off-diagonal components = (4×4 total − 4 diagonal). Since the Fisher information matrix is symmetric, half of these components (12/2=6) are independent. Therefore, the Fisher information matrix has 6 independent off-diagonal + 4 diagonal = 10 independent components. Aryal and Nadarajah calculated Fisher's information matrix for the four parameter case as follows:

:$- \frac \frac= \operatorname[\ln (X)]= \psi_1(\alpha) - \psi_1(\alpha + \beta) = \mathcal_= \operatorname\left [- \frac \frac \right ] = \ln (\operatorname)$
:-\frac \frac = \operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta) =_= \operatorname \left [- \frac \frac \right ] = \ln(\operatorname)
:$-\frac \frac = \operatorname[\ln X,(1-X)] = -\psi_1(\alpha+\beta) =\mathcal_= \operatorname \left [- \frac\frac \right ] = \ln(\operatorname_)$

In the above expressions, the use of ''X'' instead of ''Y'' in the expressions var[ln(''X'')] = ln(var_''GX'') is ''not an error''. The expressions in terms of the log geometric variances and log geometric covariance occur as functions of the two parameter ''X'' ~ Beta(''α'', ''β'') parametrization because when taking the partial derivatives with respect to the exponents (''α'', ''β'') in the four parameter case, one obtains the identical expressions as for the two parameter case: these terms of the four parameter Fisher information matrix are independent of the minimum ''a'' and maximum ''c'' of the distribution's range. The only non-zero term upon double differentiation of the log likelihood function with respect to the exponents ''α'' and ''β'' is the second derivative of the log of the beta function: ln(B(''α'', ''β'')). This term is independent of the minimum ''a'' and maximum ''c'' of the distribution's range. Double differentiation of this term results in trigamma functions. The sections titled "Maximum likelihood", "Two unknown parameters" and "Four unknown parameters" also show this fact.

The Fisher information for ''N'' i.i.d. samples is ''N'' times the individual Fisher information (eq. 11.279, page 394 of Cover and Thomas). (Aryal and Nadarajah take a single observation, ''N'' = 1, to calculate the following components of the Fisher information, which leads to the same result as considering the derivatives of the log likelihood per ''N'' observations. Moreover, below the erroneous expression for $_$ in Aryal and Nadarajah has been corrected.)

:$\begin \alpha > 2: \quad \operatorname\left [- \frac \frac \right ] &= _=\frac \\ \beta > 2: \quad \operatorname\left[-\frac \frac \right ] &= \mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \alpha > 1: \quad \operatorname\left[- \frac \frac \right ] &=\mathcal_ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = \frac \\ \operatorname\left[- \frac \frac \right ] &= _ = -\frac \\ \beta > 1: \quad \operatorname\left[- \frac \frac \right ] &= \mathcal_ = -\frac \end$

The lower two diagonal entries of the Fisher information matrix, with respect to the parameter "a" (the minimum of the distribution's range): $\mathcal_$, and with respect to the parameter "c" (the maximum of the distribution's range): $\mathcal_$ are only defined for exponents α > 2 and β > 2 respectively. The Fisher information matrix component $\mathcal_$ for the minimum "a" approaches infinity for exponent α approaching 2 from above, and the Fisher information matrix component $\mathcal_$ for the maximum "c" approaches infinity for exponent β approaching 2 from above.

The Fisher information matrix for the four parameter case does not depend on the individual values of the minimum "a" and the maximum "c", but only on the total range (''c''−''a''). Moreover, the components of the Fisher information matrix that depend on the range (''c''−''a''), depend only through its inverse (or the square of the inverse), such that the Fisher information decreases for increasing range (''c''−''a'').

The accompanying images show the Fisher information components $\mathcal_$ and $\mathcal_$. Images for the Fisher information components $\mathcal_$ and $\mathcal_$ are shown in . All these Fisher information components look like a basin, with the "walls" of the basin being located at low values of the parameters.

The following four-parameter-beta-distribution Fisher information components can be expressed in terms of the two-parameter: ''X'' ~ Beta(α, β) expectations of the transformed ratio ((1-''X'')/''X'') and of its mirror image (''X''/(1-''X'')), scaled by the range (''c''−''a''), which may be helpful for interpretation:

:$\mathcal_ =\frac= \frac \text\alpha > 1$
:$\mathcal_ = -\frac=- \frac\text\beta> 1$

These are also the expected values of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI) and its mirror image, scaled by the range (''c'' − ''a'').

Also, the following Fisher information components can be expressed in terms of the harmonic (1/X) variances or of variances based on the ratio transformed variables ((1-X)/X) as follows:

:$\begin \alpha > 2: \quad \mathcal_ &=\operatorname \left [\frac \right] \left (\frac \right )^2 =\operatorname \left [\frac \right ] \left (\frac \right)^2 = \frac \\ \beta > 2: \quad \mathcal_ &= \operatorname \left [\frac \right ] \left (\frac \right )^2 = \operatorname \left [\frac \right ] \left (\frac \right )^2 =\frac \\ \mathcal_ &=\operatorname \left [\frac,\frac \right ]\frac = \operatorname \left [\frac,\frac \right ] \frac =\frac \end$

See section "Moments of linearly transformed, product and inverted random variables" for these expectations.

The determinant of Fisher's information matrix is of interest (for example for the calculation of Jeffreys prior probability). From the expressions for the individual components, it follows that the determinant of Fisher's (symmetric) information matrix for the beta distribution with four parameters is:

:$\begin \det(\mathcal(\alpha,\beta,a,c)) = & -\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2 -\mathcal_ \mathcal_ \mathcal_^2\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_ \mathcal_+2 \mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -2\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_^2 \mathcal_^2-\mathcal_ \mathcal_ \mathcal_^2+\mathcal_ \mathcal_^2 \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\\ & -\mathcal_ \mathcal_ \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_\\ & +2 \mathcal_ \mathcal_ \mathcal_ \mathcal_-\mathcal_ \mathcal_^2 \mathcal_-\mathcal_^2 \mathcal_ \mathcal_+\mathcal_ \mathcal_ \mathcal_ \mathcal_\text\alpha, \beta> 2 \end$

Using Sylvester's criterion (checking whether the diagonal elements are all positive), and since diagonal components $_$ and $_$ have Mathematical singularity, singularities at α=2 and β=2 it follows that the Fisher information matrix for the four parameter case is Positive-definite matrix, positive-definite for α>2 and β>2. Since for α > 2 and β > 2 the beta distribution is (symmetric or unsymmetric) bell shaped, it follows that the Fisher information matrix is positive-definite only for bell-shaped (symmetric or unsymmetric) beta distributions, with inflection points located to either side of the mode. Thus, important well known distributions belonging to the four-parameter beta distribution family, like the parabolic distribution (Beta(2,2,a,c)) and the continuous uniform distribution, uniform distribution (Beta(1,1,a,c)) have Fisher information components ($\mathcal_,\mathcal_,\mathcal_,\mathcal_$) that blow up (approach infinity) in the four-parameter case (although their Fisher information components are all defined for the two parameter case). The four-parameter Wigner semicircle distribution (Beta(3/2,3/2,''a'',''c'')) and arcsine distribution (Beta(1/2,1/2,''a'',''c'')) have negative Fisher information determinants for the four-parameter case.

Bayesian inference

The use of Beta distributions in Bayesian inference is due to the fact that they provide a family of conjugate prior probability distributions for binomial (including Bernoulli) and geometric distributions. The domain of the beta distribution can be viewed as a probability, and in fact the beta distribution is often used to describe the distribution of a probability value ''p'':

:$P(p;\alpha,\beta) = \frac.$

Examples of beta distributions used as prior probabilities to represent ignorance of prior parameter values in Bayesian inference are Beta(1,1), Beta(0,0) and Beta(1/2,1/2).

Rule of succession

A classic application of the beta distribution is the rule of succession, introduced in the 18th century by Pierre-Simon Laplace in the course of treating the sunrise problem. It states that, given ''s'' successes in ''n'' conditional independence, conditionally independent Bernoulli trials with probability ''p,'' that the estimate of the expected value in the next trial is $\frac$. This estimate is the expected value of the posterior distribution over ''p,'' namely Beta(''s''+1, ''n''−''s''+1), which is given by Bayes' rule if one assumes a uniform prior probability over ''p'' (i.e., Beta(1, 1)) and then observes that ''p'' generated ''s'' successes in ''n'' trials. Laplace's rule of succession has been criticized by prominent scientists. R. T. Cox described Laplace's application of the rule of succession to the sunrise problem ( p. 89) as "a travesty of the proper use of the principle." Keynes remarks ( Ch.XXX, p. 382) "indeed this is so foolish a theorem that to entertain it is discreditable." Karl Pearson showed that the probability that the next (''n'' + 1) trials will be successes, after n successes in n trials, is only 50%, which has been considered too low by scientists like Jeffreys and unacceptable as a representation of the scientific process of experimentation to test a proposed scientific law. As pointed out by Jeffreys ( p. 128) (crediting C. D. Broad ) Laplace's rule of succession establishes a high probability of success ((n+1)/(n+2)) in the next trial, but only a moderate probability (50%) that a further sample (n+1) comparable in size will be equally successful. As pointed out by Perks, "The rule of succession itself is hard to accept. It assigns a probability to the next trial which implies the assumption that the actual run observed is an average run and that we are always at the end of an average run. It would, one would think, be more reasonable to assume that we were in the middle of an average run. Clearly a higher value for both probabilities is necessary if they are to accord with reasonable belief." These problems with Laplace's rule of succession motivated Haldane, Perks, Jeffreys and others to search for other forms of prior probability (see the next ). According to Jaynes, the main problem with the rule of succession is that it is not valid when s=0 or s=n (see rule of succession, for an analysis of its validity).

Bayes-Laplace prior probability (Beta(1,1))

The beta distribution achieves maximum differential entropy for Beta(1,1): the Uniform density, uniform probability density, for which all values in the domain of the distribution have equal density. This uniform distribution Beta(1,1) was suggested ("with a great deal of doubt") by Thomas Bayes as the prior probability distribution to express ignorance about the correct prior distribution. This prior distribution was adopted (apparently, from his writings, with little sign of doubt) by Pierre-Simon Laplace, and hence it was also known as the "Bayes-Laplace rule" or the "Laplace rule" of "inverse probability" in publications of the first half of the 20th century. In the later part of the 19th century and early part of the 20th century, scientists realized that the assumption of uniform "equal" probability density depended on the actual functions (for example whether a linear or a logarithmic scale was most appropriate) and parametrizations used. In particular, the behavior near the ends of distributions with finite support (for example near ''x'' = 0, for a distribution with initial support at ''x'' = 0) required particular attention. Keynes ( Ch.XXX, p. 381) criticized the use of Bayes's uniform prior probability (Beta(1,1)) that all values between zero and one are equiprobable, as follows: "Thus experience, if it shows anything, shows that there is a very marked clustering of statistical ratios in the neighborhoods of zero and unity, of those for positive theories and for correlations between positive qualities in the neighborhood of zero, and of those for negative theories and for correlations between negative qualities in the neighborhood of unity. "

Haldane's prior probability (Beta(0,0))

The Beta(0,0) distribution was proposed by J.B.S. Haldane, who suggested that the prior probability representing complete uncertainty should be proportional to ''p''⁻¹(1−''p'')⁻¹. The function ''p''⁻¹(1−''p'')⁻¹ can be viewed as the limit of the numerator of the beta distribution as both shape parameters approach zero: α, β → 0. The Beta function (in the denominator of the beta distribution) approaches infinity, for both parameters approaching zero, α, β → 0. Therefore, ''p''⁻¹(1−''p'')⁻¹ divided by the Beta function approaches a 2-point Bernoulli distribution with equal probability 1/2 at each end, at 0 and 1, and nothing in between, as α, β → 0. A coin-toss: one face of the coin being at 0 and the other face being at 1. The Haldane prior probability distribution Beta(0,0) is an "improper prior" because its integration (from 0 to 1) fails to strictly converge to 1 due to the singularities at each end. However, this is not an issue for computing posterior probabilities unless the sample size is very small. Furthermore, Zellner points out that on the log-odds scale, (the logit transformation ln(''p''/1−''p'')), the Haldane prior is the uniformly flat prior. The fact that a uniform prior probability on the logit transformed variable ln(''p''/1−''p'') (with domain (-∞, ∞)) is equivalent to the Haldane prior on the domain , 1was pointed out by Harold Jeffreys in the first edition (1939) of his book Theory of Probability ( p. 123). Jeffreys writes "Certainly if we take the Bayes-Laplace rule right up to the extremes we are led to results that do not correspond to anybody's way of thinking. The (Haldane) rule d''x''/(''x''(1−''x'')) goes too far the other way. It would lead to the conclusion that if a sample is of one type with respect to some property there is a probability 1 that the whole population is of that type." The fact that "uniform" depends on the parametrization, led Jeffreys to seek a form of prior that would be invariant under different parametrizations.

Jeffreys' prior probability (Beta(1/2,1/2) for a Bernoulli or for a binomial distribution)

Harold Jeffreys proposed to use an uninformative prior probability measure that should be Parametrization invariance, invariant under reparameterization: proportional to the square root of the determinant of Fisher's information matrix. For the Bernoulli distribution, this can be shown as follows: for a coin that is "heads" with probability ''p'' ∈ , 1and is "tails" with probability 1 − ''p'', for a given (H,T) ∈ the probability is ''p^H''(1 − ''p'')^''T''. Since ''T'' = 1 − ''H'', the Bernoulli distribution is ''p^H''(1 − ''p'')^{1 − ''H''}. Considering ''p'' as the only parameter, it follows that the log likelihood for the Bernoulli distribution is

:$\ln \mathcal (p\mid H) = H \ln(p)+ (1-H) \ln(1-p).$

The Fisher information matrix has only one component (it is a scalar, because there is only one parameter: ''p''), therefore:

:\begin
\sqrt &= \sqrt \\ pt&= \sqrt \\ pt&= \sqrt \\
&= \frac.
\end

Similarly, for the Binomial distribution with ''n'' Bernoulli trials, it can be shown that

:$\sqrt= \frac.$

Thus, for the Bernoulli, and Binomial distributions, Jeffreys prior is proportional to $\scriptstyle \frac$, which happens to be proportional to a beta distribution with domain variable ''x'' = ''p'', and shape parameters α = β = 1/2, the arcsine distribution:

:$Beta(\tfrac, \tfrac) = \frac.$

It will be shown in the next section that the normalizing constant for Jeffreys prior is immaterial to the final result because the normalizing constant cancels out in Bayes theorem for the posterior probability. Hence Beta(1/2,1/2) is used as the Jeffreys prior for both Bernoulli and binomial distributions. As shown in the next section, when using this expression as a prior probability times the likelihood in Bayes theorem, the posterior probability turns out to be a beta distribution. It is important to realize, however, that Jeffreys prior is proportional to $\scriptstyle \frac$ for the Bernoulli and binomial distribution, but not for the beta distribution. Jeffreys prior for the beta distribution is given by the determinant of Fisher's information for the beta distribution, which, as shown in the is a function of the trigamma function ψ₁ of shape parameters α and β as follows:

:$\begin \sqrt &= \sqrt \\ \lim_ \sqrt &=\lim_ \sqrt = \infty\\ \lim_ \sqrt &=\lim_ \sqrt = 0 \end$

As previously discussed, Jeffreys prior for the Bernoulli and binomial distributions is proportional to the arcsine distribution Beta(1/2,1/2), a one-dimensional ''curve'' that looks like a basin as a function of the parameter ''p'' of the Bernoulli and binomial distributions. The walls of the basin are formed by ''p'' approaching the singularities at the ends ''p'' → 0 and ''p'' → 1, where Beta(1/2,1/2) approaches infinity. Jeffreys prior for the beta distribution is a ''2-dimensional surface'' (embedded in a three-dimensional space) that looks like a basin with only two of its walls meeting at the corner α = β = 0 (and missing the other two walls) as a function of the shape parameters α and β of the beta distribution. The two adjoining walls of this 2-dimensional surface are formed by the shape parameters α and β approaching the singularities (of the trigamma function) at α, β → 0. It has no walls for α, β → ∞ because in this case the determinant of Fisher's information matrix for the beta distribution approaches zero.

It will be shown in the next section that Jeffreys prior probability results in posterior probabilities (when multiplied by the binomial likelihood function) that are intermediate between the posterior probability results of the Haldane and Bayes prior probabilities.

Jeffreys prior may be difficult to obtain analytically, and for some cases it just doesn't exist (even for simple distribution functions like the asymmetric triangular distribution). Berger, Bernardo and Sun, in a 2009 paper defined a reference prior probability distribution that (unlike Jeffreys prior) exists for the asymmetric triangular distribution. They cannot obtain a closed-form expression for their reference prior, but numerical calculations show it to be nearly perfectly fitted by the (proper) prior

:$\operatorname(\tfrac, \tfrac) \sim\frac$

where θ is the vertex variable for the asymmetric triangular distribution with support , 1(corresponding to the following parameter values in Wikipedia's article on the triangular distribution: vertex ''c'' = ''θ'', left end ''a'' = 0,and right end ''b'' = 1). Berger et al. also give a heuristic argument that Beta(1/2,1/2) could indeed be the exact Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution. Therefore, Beta(1/2,1/2) not only is Jeffreys prior for the Bernoulli and binomial distributions, but also seems to be the Berger–Bernardo–Sun reference prior for the asymmetric triangular distribution (for which the Jeffreys prior does not exist), a distribution used in project management and PERT analysis to describe the cost and duration of project tasks.

Clarke and Barron prove that, among continuous positive priors, Jeffreys prior (when it exists) asymptotically maximizes Shannon's mutual information between a sample of size n and the parameter, and therefore ''Jeffreys prior is the most uninformative prior'' (measuring information as Shannon information). The proof rests on an examination of the Kullback–Leibler divergence between probability density functions for iid random variables.

Effect of different prior probability choices on the posterior beta distribution

If samples are drawn from the population of a random variable ''X'' that result in ''s'' successes and ''f'' failures in "n" Bernoulli trials ''n'' = ''s'' + ''f'', then the likelihood function for parameters ''s'' and ''f'' given ''x'' = ''p'' (the notation ''x'' = ''p'' in the expressions below will emphasize that the domain ''x'' stands for the value of the parameter ''p'' in the binomial distribution), is the following binomial distribution:

:$\mathcal(s,f\mid x=p) = x^s(1-x)^f = x^s(1-x)^.$

If beliefs about prior probability information are reasonably well approximated by a beta distribution with parameters ''α'' Prior and ''β'' Prior, then:

:$(x=p;\alpha \operatorname,\beta \operatorname) = \frac$

According to Bayes' theorem for a continuous event space, the posterior probability is given by the product of the prior probability and the likelihood function (given the evidence ''s'' and ''f'' = ''n'' − ''s''), normalized so that the area under the curve equals one, as follows:

:\begin
& \operatorname(x=p\mid s,n-s) \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac \\ pt= & \frac.
\end

The binomial coefficient

:$$

\frac=\frac

appears both in the numerator and the denominator of the posterior probability, and it does not depend on the integration variable ''x'', hence it cancels out, and it is irrelevant to the final result. Similarly the normalizing factor for the prior probability, the beta function B(αPrior,βPrior) cancels out and it is immaterial to the final result. The same posterior probability result can be obtained if one uses an un-normalized prior

:$x^(1-x)^$

because the normalizing factors all cancel out. Several authors (including Jeffreys himself) thus use an un-normalized prior formula since the normalization constant cancels out. The numerator of the posterior probability ends up being just the (un-normalized) product of the prior probability and the likelihood function, and the denominator is its integral from zero to one. The beta function in the denominator, B(''s'' + ''α'' Prior, ''n'' − ''s'' + ''β'' Prior), appears as a normalization constant to ensure that the total posterior probability integrates to unity.

The ratio ''s''/''n'' of the number of successes to the total number of trials is a sufficient statistic in the binomial case, which is relevant for the following results.

For the Bayes' prior probability (Beta(1,1)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text=\frac,\text=\frac\text 0 < s < n).$

For the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = ,\text = \frac,\text\frac\text \tfrac < s < n-\tfrac).$

and for the Haldane prior probability (Beta(0,0)), the posterior probability is:

:$\operatorname(p=x\mid s,f) = \frac, \text = \frac,\text\frac\text 1 < s < n -1).$

From the above expressions it follows that for ''s''/''n'' = 1/2) all the above three prior probabilities result in the identical location for the posterior probability mean = mode = 1/2. For ''s''/''n'' < 1/2, the mean of the posterior probabilities, using the following priors, are such that: mean for Bayes prior > mean for Jeffreys prior > mean for Haldane prior. For ''s''/''n'' > 1/2 the order of these inequalities is reversed such that the Haldane prior probability results in the largest posterior mean. The ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio ''s''/''n'' of the number of successes to the total number of trials. Therefore, the Haldane prior results in a posterior probability with expected value in the next trial equal to the maximum likelihood. The ''Bayes'' prior probability Beta(1,1) results in a posterior probability density with ''mode'' identical to the ratio ''s''/''n'' (the maximum likelihood).

In the case that 100% of the trials have been successful ''s'' = ''n'', the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value equal to the rule of succession (''n'' + 1)/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of 1 (absolute certainty of success in the next trial). Jeffreys prior probability results in a posterior expected value equal to (''n'' + 1/2)/(''n'' + 1). Perks (p. 303) points out: "This provides a new rule of succession and expresses a 'reasonable' position to take up, namely, that after an unbroken run of n successes we assume a probability for the next trial equivalent to the assumption that we are about half-way through an average run, i.e. that we expect a failure once in (2''n'' + 2) trials. The Bayes–Laplace rule implies that we are about at the end of an average run or that we expect a failure once in (''n'' + 2) trials. The comparison clearly favours the new result (what is now called Jeffreys prior) from the point of view of 'reasonableness'."

Conversely, in the case that 100% of the trials have resulted in failure (''s'' = 0), the ''Bayes'' prior probability Beta(1,1) results in a posterior expected value for success in the next trial equal to 1/(''n'' + 2), while the Haldane prior Beta(0,0) results in a posterior expected value of success in the next trial of 0 (absolute certainty of failure in the next trial). Jeffreys prior probability results in a posterior expected value for success in the next trial equal to (1/2)/(''n'' + 1), which Perks (p. 303) points out: "is a much more reasonably remote result than the Bayes-Laplace result 1/(''n'' + 2)".

Jaynes questions (for the uniform prior Beta(1,1)) the use of these formulas for the cases ''s'' = 0 or ''s'' = ''n'' because the integrals do not converge (Beta(1,1) is an improper prior for ''s'' = 0 or ''s'' = ''n''). In practice, the conditions 0 (p. 303) shows that, for what is now known as the Jeffreys prior, this probability is ((''n'' + 1/2)/(''n'' + 1))((''n'' + 3/2)/(''n'' + 2))...(2''n'' + 1/2)/(2''n'' + 1), which for ''n'' = 1, 2, 3 gives 15/24, 315/480, 9009/13440; rapidly approaching a limiting value of $1/\sqrt = 0.70710678\ldots$ as n tends to infinity. Perks remarks that what is now known as the Jeffreys prior: "is clearly more 'reasonable' than either the Bayes-Laplace result or the result on the (Haldane) alternative rule rejected by Jeffreys which gives certainty as the probability. It clearly provides a very much better correspondence with the process of induction. Whether it is 'absolutely' reasonable for the purpose, i.e. whether it is yet large enough, without the absurdity of reaching unity, is a matter for others to decide. But it must be realized that the result depends on the assumption of complete indifference and absence of knowledge prior to the sampling experiment."

Following are the variances of the posterior distribution obtained with these three prior probability distributions:

for the Bayes' prior probability (Beta(1,1)), the posterior variance is:

:$\text = \frac,\text s=\frac \text =\frac$

for the Jeffreys' prior probability (Beta(1/2,1/2)), the posterior variance is:

: $\text = \frac ,\text s=\frac n 2 \text = \frac 1$

and for the Haldane prior probability (Beta(0,0)), the posterior variance is:

:$\text = \frac, \texts=\frac\text =\frac$

So, as remarked by Silvey, for large ''n'', the variance is small and hence the posterior distribution is highly concentrated, whereas the assumed prior distribution was very diffuse. This is in accord with what one would hope for, as vague prior knowledge is transformed (through Bayes theorem) into a more precise posterior knowledge by an informative experiment. For small ''n'' the Haldane Beta(0,0) prior results in the largest posterior variance while the Bayes Beta(1,1) prior results in the more concentrated posterior. Jeffreys prior Beta(1/2,1/2) results in a posterior variance in between the other two. As ''n'' increases, the variance rapidly decreases so that the posterior variance for all three priors converges to approximately the same value (approaching zero variance as ''n'' → ∞). Recalling the previous result that the ''Haldane'' prior probability Beta(0,0) results in a posterior probability density with ''mean'' (the expected value for the probability of success in the "next" trial) identical to the ratio s/n of the number of successes to the total number of trials, it follows from the above expression that also the ''Haldane'' prior Beta(0,0) results in a posterior with ''variance'' identical to the variance expressed in terms of the max. likelihood estimate s/n and sample size (in ):

:$\text = \frac= \frac$

with the mean ''μ'' = ''s''/''n'' and the sample size ''ν'' = ''n''.

In Bayesian inference, using a prior distribution Beta(''α''Prior,''β''Prior) prior to a binomial distribution is equivalent to adding (''α''Prior − 1) pseudo-observations of "success" and (''β''Prior − 1) pseudo-observations of "failure" to the actual number of successes and failures observed, then estimating the parameter ''p'' of the binomial distribution by the proportion of successes over both real- and pseudo-observations. A uniform prior Beta(1,1) does not add (or subtract) any pseudo-observations since for Beta(1,1) it follows that (''α''Prior − 1) = 0 and (''β''Prior − 1) = 0. The Haldane prior Beta(0,0) subtracts one pseudo observation from each and Jeffreys prior Beta(1/2,1/2) subtracts 1/2 pseudo-observation of success and an equal number of failure. This subtraction has the effect of smoothing out the posterior distribution. If the proportion of successes is not 50% (''s''/''n'' ≠ 1/2) values of ''α''Prior and ''β''Prior less than 1 (and therefore negative (''α''Prior − 1) and (''β''Prior − 1)) favor sparsity, i.e. distributions where the parameter ''p'' is closer to either 0 or 1. In effect, values of ''α''Prior and ''β''Prior between 0 and 1, when operating together, function as a concentration parameter.

The accompanying plots show the posterior probability density functions for sample sizes ''n'' ∈ , successes ''s'' ∈  and Beta(''α''Prior,''β''Prior) ∈ . Also shown are the cases for ''n'' = , success ''s'' =  and Beta(''α''Prior,''β''Prior) ∈ . The first plot shows the symmetric cases, for successes ''s'' ∈ , with mean = mode = 1/2 and the second plot shows the skewed cases ''s'' ∈ . The images show that there is little difference between the priors for the posterior with sample size of 50 (characterized by a more pronounced peak near ''p'' = 1/2). Significant differences appear for very small sample sizes (in particular for the flatter distribution for the degenerate case of sample size = 3). Therefore, the skewed cases, with successes ''s'' = , show a larger effect from the choice of prior, at small sample size, than the symmetric cases. For symmetric distributions, the Bayes prior Beta(1,1) results in the most "peaky" and highest posterior distributions and the Haldane prior Beta(0,0) results in the flattest and lowest peak distribution. The Jeffreys prior Beta(1/2,1/2) lies in between them. For nearly symmetric, not too skewed distributions the effect of the priors is similar. For very small sample size (in this case for a sample size of 3) and skewed distribution (in this example for ''s'' ∈ ) the Haldane prior can result in a reverse-J-shaped distribution with a singularity at the left end. However, this happens only in degenerate cases (in this example ''n'' = 3 and hence ''s'' = 3/4 < 1, a degenerate value because s should be greater than unity in order for the posterior of the Haldane prior to have a mode located between the ends, and because ''s'' = 3/4 is not an integer number, hence it violates the initial assumption of a binomial distribution for the likelihood) and it is not an issue in generic cases of reasonable sample size (such that the condition 1 < ''s'' < ''n'' − 1, necessary for a mode to exist between both ends, is fulfilled).

In Chapter 12 (p. 385) of his book, Jaynes asserts that the ''Haldane prior'' Beta(0,0) describes a ''prior state of knowledge of complete ignorance'', where we are not even sure whether it is physically possible for an experiment to yield either a success or a failure, while the ''Bayes (uniform) prior Beta(1,1) applies if'' one knows that ''both binary outcomes are possible''. Jaynes states: "''interpret the Bayes-Laplace (Beta(1,1)) prior as describing not a state of complete ignorance'', but the state of knowledge in which we have observed one success and one failure...once we have seen at least one success and one failure, then we know that the experiment is a true binary one, in the sense of physical possibility." Jaynes does not specifically discuss Jeffreys prior Beta(1/2,1/2) (Jaynes discussion of "Jeffreys prior" on pp. 181, 423 and on chapter 12 of Jaynes book refers instead to the improper, un-normalized, prior "1/''p'' ''dp''" introduced by Jeffreys in the 1939 edition of his book, seven years before he introduced what is now known as Jeffreys' invariant prior: the square root of the determinant of Fisher's information matrix. ''"1/p" is Jeffreys' (1946) invariant prior for the exponential distribution, not for the Bernoulli or binomial distributions''). However, it follows from the above discussion that Jeffreys Beta(1/2,1/2) prior represents a state of knowledge in between the Haldane Beta(0,0) and Bayes Beta (1,1) prior.

Similarly, Karl Pearson in his 1892 book The Grammar of Science (p. 144 of 1900 edition) maintained that the Bayes (Beta(1,1) uniform prior was not a complete ignorance prior, and that it should be used when prior information justified to "distribute our ignorance equally"". K. Pearson wrote: "Yet the only supposition that we appear to have made is this: that, knowing nothing of nature, routine and anomy (from the Greek ανομία, namely: a- "without", and nomos "law") are to be considered as equally likely to occur. Now we were not really justified in making even this assumption, for it involves a knowledge that we do not possess regarding nature. We use our ''experience'' of the constitution and action of coins in general to assert that heads and tails are equally probable, but we have no right to assert before experience that, as we know nothing of nature, routine and breach are equally probable. In our ignorance we ought to consider before experience that nature may consist of all routines, all anomies (normlessness), or a mixture of the two in any proportion whatever, and that all such are equally probable. Which of these constitutions after experience is the most probable must clearly depend on what that experience has been like."

If there is sufficient Sample (statistics), sampling data, ''and the posterior probability mode is not located at one of the extremes of the domain'' (x=0 or x=1), the three priors of Bayes (Beta(1,1)), Jeffreys (Beta(1/2,1/2)) and Haldane (Beta(0,0)) should yield similar posterior probability, ''posterior'' probability densities. Otherwise, as Gelman et al. (p. 65) point out, "if so few data are available that the choice of noninformative prior distribution makes a difference, one should put relevant information into the prior distribution", or as Berger (p. 125) points out "when different reasonable priors yield substantially different answers, can it be right to state that there ''is'' a single answer? Would it not be better to admit that there is scientific uncertainty, with the conclusion depending on prior beliefs?."

Occurrence and applications

Order statistics

The beta distribution has an important application in the theory of order statistics. A basic result is that the distribution of the ''k''th smallest of a sample of size ''n'' from a continuous Uniform distribution (continuous), uniform distribution has a beta distribution.David, H. A., Nagaraja, H. N. (2003) ''Order Statistics'' (3rd Edition). Wiley, New Jersey pp 458. This result is summarized as:

:$U_ \sim \operatorname(k,n+1-k).$

From this, and application of the theory related to the probability integral transform, the distribution of any individual order statistic from any continuous distribution can be derived.

Subjective logic

In standard logic, propositions are considered to be either true or false. In contradistinction, subjective logic assumes that humans cannot determine with absolute certainty whether a proposition about the real world is absolutely true or false. In subjective logic the A posteriori, posteriori probability estimates of binary events can be represented by beta distributions.A. Jøsang. A Logic for Uncertain Probabilities. ''International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems.'' 9(3), pp.279-311, June 2001
PDF
/ref>

Wavelet analysis

A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. It can typically be visualized as a "brief oscillation" that promptly decays. Wavelets can be used to extract information from many different kinds of data, including – but certainly not limited to – audio signals and images. Thus, wavelets are purposefully crafted to have specific properties that make them useful for signal processing. Wavelets are localized in both time and frequency whereas the standard Fourier transform is only localized in frequency. Therefore, standard Fourier Transforms are only applicable to stationary processes, while wavelets are applicable to non-stationary processes. Continuous wavelets can be constructed based on the beta distribution. Beta waveletsH.M. de Oliveira and G.A.A. Araújo,. Compactly Supported One-cyclic Wavelets Derived from Beta Distributions. ''Journal of Communication and Information Systems.'' vol.20, n.3, pp.27-33, 2005. can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two shape parameters α and β.

Population genetics

The Balding–Nichols model is a two-parameter parametrization of the beta distribution used in population genetics. It is a statistical description of the allele frequencies in the components of a sub-divided population:

:$\begin \alpha &= \mu \nu,\\ \beta &= (1 - \mu) \nu, \end$
where $\nu =\alpha+\beta= \frac$ and $0 < F < 1$; here ''F'' is (Wright's) genetic distance between two populations.

Project management: task cost and schedule modeling

The beta distribution can be used to model events which are constrained to take place within an interval defined by a minimum and maximum value. For this reason, the beta distribution — along with the triangular distribution — is used extensively in PERT, critical path method (CPM), Joint Cost Schedule Modeling (JCSM) and other project management/control systems to describe the time to completion and the cost of a task. In project management, shorthand computations are widely used to estimate the mean and standard deviation of the beta distribution:

:$\begin \mu(X) & = \frac \\ \sigma(X) & = \frac \end$

where ''a'' is the minimum, ''c'' is the maximum, and ''b'' is the most likely value (the mode for ''α'' > 1 and ''β'' > 1).

The above estimate for the mean $\mu(X)= \frac$ is known as the PERT three-point estimation and it is exact for either of the following values of ''β'' (for arbitrary α within these ranges):

:''β'' = ''α'' > 1 (symmetric case) with standard deviation $\sigma(X) = \frac$, skewness = 0, and excess kurtosis = $\frac$

or

:''β'' = 6 − ''α'' for 5 > ''α'' > 1 (skewed case) with standard deviation

:$\sigma(X) = \frac,$

skewness = $\frac$, and excess kurtosis = $\frac - 3$

The above estimate for the standard deviation ''σ''(''X'') = (''c'' − ''a'')/6 is exact for either of the following values of ''α'' and ''β'':

:''α'' = ''β'' = 4 (symmetric) with skewness = 0, and excess kurtosis = −6/11.
:''β'' = 6 − ''α'' and $\alpha = 3 - \sqrt2$ (right-tailed, positive skew) with skewness $=\frac$, and excess kurtosis = 0
:''β'' = 6 − ''α'' and $\alpha = 3 + \sqrt2$ (left-tailed, negative skew) with skewness $= \frac$, and excess kurtosis = 0

Otherwise, these can be poor approximations for beta distributions with other values of α and β, exhibiting average errors of 40% in the mean and 549% in the variance.

Random variate generation

If ''X'' and ''Y'' are independent, with $X \sim \Gamma(\alpha, \theta)$ and $Y \sim \Gamma(\beta, \theta)$ then

:$\frac \sim \Beta(\alpha, \beta).$

So one algorithm for generating beta variates is to generate $\frac$, where ''X'' is a Gamma distribution#Generating gamma-distributed random variables, gamma variate with parameters (α, 1) and ''Y'' is an independent gamma variate with parameters (β, 1). In fact, here $\frac$ and $X+Y$ are independent, and $X+Y \sim \Gamma(\alpha + \beta, \theta)$. If $Z \sim \Gamma(\gamma, \theta)$ and $Z$ is independent of $X$ and $Y$, then $\frac \sim \Beta(\alpha+\beta,\gamma)$ and $\frac$ is independent of $\frac$. This shows that the product of independent $\Beta(\alpha,\beta)$ and $\Beta(\alpha+\beta,\gamma)$ random variables is a $\Beta(\alpha,\beta+\gamma)$ random variable.

Also, the ''k''th order statistic of ''n'' Uniform distribution (continuous), uniformly distributed variates is $\Beta(k, n+1-k)$, so an alternative if α and β are small integers is to generate α + β − 1 uniform variates and choose the α-th smallest.

Another way to generate the Beta distribution is by Pólya urn model. According to this method, one start with an "urn" with α "black" balls and β "white" balls and draw uniformly with replacement. Every trial an additional ball is added according to the color of the last ball which was drawn. Asymptotically, the proportion of black and white balls will be distributed according to the Beta distribution, where each repetition of the experiment will produce a different value.

It is also possible to use the inverse transform sampling.

History

Thomas Bayes, in a posthumous paper published in 1763 by Richard Price, obtained a beta distribution as the density of the probability of success in Bernoulli trials (see ), but the paper does not analyze any of the moments of the beta distribution or discuss any of its properties.

The first systematic modern discussion of the beta distribution is probably due to Karl Pearson. In Pearson's papers the beta distribution is couched as a solution of a differential equation: Pearson distribution, Pearson's Type I distribution which it is essentially identical to except for arbitrary shifting and re-scaling (the beta and Pearson Type I distributions can always be equalized by proper choice of parameters). In fact, in several English books and journal articles in the few decades prior to World War II, it was common to refer to the beta distribution as Pearson's Type I distribution. William Palin Elderton, William P. Elderton in his 1906 monograph "Frequency curves and correlation" further analyzes the beta distribution as Pearson's Type I distribution, including a full discussion of the method of moments for the four parameter case, and diagrams of (what Elderton describes as) U-shaped, J-shaped, twisted J-shaped, "cocked-hat" shapes, horizontal and angled straight-line cases. Elderton wrote "I am chiefly indebted to Professor Pearson, but the indebtedness is of a kind for which it is impossible to offer formal thanks." William Palin Elderton, Elderton in his 1906 monograph provides an impressive amount of information on the beta distribution, including equations for the origin of the distribution chosen to be the mode, as well as for other Pearson distributions: types I through VII. Elderton also included a number of appendixes, including one appendix ("II") on the beta and gamma functions. In later editions, Elderton added equations for the origin of the distribution chosen to be the mean, and analysis of Pearson distributions VIII through XII.

As remarked by Bowman and Shenton "Fisher and Pearson had a difference of opinion in the approach to (parameter) estimation, in particular relating to (Pearson's method of) moments and (Fisher's method of) maximum likelihood in the case of the Beta distribution." Also according to Bowman and Shenton, "the case of a Type I (beta distribution) model being the center of the controversy was pure serendipity. A more difficult model of 4 parameters would have been hard to find." The long running public conflict of Fisher with Karl Pearson can be followed in a number of articles in prestigious journals. For example, concerning the estimation of the four parameters for the beta distribution, and Fisher's criticism of Pearson's method of moments as being arbitrary, see Pearson's article "Method of moments and method of maximum likelihood" (published three years after his retirement from University College, London, where his position had been divided between Fisher and Pearson's son Egon) in which Pearson writes "I read (Koshai's paper in the Journal of the Royal Statistical Society, 1933) which as far as I am aware is the only case at present published of the application of Professor Fisher's method. To my astonishment that method depends on first working out the constants of the frequency curve by the (Pearson) Method of Moments and then superposing on it, by what Fisher terms "the Method of Maximum Likelihood" a further approximation to obtain, what he holds, he will thus get, "more efficient values" of the curve constants."

David and Edwards's treatise on the history of statistics cites the first modern treatment of the beta distribution, in 1911, using the beta designation that has become standard, due to Corrado Gini, an Italian statistician, demography, demographer, and sociology, sociologist, who developed the Gini coefficient. Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz, in their comprehensive and very informative monograph on leading historical personalities in statistical sciences credit Corrado Gini as "an early Bayesian...who dealt with the problem of eliciting the parameters of an initial Beta distribution, by singling out techniques which anticipated the advent of the so-called empirical Bayes approach."

References

External links

"Beta Distribution"
by Fiona Maclachlan, the Wolfram Demonstrations Project, 2007.
Beta Distribution – Overview and Example
xycoon.com

brighton-webs.co.uk

exstrom.com
*
*
Harvard University Statistics 110 Lecture 23 Beta Distribution, Prof. Joe Blitzstein

{{DEFAULTSORT:Beta Distribution
Continuous distributions
Factorial and binomial topics
Conjugate prior distributions
Exponential family distributions]">X - E[X] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or both) ''α'' or ''β'' approaching infinity, the differential entropy approaches its minimum value of negative infinity, and a maximum amount of order. If either ''α'' or ''β'' approaches infinity (and the other is finite) all the probability density is concentrated at an end, and the probability density is zero everywhere else. If both shape parameters are equal (the symmetric case), ''α'' = ''β'', and they approach infinity simultaneously, the probability density becomes a spike (Dirac delta function) concentrated at the middle ''x'' = 1/2, and hence there is 100% probability at the middle ''x'' = 1/2 and zero probability everywhere else.

The (continuous case) information entropy, differential entropy was introduced by Shannon in his original paper (where he named it the "entropy of a continuous distribution"), as the concluding part of the same paper where he defined the information entropy, discrete entropy. It is known since then that the differential entropy may differ from the infinitesimal limit of the discrete entropy by an infinite offset, therefore the differential entropy can be negative (as it is for the beta distribution). What really matters is the relative value of entropy.

Given two beta distributed random variables, ''X''₁ ~ Beta(''α'', ''β'') and ''X''₂ ~ Beta(''α''′, ''β''′), the cross entropy is (measured in nats)

:\begin
H(X_1,X_2) &= \int_0^1 - f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \,dx \\ pt&= \ln \left(\Beta(\alpha',\beta')\right)-(\alpha'-1)\psi(\alpha)-(\beta'-1)\psi(\beta)+(\alpha'+\beta'-2)\psi(\alpha+\beta).
\end

The cross entropy has been used as an error metric to measure the distance between two hypotheses. Its absolute value is minimum when the two distributions are identical. It is the information measure most closely related to the log maximum likelihood (see section on "Parameter estimation. Maximum likelihood estimation")).

The relative entropy, or Kullback–Leibler divergence ''D''_KL(''X''₁ , , ''X''₂), is a measure of the inefficiency of assuming that the distribution is ''X''₂ ~ Beta(''α''′, ''β''′) when the distribution is really ''X''₁ ~ Beta(''α'', ''β''). It is defined as follows (measured in nats).

:\begin
D_(X_1, , X_2) &= \int_0^1 f(x;\alpha,\beta) \ln \left (\frac \right ) \, dx \\ pt&= \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha,\beta)) \,dx \right )- \left (\int_0^1 f(x;\alpha,\beta) \ln (f(x;\alpha',\beta')) \, dx \right )\\ pt&= -h(X_1) + H(X_1,X_2)\\ pt&= \ln\left(\frac\right)+(\alpha-\alpha')\psi(\alpha)+(\beta-\beta')\psi(\beta)+(\alpha'-\alpha+\beta'-\beta)\psi (\alpha + \beta).
\end

The relative entropy, or Kullback–Leibler divergence, is always non-negative. A few numerical examples follow:

*''X''₁ ~ Beta(1, 1) and ''X''₂ ~ Beta(3, 3); ''D''_KL(''X''₁ , , ''X''₂) = 0.598803; ''D''_KL(''X''₂ , , ''X''₁) = 0.267864; ''h''(''X''₁) = 0; ''h''(''X''₂) = −0.267864
*''X''₁ ~ Beta(3, 0.5) and ''X''₂ ~ Beta(0.5, 3); ''D''_KL(''X''₁ , , ''X''₂) = 7.21574; ''D''_KL(''X''₂ , , ''X''₁) = 7.21574; ''h''(''X''₁) = −1.10805; ''h''(''X''₂) = −1.10805.

The Kullback–Leibler divergence is not symmetric ''D''_KL(''X''₁ , , ''X''₂) ≠ ''D''_KL(''X''₂ , , ''X''₁) for the case in which the individual beta distributions Beta(1, 1) and Beta(3, 3) are symmetric, but have different entropies ''h''(''X''₁) ≠ ''h''(''X''₂). The value of the Kullback divergence depends on the direction traveled: whether going from a higher (differential) entropy to a lower (differential) entropy or the other way around. In the numerical example above, the Kullback divergence measures the inefficiency of assuming that the distribution is (bell-shaped) Beta(3, 3), rather than (uniform) Beta(1, 1). The "h" entropy of Beta(1, 1) is higher than the "h" entropy of Beta(3, 3) because the uniform distribution Beta(1, 1) has a maximum amount of disorder. The Kullback divergence is more than two times higher (0.598803 instead of 0.267864) when measured in the direction of decreasing entropy: the direction that assumes that the (uniform) Beta(1, 1) distribution is (bell-shaped) Beta(3, 3) rather than the other way around. In this restricted sense, the Kullback divergence is consistent with the second law of thermodynamics.

The Kullback–Leibler divergence is symmetric ''D''_KL(''X''₁ , , ''X''₂) = ''D''_KL(''X''₂ , , ''X''₁) for the skewed cases Beta(3, 0.5) and Beta(0.5, 3) that have equal differential entropy ''h''(''X''₁) = ''h''(''X''₂).

The symmetry condition:

:$D_(X_1, , X_2) = D_(X_2, , X_1),\texth(X_1) = h(X_2),\text\alpha \neq \beta$

follows from the above definitions and the mirror-symmetry ''f''(''x''; ''α'', ''β'') = ''f''(1−''x''; ''α'', ''β'') enjoyed by the beta distribution.

Relationships between statistical measures

Mean, mode and median relationship

If 1 < α < β then mode ≤ median ≤ mean.Kerman J (2011) "A closed-form approximation for the median of the beta distribution". Expressing the mode (only for α, β > 1), and the mean in terms of α and β:

: $\frac \le \text \le \frac ,$

If 1 < β < α then the order of the inequalities are reversed. For α, β > 1 the absolute distance between the mean and the median is less than 5% of the distance between the maximum and minimum values of ''x''. On the other hand, the absolute distance between the mean and the mode can reach 50% of the distance between the maximum and minimum values of ''x'', for the (Pathological (mathematics), pathological) case of α = 1 and β = 1, for which values the beta distribution approaches the uniform distribution and the information entropy, differential entropy approaches its Maxima and minima, maximum value, and hence maximum "disorder".

For example, for α = 1.0001 and β = 1.00000001:
* mode = 0.9999; PDF(mode) = 1.00010
* mean = 0.500025; PDF(mean) = 1.00003
* median = 0.500035; PDF(median) = 1.00003
* mean − mode = −0.499875
* mean − median = −9.65538 × 10⁻⁶

where PDF stands for the value of the probability density function.

Mean, geometric mean and harmonic mean relationship

It is known from the inequality of arithmetic and geometric means that the geometric mean is lower than the mean. Similarly, the harmonic mean is lower than the geometric mean. The accompanying plot shows that for α = β, both the mean and the median are exactly equal to 1/2, regardless of the value of α = β, and the mode is also equal to 1/2 for α = β > 1, however the geometric and harmonic means are lower than 1/2 and they only approach this value asymptotically as α = β → ∞.

Kurtosis bounded by the square of the skewness

As remarked by William Feller, Feller, in the Pearson distribution, Pearson system the beta probability density appears as Pearson distribution, type I (any difference between the beta distribution and Pearson's type I distribution is only superficial and it makes no difference for the following discussion regarding the relationship between kurtosis and skewness). Karl Pearson showed, in Plate 1 of his paper published in 1916, a graph with the kurtosis as the vertical axis (ordinate) and the square of the skewness as the horizontal axis (abscissa), in which a number of distributions were displayed. The region occupied by the beta distribution is bounded by the following two Line (geometry), lines in the (skewness²,kurtosis) Cartesian coordinate system, plane, or the (skewness²,excess kurtosis) Cartesian coordinate system, plane:

:$(\text)^2+1< \text< \frac (\text)^2 + 3$

or, equivalently,

:$(\text)^2-2< \text< \frac (\text)^2$

At a time when there were no powerful digital computers, Karl Pearson accurately computed further boundaries, for example, separating the "U-shaped" from the "J-shaped" distributions. The lower boundary line (excess kurtosis + 2 − skewness² = 0) is produced by skewed "U-shaped" beta distributions with both values of shape parameters α and β close to zero. The upper boundary line (excess kurtosis − (3/2) skewness² = 0) is produced by extremely skewed distributions with very large values of one of the parameters and very small values of the other parameter. Karl Pearson showed that this upper boundary line (excess kurtosis − (3/2) skewness² = 0) is also the intersection with Pearson's distribution III, which has unlimited support in one direction (towards positive infinity), and can be bell-shaped or J-shaped. His son, Egon Pearson, showed that the region (in the kurtosis/squared-skewness plane) occupied by the beta distribution (equivalently, Pearson's distribution I) as it approaches this boundary (excess kurtosis − (3/2) skewness² = 0) is shared with the noncentral chi-squared distribution. Karl Pearson (Pearson 1895, pp. 357, 360, 373–376) also showed that the gamma distribution is a Pearson type III distribution. Hence this boundary line for Pearson's type III distribution is known as the gamma line. (This can be shown from the fact that the excess kurtosis of the gamma distribution is 6/''k'' and the square of the skewness is 4/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied by the gamma distribution regardless of the value of the parameter "k"). Pearson later noted that the chi-squared distribution is a special case of Pearson's type III and also shares this boundary line (as it is apparent from the fact that for the chi-squared distribution the excess kurtosis is 12/''k'' and the square of the skewness is 8/''k'', hence (excess kurtosis − (3/2) skewness² = 0) is identically satisfied regardless of the value of the parameter "k"). This is to be expected, since the chi-squared distribution ''X'' ~ χ²(''k'') is a special case of the gamma distribution, with parametrization X ~ Γ(k/2, 1/2) where k is a positive integer that specifies the "number of degrees of freedom" of the chi-squared distribution.

An example of a beta distribution near the upper boundary (excess kurtosis − (3/2) skewness² = 0) is given by α = 0.1, β = 1000, for which the ratio (excess kurtosis)/(skewness²) = 1.49835 approaches the upper limit of 1.5 from below. An example of a beta distribution near the lower boundary (excess kurtosis + 2 − skewness² = 0) is given by α= 0.0001, β = 0.1, for which values the expression (excess kurtosis + 2)/(skewness²) = 1.01621 approaches the lower limit of 1 from above. In the infinitesimal limit for both α and β approaching zero symmetrically, the excess kurtosis reaches its minimum value at −2. This minimum value occurs at the point at which the lower boundary line intersects the vertical axis (ordinate). (However, in Pearson's original chart, the ordinate is kurtosis, instead of excess kurtosis, and it increases downwards rather than upwards).

Values for the skewness and excess kurtosis below the lower boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region". The boundary for this "impossible region" is determined by (symmetric or skewed) bimodal "U"-shaped distributions for which the parameters α and β approach zero and hence all the probability density is concentrated at the ends: ''x'' = 0, 1 with practically nothing in between them. Since for α ≈ β ≈ 0 the probability density is concentrated at the two ends ''x'' = 0 and ''x'' = 1, this "impossible boundary" is determined by a Bernoulli distribution, where the two only possible outcomes occur with respective probabilities ''p'' and ''q'' = 1−''p''. For cases approaching this limit boundary with symmetry α = β, skewness ≈ 0, excess kurtosis ≈ −2 (this is the lowest excess kurtosis possible for any distribution), and the probabilities are ''p'' ≈ ''q'' ≈ 1/2. For cases approaching this limit boundary with skewness, excess kurtosis ≈ −2 + skewness², and the probability density is concentrated more at one end than the other end (with practically nothing in between), with probabilities $p = \tfrac$ at the left end ''x'' = 0 and $q = 1-p = \tfrac$ at the right end ''x'' = 1.

Symmetry

All statements are conditional on α, β > 0

* Probability density function Symmetry, reflection symmetry
::$f(x;\alpha,\beta) = f(1-x;\beta,\alpha)$

* Cumulative distribution function Symmetry, reflection symmetry plus unitary Symmetry, translation
::$F(x;\alpha,\beta) = I_x(\alpha,\beta) = 1- F(1- x;\beta,\alpha) = 1 - I_(\beta,\alpha)$

* Mode Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname(\Beta(\alpha, \beta))= 1-\operatorname(\Beta(\beta, \alpha)),\text\Beta(\beta, \alpha)\ne \Beta(1,1)$

* Median Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\operatorname (\Beta(\alpha, \beta) )= 1 - \operatorname (\Beta(\beta, \alpha))$

* Mean Symmetry, reflection symmetry plus unitary Symmetry, translation
::$\mu (\Beta(\alpha, \beta) )= 1 - \mu (\Beta(\beta, \alpha) )$

* Geometric Means each is individually asymmetric, the following symmetry applies between the geometric mean based on ''X'' and the geometric mean based on its reflection (1-X)
::$G_X (\Beta(\alpha, \beta) )=G_(\Beta(\beta, \alpha) )$

* Harmonic means each is individually asymmetric, the following symmetry applies between the harmonic mean based on ''X'' and the harmonic mean based on its reflection (1-X)
::$H_X (\Beta(\alpha, \beta) )=H_(\Beta(\beta, \alpha) ) \text \alpha, \beta > 1$ .

* Variance symmetry
::$\operatorname (\Beta(\alpha, \beta) )=\operatorname (\Beta(\beta, \alpha) )$

* Geometric variances each is individually asymmetric, the following symmetry applies between the log geometric variance based on X and the log geometric variance based on its reflection (1-X)
::$\ln(\operatorname (\Beta(\alpha, \beta))) = \ln(\operatorname(\Beta(\beta, \alpha)))$

* Geometric covariance symmetry
::$\ln \operatorname(\Beta(\alpha, \beta))=\ln \operatorname(\Beta(\beta, \alpha))$

* Mean absolute deviation around the mean symmetry
::\operatorname ] = \frac

The mean absolute deviation around the mean is a more robust estimator of statistical dispersion than the standard deviation for beta distributions with tails and inflection points at each side of the mode, Beta(''α'', ''β'') distributions with ''α'',''β'' > 2, as it depends on the linear (absolute) deviations rather than the square deviations from the mean. Therefore, the effect of very large deviations from the mean are not as overly weighted.

Using Stirling's approximation to the Gamma function, Norman Lloyd Johnson, N.L.Johnson and Samuel Kotz, S.Kotz derived the following approximation for values of the shape parameters greater than unity (the relative error for this approximation is only −3.5% for ''α'' = ''β'' = 1, and it decreases to zero as ''α'' → ∞, ''β'' → ∞):

:$\begin \frac &=\frac\\ &\approx \sqrt \left(1+\frac-\frac-\frac \right), \text \alpha, \beta > 1. \end$

At the limit α → ∞, β → ∞, the ratio of the mean absolute deviation to the standard deviation (for the beta distribution) becomes equal to the ratio of the same measures for the normal distribution: $\sqrt$. For α = β = 1 this ratio equals $\frac$, so that from α = β = 1 to α, β → ∞ the ratio decreases by 8.5%. For α = β = 0 the standard deviation is exactly equal to the mean absolute deviation around the mean. Therefore, this ratio decreases by 15% from α = β = 0 to α = β = 1, and by 25% from α = β = 0 to α, β → ∞ . However, for skewed beta distributions such that α → 0 or β → 0, the ratio of the standard deviation to the mean absolute deviation approaches infinity (although each of them, individually, approaches zero) because the mean absolute deviation approaches zero faster than the standard deviation.

Using the parametrization in terms of mean μ and sample size ν = α + β > 0:

:α = μν, β = (1−μ)ν

one can express the mean absolute deviation around the mean in terms of the mean μ and the sample size ν as follows:

:\operatorname[, X - E ] = \frac

For a symmetric distribution, the mean is at the middle of the distribution, μ = 1/2, and therefore:

: \begin
\operatorname[, X - E ] = \frac &= \frac \\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= \tfrac\\
\lim_ \left (\lim_ \operatorname[, X - E ] \right ) &= 0
\end

Also, the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

: \begin
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ]= 0 \\
\lim_ \operatorname[, X - E ] &=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ]&=\lim_ \operatorname[, X - E ] = 0\\
\lim_ \operatorname[, X - E ] &= \sqrt \\
\lim_ \operatorname[, X - E ] &= 0
\end

Mean absolute difference

The mean absolute difference for the Beta distribution is:

:$\mathrm = \int_0^1 \int_0^1 f(x;\alpha,\beta)\,f(y;\alpha,\beta)\,, x-y, \,dx\,dy = \left(\frac\right)\frac$

The Gini coefficient for the Beta distribution is half of the relative mean absolute difference:

:$\mathrm = \left(\frac\right)\frac$

Skewness

The skewness (the third moment centered on the mean, normalized by the 3/2 power of the variance) of the beta distribution is

:$\gamma_1 =\frac = \frac .$

Letting α = β in the above expression one obtains γ₁ = 0, showing once again that for α = β the distribution is symmetric and hence the skewness is zero. Positive skew (right-tailed) for α < β, negative skew (left-tailed) for α > β.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the skewness in terms of the mean μ and the sample size ν as follows:

:$\gamma_1 =\frac = \frac.$

The skewness can also be expressed just in terms of the variance ''var'' and the mean μ as follows:

:$\gamma_1 =\frac = \frac\text \operatorname < \mu(1-\mu)$

The accompanying plot of skewness as a function of variance and mean shows that maximum variance (1/4) is coupled with zero skewness and the symmetry condition (μ = 1/2), and that maximum skewness (positive or negative infinity) occurs when the mean is located at one end or the other, so that the "mass" of the probability distribution is concentrated at the ends (minimum variance).

The following expression for the square of the skewness, in terms of the sample size ν = α + β and the variance ''var'', is useful for the method of moments estimation of four parameters:

:$(\gamma_1)^2 =\frac = \frac\bigg(\frac-4(1+\nu)\bigg)$

This expression correctly gives a skewness of zero for α = β, since in that case (see ): $\operatorname = \frac$.

For the symmetric case (α = β), skewness = 0 over the whole range, and the following limits apply:

:$\lim_ \gamma_1 = \lim_ \gamma_1 =\lim_ \gamma_1=\lim_ \gamma_1=\lim_ \gamma_1 = 0$

For the asymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_ \gamma_1 =\lim_ \gamma_1 = \infty\\ &\lim_ \gamma_1 = \lim_ \gamma_1= - \infty\\ &\lim_ \gamma_1 = -\frac,\quad \lim_(\lim_ \gamma_1) = -\infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = 0\\ &\lim_ \gamma_1 = \frac,\quad \lim_(\lim_ \gamma_1) = \infty,\quad \lim_(\lim_ \gamma_1) = - \infty \end$

Kurtosis

The beta distribution has been applied in acoustic analysis to assess damage to gears, as the kurtosis of the beta distribution has been reported to be a good indicator of the condition of a gear. Kurtosis has also been used to distinguish the seismic signal generated by a person's footsteps from other signals. As persons or other targets moving on the ground generate continuous signals in the form of seismic waves, one can separate different targets based on the seismic waves they generate. Kurtosis is sensitive to impulsive signals, so it's much more sensitive to the signal generated by human footsteps than other signals generated by vehicles, winds, noise, etc. Unfortunately, the notation for kurtosis has not been standardized. Kenney and Keeping use the symbol γ₂ for the excess kurtosis, but Abramowitz and Stegun use different terminology. To prevent confusion between kurtosis (the fourth moment centered on the mean, normalized by the square of the variance) and excess kurtosis, when using symbols, they will be spelled out as follows:

:$\begin \text &=\text - 3\\ &=\frac-3\\ &=\frac\\ &=\frac . \end$

Letting α = β in the above expression one obtains

:$\text =- \frac \text\alpha=\beta$.

Therefore, for symmetric beta distributions, the excess kurtosis is negative, increasing from a minimum value of −2 at the limit as → 0, and approaching a maximum value of zero as → ∞. The value of −2 is the minimum value of excess kurtosis that any distribution (not just beta distributions, but any distribution of any possible kind) can ever achieve. This minimum value is reached when all the probability density is entirely concentrated at each end ''x'' = 0 and ''x'' = 1, with nothing in between: a 2-point Bernoulli distribution with equal probability 1/2 at each end (a coin toss: see section below "Kurtosis bounded by the square of the skewness" for further discussion). The description of kurtosis as a measure of the "potential outliers" (or "potential rare, extreme values") of the probability distribution, is correct for all distributions including the beta distribution. When rare, extreme values can occur in the beta distribution, the higher its kurtosis; otherwise, the kurtosis is lower. For α ≠ β, skewed beta distributions, the excess kurtosis can reach unlimited positive values (particularly for α → 0 for finite β, or for β → 0 for finite α) because the side away from the mode will produce occasional extreme values. Minimum kurtosis takes place when the mass density is concentrated equally at each end (and therefore the mean is at the center), and there is no probability mass density in between the ends.

Using the parametrization in terms of mean μ and sample size ν = α + β:

:$\begin \alpha & = \mu \nu ,\text\nu =(\alpha + \beta) >0\\ \beta & = (1 - \mu) \nu , \text\nu =(\alpha + \beta) >0. \end$

one can express the excess kurtosis in terms of the mean μ and the sample size ν as follows:

:$\text =\frac\bigg (\frac - 1 \bigg )$

The excess kurtosis can also be expressed in terms of just the following two parameters: the variance ''var'', and the sample size ν as follows:

:$\text =\frac\left(\frac - 6 - 5 \nu \right)\text\text< \mu(1-\mu)$

and, in terms of the variance ''var'' and the mean μ as follows:

:$\text =\frac\text\text< \mu(1-\mu)$

The plot of excess kurtosis as a function of the variance and the mean shows that the minimum value of the excess kurtosis (−2, which is the minimum possible value for excess kurtosis for any distribution) is intimately coupled with the maximum value of variance (1/4) and the symmetry condition: the mean occurring at the midpoint (μ = 1/2). This occurs for the symmetric case of α = β = 0, with zero skewness. At the limit, this is the 2 point Bernoulli distribution with equal probability 1/2 at each Dirac delta function end ''x'' = 0 and ''x'' = 1 and zero probability everywhere else. (A coin toss: one face of the coin being ''x'' = 0 and the other face being ''x'' = 1.) Variance is maximum because the distribution is bimodal with nothing in between the two modes (spikes) at each end. Excess kurtosis is minimum: the probability density "mass" is zero at the mean and it is concentrated at the two peaks at each end. Excess kurtosis reaches the minimum possible value (for any distribution) when the probability density function has two spikes at each end: it is bi-"peaky" with nothing in between them.

On the other hand, the plot shows that for extreme skewed cases, where the mean is located near one or the other end (μ = 0 or μ = 1), the variance is close to zero, and the excess kurtosis rapidly approaches infinity when the mean of the distribution approaches either end.

Alternatively, the excess kurtosis can also be expressed in terms of just the following two parameters: the square of the skewness, and the sample size ν as follows:

:$\text =\frac\bigg(\frac (\text)^2 - 1\bigg)\text^2-2< \text< \frac (\text)^2$

From this last expression, one can obtain the same limits published practically a century ago by Karl Pearson in his paper, for the beta distribution (see section below titled "Kurtosis bounded by the square of the skewness"). Setting α + β= ν = 0 in the above expression, one obtains Pearson's lower boundary (values for the skewness and excess kurtosis below the boundary (excess kurtosis + 2 − skewness² = 0) cannot occur for any distribution, and hence Karl Pearson appropriately called the region below this boundary the "impossible region"). The limit of α + β = ν → ∞ determines Pearson's upper boundary.

:$\begin &\lim_\text = (\text)^2 - 2\\ &\lim_\text = \tfrac (\text)^2 \end$

therefore:

:$(\text)^2-2< \text< \tfrac (\text)^2$

Values of ν = α + β such that ν ranges from zero to infinity, 0 < ν < ∞, span the whole region of the beta distribution in the plane of excess kurtosis versus squared skewness.

For the symmetric case (α = β), the following limits apply:

:$\begin &\lim_ \text = - 2 \\ &\lim_ \text = 0 \\ &\lim_ \text = - \frac \end$

For the unsymmetric cases (α ≠ β) the following limits (with only the noted variable approaching the limit) can be obtained from the above expressions:

:$\begin &\lim_\text =\lim_ \text = \lim_\text = \lim_\text =\infty\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_\text = \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = 0\\ &\lim_ \text = - 6 + \frac,\text \lim_(\lim_ \text) = \infty,\text \lim_(\lim_ \text) = \infty \end$

Characteristic function

The Characteristic function (probability theory), characteristic function is the Fourier transform of the probability density function. The characteristic function of the beta distribution is confluent hypergeometric function, Kummer's confluent hypergeometric function (of the first kind):
:$\begin \varphi_X(\alpha;\beta;t) &= \operatorname\left[e^\right]\\ &= \int_0^1 e^ f(x;\alpha,\beta) dx \\ &=_1F_1(\alpha; \alpha+\beta; it)\!\\ &=\sum_^\infty \frac \\ &= 1 +\sum_^ \left( \prod_^ \frac \right) \frac \end$

where

: $x^=x(x+1)(x+2)\cdots(x+n-1)$

is the rising factorial, also called the "Pochhammer symbol". The value of the characteristic function for ''t'' = 0, is one:

:$\varphi_X(\alpha;\beta;0)=_1F_1(\alpha; \alpha+\beta; 0) = 1$.

Also, the real and imaginary parts of the characteristic function enjoy the following symmetries with respect to the origin of variable ''t'':

:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$
:$\textrm \left [ _1F_1(\alpha; \alpha+\beta; it) \right ] = - \textrm \left [ _1F_1(\alpha; \alpha+\beta; - it) \right ]$

The symmetric case α = β simplifies the characteristic function of the beta distribution to a Bessel function, since in the special case α + β = 2α the confluent hypergeometric function (of the first kind) reduces to a Bessel function (the modified Bessel function of the first kind $I_$ ) using Ernst Kummer, Kummer's second transformation as follows:

Another example of the symmetric case α = β = n/2 for beamforming applications can be found in Figure 11 of

:$\begin _1F_1(\alpha;2\alpha; it) &= e^ _0F_1 \left(; \alpha+\tfrac; \frac \right) \\ &= e^ \left(\frac\right)^ \Gamma\left(\alpha+\tfrac\right) I_\left(\frac\right).\end$

In the accompanying plots, the Complex number, real part (Re) of the Characteristic function (probability theory), characteristic function of the beta distribution is displayed for symmetric (α = β) and skewed (α ≠ β) cases.

Other moments

Moment generating function

It also follows that the moment generating function is

:\begin
M_X(\alpha; \beta; t)
&= \operatorname\left[e^\right] \\ pt&= \int_0^1 e^ f(x;\alpha,\beta)\,dx \\ pt&= _1F_1(\alpha; \alpha+\beta; t) \\ pt&= \sum_^\infty \frac \frac \\ pt&= 1 +\sum_^ \left( \prod_^ \frac \right) \frac
\end

In particular ''M''_''X''(''α''; ''β''; 0) = 1.

Higher moments

Using the moment generating function, the ''k''-th raw moment is given by the factor

:$\prod_^ \frac$

multiplying the (exponential series) term $\left(\frac\right)$ in the series of the moment generating function

:$\operatorname[X^k]= \frac = \prod_^ \frac$

where (''x'')^(''k'') is a Pochhammer symbol representing rising factorial. It can also be written in a recursive form as

:$\operatorname[X^k] = \frac\operatorname[X^].$

Since the moment generating function $M_X(\alpha; \beta; \cdot)$ has a positive radius of convergence, the beta distribution is Moment problem, determined by its moments.

Moments of transformed random variables

=Moments of linearly transformed, product and inverted random variables

=
One can also show the following expectations for a transformed random variable, where the random variable ''X'' is Beta-distributed with parameters α and β: ''X'' ~ Beta(α, β). The expected value of the variable 1 − ''X'' is the mirror-symmetry of the expected value based on ''X'':

:$\begin & \operatorname[1-X] = \frac \\ & \operatorname[X (1-X)] =\operatorname[(1-X)X ] =\frac \end$

Due to the mirror-symmetry of the probability density function of the beta distribution, the variances based on variables ''X'' and 1 − ''X'' are identical, and the covariance on ''X''(1 − ''X'' is the negative of the variance:

:$\operatorname[(1-X)]=\operatorname[X] = -\operatorname[X,(1-X)]= \frac$

These are the expected values for inverted variables, (these are related to the harmonic means, see ):

:$\begin & \operatorname \left [\frac \right ] = \frac \text \alpha > 1\\ & \operatorname\left [\frac \right ] =\frac \text \beta > 1 \end$

The following transformation by dividing the variable ''X'' by its mirror-image ''X''/(1 − ''X'') results in the expected value of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\begin & \operatorname\left[\frac\right] =\frac \text\beta > 1\\ & \operatorname\left[\frac\right] =\frac\text\alpha > 1 \end$

Variances of these transformed variables can be obtained by integration, as the expected values of the second moments centered on the corresponding variables:

:$\operatorname \left[\frac \right] =\operatorname\left[\left(\frac - \operatorname\left[\frac \right ] \right )^2\right]=$
:$\operatorname\left [\frac \right ] =\operatorname \left [\left (\frac - \operatorname\left [\frac \right ] \right )^2 \right ]= \frac \text\alpha > 2$

The following variance of the variable ''X'' divided by its mirror-image (''X''/(1−''X'') results in the variance of the "inverted beta distribution" or beta prime distribution (also known as beta distribution of the second kind or Pearson distribution, Pearson's Type VI):

:$\operatorname \left [\frac \right ] =\operatorname \left [\left(\frac - \operatorname \left [\frac \right ] \right)^2 \right ]=\operatorname \left [\frac \right ] =$
:$\operatorname \left [\left (\frac - \operatorname \left [\frac \right ] \right )^2 \right ]= \frac \text\beta > 2$

The covariances are:

:$\operatorname\left [\frac,\frac \right ] = \operatorname\left[\frac,\frac \right] =\operatorname\left[\frac,\frac\right ] = \operatorname\left[\frac,\frac \right] =\frac \text \alpha, \beta > 1$

These expectations and variances appear in the four-parameter Fisher information matrix (.)

=Moments of logarithmically transformed random variables

=

Expected values for Logarithm transformation, logarithmic transformations (useful for maximum likelihood estimates, see ) are discussed in this section. The following logarithmic linear transformations are related to the geometric means ''G_X'' and ''G''_(1−''X'') (see ):

:$\begin \operatorname[\ln(X)] &= \psi(\alpha) - \psi(\alpha + \beta)= - \operatorname\left[\ln \left (\frac \right )\right],\\ \operatorname[\ln(1-X)] &=\psi(\beta) - \psi(\alpha + \beta)= - \operatorname \left[\ln \left (\frac \right )\right]. \end$

Where the digamma function ψ(α) is defined as the logarithmic derivative of the gamma function:

:$\psi(\alpha) = \frac$

Logit transformations are interesting, as they usually transform various shapes (including J-shapes) into (usually skewed) bell-shaped densities over the logit variable, and they may remove the end singularities over the original variable:

:$\begin \operatorname\left[\ln \left (\frac \right ) \right] &=\psi(\alpha) - \psi(\beta)= \operatorname[\ln(X)] +\operatorname \left[\ln \left (\frac \right) \right],\\ \operatorname\left [\ln \left (\frac \right ) \right ] &=\psi(\beta) - \psi(\alpha)= - \operatorname \left[\ln \left (\frac \right) \right] . \end$

Johnson considered the distribution of the logit - transformed variable ln(''X''/1−''X''), including its moment generating function and approximations for large values of the shape parameters. This transformation extends the finite support , 1based on the original variable ''X'' to infinite support in both directions of the real line (−∞, +∞).

Higher order logarithmic moments can be derived by using the representation of a beta distribution as a proportion of two Gamma distributions and differentiating through the integral. They can be expressed in terms of higher order poly-gamma functions as follows:

:$\begin \operatorname \left [\ln^2(X) \right ] &= (\psi(\alpha) - \psi(\alpha + \beta))^2+\psi_1(\alpha)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln^2(1-X) \right ] &= (\psi(\beta) - \psi(\alpha + \beta))^2+\psi_1(\beta)-\psi_1(\alpha+\beta), \\ \operatorname \left [\ln (X)\ln(1-X) \right ] &=(\psi(\alpha) - \psi(\alpha + \beta))(\psi(\beta) - \psi(\alpha + \beta)) -\psi_1(\alpha+\beta). \end$

therefore the variance of the logarithmic variables and covariance of ln(''X'') and ln(1−''X'') are:

:\begin
\operatorname[\ln(X), \ln(1-X)] &= \operatorname\left[\ln(X)\ln(1-X)\right] - \operatorname[\ln(X)]\operatorname[\ln(1-X)] = -\psi_1(\alpha+\beta) \\
& \\
\operatorname[\ln X] &= \operatorname[\ln^2(X)] - (\operatorname[\ln(X)])^2 \\
&= \psi_1(\alpha) - \psi_1(\alpha + \beta) \\
&= \psi_1(\alpha) + \operatorname[\ln(X), \ln(1-X)] \\
& \\
\operatorname ln (1-X)&= \operatorname[\ln^2 (1-X)] - (\operatorname[\ln (1-X)])^2 \\
&= \psi_1(\beta) - \psi_1(\alpha + \beta) \\
&= \psi_1(\beta) + \operatorname[\ln (X), \ln(1-X)]
\end

where the trigamma function, denoted ψ₁(α), is the second of the polygamma functions, and is defined as the derivative of the digamma function:

:$\psi_1(\alpha) = \frac= \frac$.

The variances and covariance of the logarithmically transformed variables ''X'' and (1−''X'') are different, in general, because the logarithmic transformation destroys the mirror-symmetry of the original variables ''X'' and (1−''X''), as the logarithm approaches negative infinity for the variable approaching zero.

These logarithmic variances and covariance are the elements of the Fisher information matrix for the beta distribution. They are also a measure of the curvature of the log likelihood function (see section on Maximum likelihood estimation).

The variances of the log inverse variables are identical to the variances of the log variables:

:\begin
\operatorname\left[\ln \left (\frac \right ) \right] & =\operatorname[\ln(X)] = \psi_1(\alpha) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right ) \right] &=\operatorname ln (1-X)= \psi_1(\beta) - \psi_1(\alpha + \beta), \\
\operatorname\left[\ln \left (\frac \right), \ln \left (\frac\right ) \right] &=\operatorname[\ln(X),\ln(1-X)]= -\psi_1(\alpha + \beta).\end

It also follows that the variances of the logit transformed variables are:

:$\operatorname\left[\ln \left (\frac \right )\right]=\operatorname\left[\ln \left (\frac \right ) \right]=-\operatorname\left [\ln \left (\frac \right ), \ln \left (\frac \right ) \right]= \psi_1(\alpha) + \psi_1(\beta)$

Quantities of information (entropy)

Given a beta distributed random variable, ''X'' ~ Beta(''α'', ''β''), the information entropy, differential entropy of ''X'' is (measured in Nat (unit), nats), the expected value of the negative of the logarithm of the probability density function:

:\begin
h(X) &= \operatorname[-\ln(f(x;\alpha,\beta))] \\ pt&=\int_0^1 -f(x;\alpha,\beta)\ln(f(x;\alpha,\beta)) \, dx \\ pt&= \ln(\Beta(\alpha,\beta))-(\alpha-1)\psi(\alpha)-(\beta-1)\psi(\beta)+(\alpha+\beta-2) \psi(\alpha+\beta)
\end

where ''f''(''x''; ''α'', ''β'') is the probability density function of the beta distribution:

:$f(x;\alpha,\beta) = \frac x^(1-x)^$

The digamma function ''ψ'' appears in the formula for the differential entropy as a consequence of Euler's integral formula for the harmonic numbers which follows from the integral:

:$\int_0^1 \frac \, dx = \psi(\alpha)-\psi(1)$

The information entropy, differential entropy of the beta distribution is negative for all values of ''α'' and ''β'' greater than zero, except at ''α'' = ''β'' = 1 (for which values the beta distribution is the same as the Uniform distribution (continuous), uniform distribution), where the information entropy, differential entropy reaches its Maxima and minima, maximum value of zero. It is to be expected that the maximum entropy should take place when the beta distribution becomes equal to the uniform distribution, since uncertainty is maximal when all possible events are equiprobable.

For ''α'' or ''β'' approaching zero, the information entropy, differential entropy approaches its Maxima and minima, minimum value of negative infinity. For (either or both) ''α'' or ''β'' approaching zero, there is a maximum amount of order: all the probability density is concentrated at the ends, and there is zero probability density at points located between the ends. Similarly for (either or