# Connexions

You are here: Home » Content » Distribution and Density Functions

## Navigation

### Lenses

What is a lens?

#### Definition of a lens

##### Lenses

A lens is a custom view of the content in the repository. You can think of it as a fancy kind of list that will let you see content through the eyes of organizations and people you trust.

##### What is in a lens?

Lens makers point to materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

##### Who can create a lens?

Any individual member, a community, or a respected organization.

##### What are tags?

Tags are descriptors added by lens makers to help label content, attaching a vocabulary that is meaningful in the context of the lens.

#### Affiliated with (What does "Affiliated with" mean?)

This content is either by members of the organizations listed or about topics related to the organizations listed. Click each link to see a list of all content affiliated with the organization.
• Rice Digital Scholarship

This module is included in aLens by: Digital Scholarship at Rice UniversityAs a part of collection: "Applied Probability"

Click the "Rice Digital Scholarship" link to see all content affiliated with them.

#### Also in these lenses

• UniqU content

This module is included inLens: UniqU's lens
By: UniqU, LLCAs a part of collection: "Applied Probability"

Click the "UniqU content" link to see all content selected in this lens.

### Recently Viewed

This feature requires Javascript to be enabled.

# Distribution and Density Functions

Module by: Paul E Pfeiffer. E-mail the author

Summary: In the unit on Random Variables and Probability, we introduce real random variables as mappings from the basic space to the real line. The mapping induces a transfer of the probability mass on the basic space to subsets of the real line in such a way that the probability that X takes a value in a set M is exactly the mass assigned to that set by the transfer. To perform probability calculations, we need to describe analytically the distribution on the line. For simple random variables, we have at each possible value of X a point mass equal to the probability X takes that value. For more general cases, we need a more useful description: the distribution function which at each t has the value of the probability mass at or to the left of t. If the probability mass in the induced distribution is spread smoothly along the real line, with no point mass concentrations, there is a probability density function such that the probability mass in any interval is the area under the curve over that interval.

## Introduction

In the unit on Random Variables and Probability we introduce real random variables as mappings from the basic space Ω to the real line. The mapping induces a transfer of the probability mass on the basic space to subsets of the real line in such a way that the probability that X takes a value in a set M is exactly the mass assigned to that set by the transfer. To perform probability calculations, we need to describe analytically the distribution on the line. For simple random variables this is easy. We have at each possible value of X a point mass equal to the probability X takes that value. For more general cases, we need a more useful description than that provided by the induced probability measure PX.

## The distribution function

In the theoretical discussion on Random Variables and Probability, we note that the probability distribution induced by a random variable X is determined uniquely by a consistent assignment of mass to semi-infinite intervals of the form (-,t](-,t] for each real t. This suggests that a natural description is provided by the following.

Definition

The distribution function FX for random variable X is given by

F X ( t ) = P ( X t ) = P ( X ( - , t ] ) t R F X ( t ) = P ( X t ) = P ( X ( - , t ] ) t R
(1)

In terms of the mass distribution on the line, this is the probability mass at or to the left of the point t. As a consequence, FX has the following properties:

• (F1) : FX must be a nondecreasing function, for if t>st>s there must be at least as much probability mass at or to the left of t as there is for s.
• (F2) : FX is continuous from the right, with a jump in the amount p0 at t0 iff P(X=t0)=p0P(X=t0)=p0. If the point t approaches t0 from the left, the interval does not include the probability mass at t0 until t reaches that value, at which point the amount at or to the left of t increases ("jumps") by amount p0; on the other hand, if t approaches t0 from the right, the interval includes the mass p0 all the way to and including t0, but drops immediately as t moves to the left of t0.
• (F3) : Except in very unusual cases involving random variables which may take “infinite” values, the probability mass included in (-,t](-,t] must increase to one as t moves to the right; as t moves to the left, the probability mass included must decrease to zero, so that
FX(-)=limt-FX(t)=0andFX()=limtFX(t)=1FX(-)=limt-FX(t)=0andFX()=limtFX(t)=1
(2)

