This post is on two classes of discrete distributions called the (a,b,0) class and (a,b,1) class. This post is a follow-up on two previous posts – summarizing the two posts and giving more examples. The (a,b,0) class is discussed in details in this post in a companion blog. The (a,b,1) class is discussed in details in this post in a companion blog.
The (a,b,0) Class
A counting distribution is a discrete probability distribution that takes on the non-negative integers (0, 1, 2, …). Counting distributions are useful when we want to model occurrences of a certain random events. The three commonly used counting distributions would be the Poisson distribution, the binomial distribution and the negative binomial distribution. All three counting distributions can be generated recursively. For these three distributions, the ratio of any two consecutive probabilities can be expressed as a linear quantity.
To make the last point in the preceding paragraph clear, let’s set some notations. For any integer , let be the probability that the counting distribution in question takes on the value . For example, if we are considering the counting random variable , then . Let’s look at the situation where the ratio of any two consecutive values of can be expressed as a linear expression for some constants and .
Any counting distribution that satisfies the recursive relation (1) is said to be a member of the (a,b,0) class of distributions. Note that the recursion starts at . Does that mean can be any probability value we assign? The value of is fixed because all the must sum to 1.
The three counting distribution mentioned above – Poisson, binomial and negative binomial – are all members of the (a,b,0) class. In fact the (a,b,0) class essentially has three distributions. In other words, any member of (a,b,0) class must be one of the three distributions – Poisson, binomial and negative binomial.
An (a,b,0) distribution has its usual parameters, e.g. Poisson has a parameter , which is its mean. So we need to way to translate the usual parameters to and from the parameters and . This is shown in the table below.
|Distribution||Usual Parameters||Probability at Zero||Parameter a||Parameter b|
Table 1 provides the mapping to translate between the usual parameters and the recursive parameters and .
Let and . Let the initial probability be . Generate the first 4 probabilities according to the recursion formula (1)
Note that the sum of to is 1. So this has to be a binomial distribution and not Poisson or negative binomial. The binomial parameters are and . According to Table 1, this translate to and . The initial probability is .
This example generates several probabilities recursively for the negative binomial distribution with and . According to Table 1, this translates to and . The following shows the probabilities up to .
The above probabilities can also be computed using the probability function given below.
For the (a,b,0) class, it is not just about calculating probabilities recursively. The parameters and also give information about other distributional quantities such as moments and variance. For a more detailed discussion of the (a,b,0) class, refer to this post in a companion blog.
The (a,b,1) Class
If the (a,b,0) class is just another name for the three distributions of Poisson, binomial and negative binomial, what is the point of (a,b,0) class? Why not just work with these three distributions individually? Sure, generating the probabilities recursively is a useful concept. The probability functions of the three distributions already give us a clear and precise way to calculate probabilities. The notion of (a,b,0) class leads to the notion of (a,b,1) class, which gives a great deal more flexibility in the modeling counting distributions. It is possible that the (a,b,0) distributions do not adequately describe a random counting phenomenon being observed. For example, the sample data may indicate that the probability at zero may be larger than is indicated by the distributions in the (a,b,0) class. One alternative is to assign a larger value for and recursively generate the subsequent probabilities for . This recursive relation is the defining characteristics of the (a,b,1) class.
A counting distribution is a member of the (a,b,1) class of distributions if the following recursive relation holds for some constants and .
Note that the recursion begins at . Can the values for and be arbitrary? The initial probability is an assumed value. The probability is the value such that the sum is .
The (a,b,1) class gives more flexibility in modeling. For example, the initial probability is in the negative binomial distribution in Example 2. If this is felt to be too small, then a larger value for can be assigned and then let the remaining probabilities be generated by recursion. We demonstrate how this is done using the same (a,b,0) distribution in Example 2.
Before we continue with Example 2, we comment that there are two subclasses in the (a,b,1) class. The subclasses are distinguished by whether or . The (a,b,1) distributions are called zero-truncated distributions in the first case and are called zero-modified distributions in the second case.
Because there are three related distributions, we need to establish notations to keep track of the different distributions. We use the notations established in this post. The notation refers to the probabilities for an (a,b,0) distribution. From this (a,b,0) distribution, we can derive a zero-truncated distribution whose probabilities are notated by . From this zero-truncated distribution, we can derive a zero-modified distribution whose probabilities are denoted by . For example, for the negative binomial distribution in Example 2, we derive a zero-truncated negative binomial distribution (Example 3) and from it we derive a zero-modified negative binomial distribution (Example 4).
In Example 3, we calculated the (a,b,0) probabilities up to . We now calculate the probabilities for the corresponding zero-truncated negative binomial distribution. For a zero-truncated distribution, the value of zero is not recorded. So is simply divided by .
The sum of , , must be 1 since is a probability distribution. The (a,b,0) is . Then , which means . The following shows the zero-truncated probabilities.
The above are the first 6 probabilities of the zero-truncated negative binomial distribution with and or with the usual parameters and . The above can also be calculated recursively by using (2). Just calculate P_1^T$ and the rest of the probabilities can be generated using the recursion relation (2).
From the zero-truncated negative binomial distribution in Example 3, we generate a zero-modified negative binomial distribution. If the original is considered too small,e.g. not big enough to account for the probability of zero claims, then we can assign a larger value to the zero probability. Let’s say 0.10 is more appropriate. So we set . Then the rest of the must sum to , or 0.9 in this example. The following shows how the zero-modified probabilities are related to the zero-truncated probabilities.
The following gives the probabilities for the zero-modified negative binomial distribution.
The same probabilities can also be obtained by using the original (a,b,0) probabilities directly as follows:
Examples 2, 3 and 4 show, starting with with an (a,b,0) distribution, how to derive a zero-truncated distribution and from it a zero-modified distribution. In these examples, we start with a negative binomial distribution and the derived distributions are zero-truncated negative binomial distribution and zero-modified negative binomial distribution. If the starting distribution is a Poisson distribution, then the same process would produce a zero-truncated Poisson distribution and a zero-modified Poisson distribution (with a particular assumed value of ).
There are members of the (a,b,1) class that do not originate from a member of the (a,b,0) class. Three such distributions are discussed in this post on the (a,b,1) class. We give an example discussing one of them.
This example demonstrates how to work with the extended truncated negative binomial distribution (ETNB). The usual negative binomial distribution has two parameters and in one version ( and in another version). Both parameters are positive real numbers. To define an ETNB distribution, we relax the parameter to include the possibility of in addition to . Of course if , then we just have the usual negative binomial distribution. So we focus on the new situation of .
Let’s say and . We take these two parameters and generate the “negative binomial” probabilities, from which we generate the zero-truncated probabilities as shown in Example 3. Now the parameters and do not belong to a legitimate negative binomial distribution. In fact the resulting are negative values. So this “negative binomial” distribution is just a device to get things going.
According to Table 1, and translate to and . We generate the “negative binomial” probabilities using the recursive relation (1). Don’t be alarmed that the probabilities are negative.
The initial is greater than 1 and the other so called probabilities are negative. But they are just a device to get the ETNB probabilities. Using the formula stated in (3) gives the following zero-truncated ETNB probabilities.
The above gives the first 5 probabilities of the zero-truncated ETNB distribution with parameters and . It is an (a,b,1) distribution that does not originate from any (legitimate) (a,b,0) distribution.
The next post is a practice problem set on the (a,b,1) class.
actuarial practice problems
Daniel Ma actuarial
Dan Ma actuarial
Dan Ma actuarial science
Daniel Ma actuarial science
Daniel Ma Math
Daniel Ma Mathematics