The concept of the minimum of random variables is instrumental in various probability and statistical contexts. Here, we focus on how the minimum of independent exponential random variables behaves.
Taking the minimum, such as \(Z = \min(X_1, X_2)\), involves finding the smallest value among the given random variables. Since \(X_1\) and \(X_2\) are independent and identically distributed as Exponential(\(\lambda\)), \(Z\) will also follow an exponential distribution but with a new rate parameter.
To determine \(Z\)'s distribution, we use the CDF approach, which calculates \(F_{Z}(z) = 1 - (1 - F_{X_1}(z))(1 - F_{X_2}(z)) = 1 - e^{-2\lambda z}\). This result indicates that the minimum of two Exponential(\(\lambda\)) random variables is an Exponential(\(2\lambda\)) random variable.
Generalizing further, if we're finding the minimum of \(n\) independent \(X_i\)'s, each \(X_i\) distributed as Exponential(\(\lambda\)), \(Z\) follows Exponential(\(n\lambda\)).
- **Minimum Calculation**: The CDF for \(Z\) becomes \(1 - e^{-n\lambda z}\), illustrating how the rate parameter scales with the number of variables.
This property is particularly useful in applications such as survival analysis, queues, and reliability engineering.