A distribution function determines the probability mass in each semiinfinite interval (-,t](-,t]. According to the discussion referred to above, this determines uniquely the induced distribution.

The distribution function FX for a simple random variable is easily visualized. The distribution consists of point mass pi at each point ti in the range. To the left of the smallest value in the range, FX(t)=0FX(t)=0; as t increases to the smallest value t1, FX(t)FX(t) remains constant at zero until it jumps by the amount p1.. FX(t)FX(t) remains constant at p1 until t increases to t2, where it jumps by an amount p2 to the value p1+p2p1+p2. This continues until the value of FX(t)FX(t)reaches 1 at the largest value tn. The graph of FX is thus a step function, continuous from the right, with a jump in the amount pi at the corresponding point ti in the range. A similar situation exists for a discrete-valued random variable which may take on an infinity of values (e.g., the geometric distribution or the Poisson distribution considered below). In this case, there is always some probability at points to the right of any ti, but this must become vanishingly small as t increases, since the total probability mass is one.

The procedure ddbn may be used to plot the distributon function for a simple random variable from a matrix X of values and a corresponding matrix PXPX of probabilities.

### Example 1: Graph of FX for a simple random variable

>> c = [10 18 10 3];             % Distribution for X in Example 6.5.1
>> pm = minprob(0.1*[6 3 5]);
>> canonic
Enter row vector of coefficients  c
Enter row vector of minterm probabilities  pm
Use row matrices X and PX for calculations
Call for XDBN to view the distribution
>> ddbn                          % Circles show values at jumps
Enter row matrix of VALUES  X
Enter row matrix of PROBABILITIES  PX
%  Printing details   See Figure 1


## Description of some common discrete distributions

We make repeated use of a number of common distributions which are used in many practical situations. This collection includes several distributions which are studied in the chapter "Random Variables and Probabilities".

1. Indicator function. X=IEX=IE P(X=1)=P(E)=p P(X=1)=P(E)=pP(X=0)=q=1-pP(X=0)=q=1-p. The distribution function has a jump in the amount q at t=0t=0 and an additional jump of p to the value 1 at t=1t=1.
2. Simple random variable X=i=1ntiIAiX=i=1ntiIAi (canonical form)
P(X=ti)=P(Ai)=p1P(X=ti)=P(Ai)=p1
(3)
The distribution function is a step function, continuous from the right, with jump of pi at t=tit=ti (See Figure 1 for Example 1)
3. Binomial (n,p)(n,p). This random variable appears as the number of successes in a sequence of n Bernoulli trials with probability p of success. In its simplest form
X=i=1nIEiwith{Ei:1in}independentX=i=1nIEiwith{Ei:1in}independent
(4)
P(Ei)=pP(X=k)=C(n,k)pkqn-kP(Ei)=pP(X=k)=C(n,k)pkqn-k
(5)
As pointed out in the study of Bernoulli sequences in the unit on Composite Trials, two m-functions ibinom andcbinom are available for computing the individual and cumulative binomial probabilities.
4. Geometric (p)(p) There are two related distributions, both arising in the study of continuing Bernoulli sequences. The first counts the number of failures before the first success. This is sometimes called the “waiting time.” The event {X=k}{X=k} consists of a sequence of k failures, then a success. Thus
P(X=k)=qkp,0kP(X=k)=qkp,0k
(6)
The second designates the component trial on which the first success occurs. The event {Y=k}{Y=k} consists of k-1k-1 failures, then a success on the kth component trial. We have
P(Y=k)=qk-1p,1kP(Y=k)=qk-1p,1k
(7)
We say X has the geometric distribution with parameter (p)(p), which we often designate by XX geometric (p)(p). Now Y=X+1Y=X+1 or Y-1=XY-1=X. For this reason, it is customary to refer to the distribution for the number of the trial for the first success by saying Y-1Y-1 geometric (p)(p). The probability of k or more failures before the first success is P(Xk)=qkP(Xk)=qk. Also
P(Xn+k|Xn)=P(Xn+k)P(Xn)=qn+k/qn=qk=P(Xk)P(Xn+k|Xn)=P(Xn+k)P(Xn)=qn+k/qn=qk=P(Xk)
(8)
This suggests that a Bernoulli sequence essentially "starts over" on each trial. If it has failed n times, the probability of failing an additional k or more times before the next success is the same as the initial probability of failing k or more times before the first success.

### Example 2: The geometric distribution

A statistician is taking a random sample from a population in which two percent of the members own a BMW automobile. She takes a sample of size 100. What is the probability of finding no BMW owners in the sample?

#### SOLUTION

The sampling process may be viewed as a sequence of Bernoulli trials with probability p=0.02p=0.02 of success. The probability of 100 or more failures before the first success is 0.98100=0.13260.98100=0.1326 or about 1/7.5.

5. Negative binomial (m,p)(m,p). X is the number of failures before the mth success. It is generally more convenient to work with Y=X+mY=X+m, the number of the trial on which the mth success occurs. An examination of the possible patterns and elementary combinatorics show that
P(Y=k)=C(k-1,m-1)pmqk-m,mkP(Y=k)=C(k-1,m-1)pmqk-m,mk
(9)
There are m-1m-1 successes in the first k-1k-1 trials, then a success. Each combination has probability pmqk-mpmqk-m. We have an m-function nbinom to calculate these probabilities.

### Example 3: A game of chance

A player throws a single six-sided die repeatedly. He scores if he throws a 1 or a 6. What is the probability he scores five times in ten or fewer throws?

>> p = sum(nbinom(5,1/3,5:10))
p  =  0.2131


An alternate solution is possible with the use of the binomial distribution. The mth success comes not later than the kth trial iff the number of successes in k trials is greater than or equal to m.

>> P = cbinom(10,1/3,5)
P  =  0.2131

6. Poisson (μ)(μ). This distribution is assumed in a wide variety of applications. It appears as a counting variable for items arriving with exponential interarrival times (see the relationship to the gamma distribution below). For large n and small p (which may not be a value found in a table), the binomial distribution is approximately Poisson (np)(np). Use of the generating function (see Transform Methods) shows the sum of independent Poisson random variables is Poisson. The Poisson distribution is integer valued, with
P(X=k)=e-μμkk!0kP(X=k)=e-μμkk!0k
(10)
Although Poisson probabilities are usually easier to calculate with scientific calculators than binomial probabilities, the use of tables is often quite helpful. As in the case of the binomial distribution, we have two m-functions for calculating Poisson probabilities. These have advantages of speed and parameter range similar to those for ibinom and cbinom.
• P(X=k)P(X=k) is calculated by P = ipoisson(mu,k), where k is a row or column vector of integers and the result P is a row matrix of the probabilities.
• P(Xk)P(Xk) is calculated by P = cpoisson(mu,k), where k is a row or column vector of integers and the result P is a row matrix of the probabilities.

### Example 4: Poisson counting random variable

The number of messages arriving in a one minute period at a communications network junction is a random variable NN Poisson (130). What is the probability the number of arrivals is greater than equal to 110, 120, 130, 140, 150, 160 ?

>> p = cpoisson(130,110:10:160)
p  =  0.9666  0.8209  0.5117  0.2011  0.0461  0.0060


The descriptions of these distributions, along with a number of other facts, are summarized in the table DATA ON SOME COMMON DISTRIBUTIONS in Appendix C.

## The density function

If the probability mass in the induced distribution is spread smoothly along the real line, with no point mass concentrations, there is a probability density function f X f X which satisfies

P ( X M ) = P X ( M ) = M f X ( t ) d t (area under the graph of f X over M ) P ( X M ) = P X ( M ) = M f X ( t ) d t (area under the graph of f X over M )
(11)

At each t, fX(t)fX(t) is the mass per unit length in the probability distribution. The density function has three characteristic properties:

(f1) f X 0 (f2) R f X = 1 (f3) F X ( t ) = - t f X (f1) f X 0 (f2) R f X = 1 (f3) F X ( t ) = - t f X
(12)

A random variable (or distribution) which has a density is called absolutely continuous. This term comes from measure theory. We often simply abbreviate as continuous distribution.

### Remarks

1. There is a technical mathematical description of the condition “spread smoothly with no point mass concentrations.” And strictly speaking the integrals are Lebesgue integrals rather than the ordinary Riemann kind. But for practical cases, the two agree, so that we are free to use ordinary integration techniques.
2. By the fundamental theorem of calculus
fX(t)=FX'(t)ateverypointofcontinuityoffXfX(t)=FX'(t)ateverypointofcontinuityoffX
(13)
3. Any integrable, nonnegative function ff with f=1f=1 determines a distribution function F F, which in turn determines a probability distribution. If f1f1, multiplication by the appropriate positive constant gives a suitable f f. An argument based on the Quantile Function shows the existence of a random variable with that distribution.
4. In the literature on probability, it is customary to omit the indication of the region of integration when integrating over the whole line. Thus
g(t)fX(t)dt=Rg(t)fX(t)dtg(t)fX(t)dt=Rg(t)fX(t)dt
(14)
The first expression is not an indefinite integral. In many situations, f X f X will be zero outside an interval. Thus, the integrand effectively determines the region of integration.

## Some common absolutely continuous distributions

1. Uniform (a,b)(a,b).
Mass is spread uniformly on the interval [a,b][a,b]. It is immaterial whether or not the end points are included, since probability associated with each individual point is zero. The probability of any subinterval is proportional to the length of the subinterval. The probability of being in any two subintervals of the same length is the same. This distribution is used to model situations in which it is known that X takes on values in [a,b][a,b] but is equally likely to be in any subinterval of a given length. The density must be constant over the interval (zero outside), and the distribution function increases linearly with t in the interval. Thus,
fX(t)=1b-aa<t<b(zerooutsidetheinterval)fX(t)=1b-aa<t<b(zerooutsidetheinterval)
(15)
The graph of FX rises linearly, with slope 1/(b-a)1/(b-a) from zero at t=at=a to one at t=bt=b.
2. Symmetric triangular (-a,a)(-a,a). fX(t)=(a+t)/a2-at<0(a-t)/a20tafX(t)=(a+t)/a2-at<0(a-t)/a20ta
This distribution is used frequently in instructional numerical examples because probabilities can be obtained geometrically. It can be shifted, with a shift of the graph, to different sets of values. It appears naturally (in shifted form) as the distribution for the sum or difference of two independent random variables uniformly distributed on intervals of the same length. This fact is established with the use of the moment generating function (see Transform Methods). More generally, the density may have a triangular graph which is not symmetric.

### Example 5: Use of a triangular distribution

Suppose XX symmetric triangular (100,300)(100,300). Determine P(120<X250)P(120<X250).

Remark. Note that in the continuous case, it is immaterial whether the end point of the intervals are included or not.

#### SOLUTION

To get the area under the triangle between 120 and 250, we take one minus the area of the right triangles between 100 and 120 and between 250 and 300. Using the fact that areas of similar triangles are proportional to the square of any side, we have

P = 1 - 1 2 ( ( 20 / 100 ) 2 + ( 50 / 100 ) 2 ) = 0 . 855 P = 1 - 1 2 ( ( 20 / 100 ) 2 + ( 50 / 100 ) 2 ) = 0 . 855
(16)
3. Exponential ( λ)( λ) fX(t)=λe-λtt0fX(t)=λe-λtt0 (zero elsewhere).
Integration shows FX(t)=1-e-λtt0FX(t)=1-e-λtt0 (zero elsewhere). We note that P(X>t)=1-FX(t)=e-λtt0P(X>t)=1-FX(t)=e-λtt0. This leads to an extremely important property of the exponential distribution. Since X>t+h,h>0X>t+h,h>0 implies X>tX>t, we have
P(X>t+h|X>t)=P(X>t+h)/P(X>t)=e-λ(t+h)/e-λt=e-λh=P(X>h)P(X>t+h|X>t)=P(X>t+h)/P(X>t)=e-λ(t+h)/e-λt=e-λh=P(X>h)
(17)
Because of this property, the exponential distribution is often used in reliability problems. Suppose X represents the time to failure (i.e., the life duration) of a device put into service at t=0t=0. If the distribution is exponential, this property says that if the device survives to time t (i.e., X>tX>t) then the (conditional) probability it will survive h more units of time is the same as the original probability of surviving for h units of time. Many devices have the property that they do not wear out. Failure is due to some stress of external origin. Many solid state electronic devices behave essentially in this way, once initial “burn in” tests have removed defective units. Use of Cauchy's equation (Appendix B) shows that the exponential distribution is the only continuous distribution with this property.
4. Gamma distribution (α,λ)(α,λ) fX(t)=λαtα-1e-λtΓ(α)t0fX(t)=λαtα-1e-λtΓ(α)t0 (zero elsewhere)
We have an m-function gammadbn to determine values of the distribution function for XX gamma (α,λ)(α,λ). Use of moment generating functions shows that for α=nα=n, a random variable XX gamma (n,λ)(n,λ) has the same distribution as the sum of n independent random variables, each exponential (λ)(λ). A relation to the Poisson distribution is described in Sec 7.5.

### Example 6: An arrival problem

On a Saturday night, the times (in hours) between arrivals in a hospital emergency unit may be represented by a random quantity which is exponential (λ=3)(λ=3). As we show in the chapter Mathematical Expectation, this means that the average interarrival time is 1/3 hour or 20 minutes. What is the probability of ten or more arrivals in four hours? In six hours?

#### SOLUTION

The time for ten arrivals is the sum of ten interarrival times. If we suppose these are independent, as is usually the case, then the time for ten arrivals is gamma (10,3)(10,3).

>> p = gammadbn(10,3,[4 6])
p  =  0.7576    0.9846

5. Normal, or Gaussian (μ,σ2)(μ,σ2)fX(t)=1σ2πexp-12t-μσ2tfX(t)=1σ2πexp-12t-μσ2t
We generally indicate that a random variable X has the normal or gaussian distribution by writing XN(μ,σ2)XN(μ,σ2), putting in the actual values for the parameters. The gaussian distribution plays a central role in many aspects of applied probability theory, particularly in the area of statistics. Much of its importance comes from the central limit theorem (CLT), which is a term applied to a number of theorems in analysis. Essentially, the CLT shows that the distribution for the sum of a sufficiently large number of independent random variables has approximately the gaussian distribution. Thus, the gaussian distribution appears naturally in such topics as theory of errors or theory of noise, where the quantity observed is an additive combination of a large number of essentially independent quantities. Examination of the expression shows that the graph for fX(t)fX(t) is symmetric about its maximum at t=μt=μ. The greater the parameter σ2, the smaller the maximum value and the more slowly the curve decreases with distance from μ. Thus parameter μ locates the center of the mass distribution and σ2 is a measure of the spread of mass about μ. The parameter μ is called the mean value and σ2 is the variance. The parameter σ, the positive square root of the variance, is called the standard deviation. While we have an explicit formula for the density function, it is known that the distribution function, as the integral of the density function, cannot be expressed in terms of elementary functions. The usual procedure is to use tables obtained by numerical integration.
Since there are two parameters, this raises the question whether a separate table is needed for each pair of parameters. It is a remarkable fact that this is not the case. We need only have a table of the distribution function for XN(0,1)XN(0,1). This is refered to as the standardized normal distribution. We use φ and Φ for the standardized normal density and distribution functions, respectively.
Standardized normalφ(t)=12πe-t2/2φ(t)=12πe-t2/2 so that the distribution function is Φ(t)=-tφ(u)duΦ(t)=-tφ(u)du.
The graph of the density function is the well known bell shaped curve, symmetrical about the origin (see Figure 4). The symmetry about the origin contributes to its usefulness.
P(Xt)=Φ(t)=areaunderthecurvetotheleftoftP(Xt)=Φ(t)=areaunderthecurvetotheleftoft
(18)

Note that the area to the left of t=-1.5t=-1.5 is the same as the area to the right of t=1.5t=1.5, so that Φ(-2)=1-Φ(2)Φ(-2)=1-Φ(2). The same is true for any t, so that we have
Φ(-t)=1-Φ(t)tΦ(-t)=1-Φ(t)t
(19)

This indicates that we need only a table of values of Φ(t)Φ(t) for t>0t>0 to be able to determine Φ(t)Φ(t) for any t. We may use the symmetry for any case. Note that Φ(0)=1/2Φ(0)=1/2,

### Example 7: Standardized normal calculations

Suppose XN(0,1)XN(0,1). Determine P(-1X2)P(-1X2) and P(|X|>1)P(|X|>1).

#### SOLUTION

1. P(-1X2)=Φ(2)-Φ(-1)=Φ(2)-[1-Φ(1)]=Φ(2)+Φ(1)-1P(-1X2)=Φ(2)-Φ(-1)=Φ(2)-[1-Φ(1)]=Φ(2)+Φ(1)-1

2. P(|X|>1)=P(X>1)+P(X<-1)=1-Φ(1)+Φ(-1)=2[1-Φ(1)]P(|X|>1)=P(X>1)+P(X<-1)=1-Φ(1)+Φ(-1)=2[1-Φ(1)]

From a table of standardized normal distribution function (see Appendix D), we find

Φ(2)=0.9772Φ(2)=0.9772 and Φ(1)=0.8413Φ(1)=0.8413 which gives P(-1X2)=0.8185P(-1X2)=0.8185 and P(|X|>1)=0.3174P(|X|>1)=0.3174

General gaussian distribution
For XN(μ,σ2)XN(μ,σ2), the density maintains the bell shape, but is shifted with different spread and height. Figure 5 shows the distribution function and density function for XN(2,0.1)XN(2,0.1). The density is centered about t=2t=2. It has height 1.2616 as compared with 0.3989 for the standardized normal density. Inspection shows that the graph is narrower than that for the standardized normal. The distribution function reaches 0.5 at the mean value 2.

A change of variables in the integral shows that the table for standardized normal distribution function can be used for any case.

F X ( t ) = 1 σ 2 π - t exp - 1 2 x - μ σ 2 d x = - t φ x - μ σ 1 σ d x F X ( t ) = 1 σ 2 π - t exp - 1 2 x - μ σ 2 d x = - t φ x - μ σ 1 σ d x
(20)

Make the change of variable and corresponding formal changes

u = x - μ σ d u = 1 σ d x x = t u = t - μ σ u = x - μ σ d u = 1 σ d x x = t u = t - μ σ
(21)

to get

F X ( t ) = - ( t - μ ) / σ φ ( u ) d u = Φ t - μ σ F X ( t ) = - ( t - μ ) / σ φ ( u ) d u = Φ t - μ σ
(22)

### Example 8: General gaussian calculation

Suppose XN(3,16)XN(3,16) (i.e., μ=3μ=3 and σ2=16σ2=16). Determine P(-1X11)P(-1X11) and P(|X-3|>4)P(|X-3|>4).

SOLUTION

1. FX(11)-FX(-1)=Φ11-34-Φ-1-34=Φ(2)-Φ(-1)=0.8185FX(11)-FX(-1)=Φ11-34-Φ-1-34=Φ(2)-Φ(-1)=0.8185
2. P(X-3<-4)+P(X-3>4)=FX(-1)+[1-FX(7)]=Φ(-1)+1-Φ(1)=0.3174P(X-3<-4)+P(X-3>4)=FX(-1)+[1-FX(7)]=Φ(-1)+1-Φ(1)=0.3174

In each case the problem reduces to that in Example 7

We have m-functions gaussian and gaussdensity to calculate values of the distribution and density function for any reasonable value of the parameters.
The following are solutions of Example 7 and Example 8, using the m-function gaussian.

### Example 9: Example 7 and Example 8 (continued)

>> P1 = gaussian(0,1,2) - gaussian(0,1,-1)
P1 =  0.8186
>> P2 = 2*(1 - gaussian(0,1,1))
P2 =  0.3173
>> P1 = gaussian(3,16,11) - gaussian(3,16,-1)
P2 =  0.8186
>> P2 = gaussian(3,16,-1)) + 1 - (gaussian(3,16,7)
P2 =  0.3173


The differences in these results and those above (which used tables) are due to the roundoff to four places in the tables.

6. Beta(r,s),r>0,s>0(r,s),r>0,s>0. fX(t)=Γ(r+s)Γ(r)Γ(s)tr-1(1-t)s-10<t<1fX(t)=Γ(r+s)Γ(r)Γ(s)tr-1(1-t)s-10<t<1
Analysis is based on the integrals
01ur-1(1-u)s-1du=Γ(r)Γ(s)Γ(r+s)withΓ(t+1)=tΓ(t)01ur-1(1-u)s-1du=Γ(r)Γ(s)Γ(r+s)withΓ(t+1)=tΓ(t)
(23)
Figure 6 and Figure 7 show graphs of the densities for various values of r,sr,s. The usefulness comes in approximating densities on the unit interval. By using scaling and shifting, these can be extended to other intervals. The special case r=s=1r=s=1 gives the uniform distribution on the unit interval. The Beta distribution is quite useful in developing the Bayesian statistics for the problem of sampling to determine a population proportion. If r,s r,s are integers, the density function is a polynomial. For the general case we have two m-functions, beta and betadbn to perform the calculatons.
7. Weibull(α,λ,ν)FX(t)=1-e-λ(t-ν)αα>0,λ>0,ν0,tν(α,λ,ν)FX(t)=1-e-λ(t-ν)αα>0,λ>0,ν0,tν
The parameter ν is a shift parameter. Usually we assume ν=0ν=0. Examination shows that for α=1α=1 the distribution is exponential (λ)(λ). The parameter α provides a distortion of the time scale for the exponential distribution. Figure 6 and Figure 7 show graphs of the Weibull density for some representative values of α and λ (ν=0ν=0). The distribution is used in reliability theory. We do not make much use of it. However, we have m-functions weibull (density) and weibulld (distribution function) for shift parameter ν=0ν=0 only. The shift can be obtained by subtracting a constant from the t values.

## Content actions

PDF | EPUB (?)

### What is an EPUB file?

EPUB is an electronic book format that can be read on a variety of mobile devices.

### Downloading to a reading device

For detailed instructions on how to download this content's EPUB to your specific device, click the "(?)" link.

| More downloads ...

### Add module to:

My Favorites (?)

'My Favorites' is a special kind of lens which you can use to bookmark modules and collections. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need an account to use 'My Favorites'.

| A lens I own (?)

#### Definition of a lens

##### Lenses

A lens is a custom view of the content in the repository. You can think of it as a fancy kind of list that will let you see content through the eyes of organizations and people you trust.

##### What is in a lens?

Lens makers point to materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

##### Who can create a lens?

Any individual member, a community, or a respected organization.

##### What are tags?

Tags are descriptors added by lens makers to help label content, attaching a vocabulary that is meaningful in the context of the lens.

| External bookmarks