Continuous Random Variables Use Densities, Not Point Masses

Entry gate: complete CAL1–CAL6 in Calculus Foundations. In particular, be able to normalize a density and evaluate definite and improper integrals before using the formulas below.

What This Concept Is

Here "continuous" means an absolutely continuous distribution with a density. Not every distribution on real numbers has a density; mixed distributions and singular continuous distributions need more general treatment.

For a continuous random variable, probability is distributed across intervals rather than concentrated at isolated points. The object that describes this distribution is the probability density function ( f(x) ), and probabilities come from area under the curve: [ P(a \le X \le b) = \int_a^b f(x), dx. ] In stark contrast to the discrete case, ( P(X = c) = 0 ) for any single point ( c ). Probability "lives" on intervals, not on points.

A valid density satisfies two requirements:

• ( f(x) \ge 0 ) everywhere, and
• ( \int_{-\infty}^{\infty} f(x), dx = 1 ).

Crucially, ( f(x) ) is not a probability. It is a probability per unit length. Its units are reciprocal to the units of ( X ). A density value can exceed 1 -- for example, the uniform distribution on ([0, 0.1]) has ( f(x) = 10 ) on that interval. What has to stay bounded is the integral, not the height.

The cumulative distribution function (CDF) ( F(x) = P(X \le x) ) unifies discrete and continuous: it always exists, is always monotone non-decreasing, and goes from 0 to 1. In the continuous case, ( F ) is differentiable almost everywhere and ( F'(x) = f(x) ). Flipping this around, ( f ) is the rate at which probability accumulates along the axis.

Intuitively: a PMF is a bar graph of probability mass. A PDF is a smooth curve, and only the area under segments of the curve has probabilistic meaning. If you could "zoom in" on a continuous variable to an exact point, you would find nothing -- all the probability has slipped through to adjacent infinitesimal intervals.

Why It Matters Here

This is the conceptual shift that prevents major mistakes later. Four specific errors:

• Reading density height as probability. A density value of 2.0 does not mean "twice as likely as density 1.0" -- it means "twice the concentration of probability per unit length." Comparing heights is valid only for relative likelihood within one distribution.
• Thinking interval endpoints matter. ( P(a \le X \le b) = P(a < X < b) ) for continuous ( X ); inclusion of endpoints changes nothing because each endpoint has measure zero.
• Mixing discrete and continuous intuition. You cannot ask "what is the probability that latency is exactly 47.3 ms" -- that probability is zero. You can only ask about ranges: ( P(47.0 \le X \le 48.0) ), or equivalently ( F(48.0) - F(47.0) ).
• Thinking a density must be bounded by 1. No -- only the integral is bounded.

Continuous models are essential for timing, measurement noise, load, latency, and Normal-approximation arguments. Whenever a quantity is "real-valued on a smooth scale" -- request latency, CPU utilization percentage, disk temperature, network throughput -- a density model may be useful. Rounding, censoring, timeouts, and point masses can require a discrete or mixed model instead.

Concrete Examples

Example 1 -- Uniform on ([0, 10]). The density is ( f(x) = 1/10 ) for ( 0 \le x \le 10 ) and 0 elsewhere. Then: [ P(2 \le X \le 5) = \int_2^5 \tfrac{1}{10}, dx = \tfrac{3}{10}. ] But ( P(X = 2) = \int_2^2 \tfrac{1}{10}, dx = 0 ), even though ( x = 2 ) is in the support. A point has no width, so it contributes no area. Note the density ( f(x) = 1/10 ) is less than 1, but that is coincidence; if the uniform were on ([0, 0.1]), we would have ( f(x) = 10 ), well above 1, yet still valid.

Example 2 -- Service latency as a triangular density. Suppose service latency (ms) has density [ f(x) = \begin{cases} x/10000 & 0 \le x \le 100, \ (200 - x)/10000 & 100 \le x \le 200, \ 0 & \text{otherwise}. \end{cases} ] Check normalization: the triangle has base 200 ms and height .01 per ms, so its area is 1. A denominator of 5000 would give area 2 and would not define a density. The probability below 100 ms is (\int_0^{100}x/10000,dx=.5). Above x=100, the survival probability is ((200-x)^2/20000). Setting it to .01 gives p99 equal to (200-\sqrt{200}\approx185.86) ms.

Common Confusion / Misconceptions

"The density ( f(x) ) is the probability at ( x )." No -- ( f(x) ) is probability per unit length; only areas under ( f ) are probabilities.

"A density cannot exceed 1." A density can be arbitrarily large at a point; what must be finite is the integral over all space.

"Endpoint inclusion matters." For continuous variables, ( P(a \le X \le b) = P(a < X < b) = P(a < X \le b) = P(a \le X < b) ). Endpoints are measure-zero events.

"Probability of exactly ( c ) is nonzero but very small." For a truly continuous model, it is exactly zero, not small. If you need a positive probability at a point, you are implicitly assuming a discrete or mixed distribution.

"All real-world quantities are continuous." Real-world quantities like latency are quantized by clocks and floating-point representation. The continuous model is an approximation that is almost always excellent but is not literally true.

How To Use It

For continuous variables:

1. Identify the support interval -- where is ( f(x) > 0 )?
2. Write the density on that support and verify it is non-negative and integrates to 1.
3. Integrate over the interval of interest to compute a probability.
4. Interpret probability through area, not point values. Think "probability in that band," not "probability at that spot."
5. Use the CDF as a universal tool. If integration is messy, express the probability as ( F(b) - F(a) ) and look up or numerically compute ( F ).
6. Convert between discrete and continuous carefully. If modeling latency with bin width 1 ms, a 1 ms bin probability is approximately density per ms times 1 ms when the density changes little across the bin; it is not universally 0.001. To express a density per second instead, multiply the per-ms density by 1000. Units matter.
7. When comparing endpoints conventions like ( (a, b] ) vs ( [a, b] ), remember that point endpoints do not matter for continuous variables. For the CDF convention, always use ( F(b) - F(a) ) with ( F(x) = P(X \le x) ).

Transfer / Where This Shows Up Later

• Semester 2 (Randomized algorithms). Continuous random variables model random real numbers returned by uniform samplers; in particular, the analysis of randomized geometry, Monte Carlo integration, and random-priority data structures (treaps) rests on continuous probability.
• Semester 5 (Queueing). Queueing models can use continuous or discrete time; M/M/1 specifically assumes exponential interarrival and service times (see Cluster 5, concept 14). Little's Law connects time averages of continuous random variables to mean queue length.
• Semester 6 (Tail latency). Latency distributions are continuous (up to quantization); p99, p99.9, p99.99 percentiles are CDF inverse values. Understanding density shape -- in particular, heavy right tails -- is the core of distributed-systems tail at scale.
• Semester 8 (SLOs and percentiles). SLO definitions like "p99 < 300 ms" are conditions on the CDF of the latency random variable, not on any single request. Expressing them rigorously requires the continuous-density mindset.
• Semester 9 (Experimentation and monitoring). Continuous test statistics (t-statistics, CUSUM statistics) are continuous random variables; confidence intervals and hypothesis-test regions are integrals under their densities.

Check Yourself

1. Why is ( P(X = c) = 0 ) for a continuous variable?
2. Why can a density value exceed 1? Give an example.
3. What geometric object corresponds to probability in the continuous case?
4. If ( X ) is continuous, is ( P(a \le X \le b) ) the same as ( P(a < X < b) )? Why?
5. A density ( f(x) = kx ) on ([0, 2]) and 0 elsewhere. What must ( k ) equal? Then compute ( P(X \le 1) ). (Answers: ( k = 1/2 ); ( P(X \le 1) = 1/4 ).)
6. If ( X ) has CDF ( F(x) = 1 - e^{-x} ) for ( x \ge 0 ), what is the density? What is ( P(1 \le X \le 2) )?

Mini Drill or Application

Suppose ( X ) is uniform on ([0, 4]).

1. Write the density.
2. Compute ( P(1 \le X \le 3) ).
3. Compute ( P(X = 2) ).
4. Explain why ( P(1 < X < 3) ) is the same as ( P(1 \le X \le 3) ).
5. Write the CDF of ( X ). At what ( x ) does ( F(x) = 0.75 )?

Simulation drill -- density histograms vs. PDFs. Use numpy to draw 100,000 samples from a standard Normal. Plot a histogram with 50 bins and overlay the Normal PDF. Verify visually that the histogram scaled to unit area matches the density -- this is how the abstract "density" becomes concrete. Then compute sample fraction in ([-1, 1]); it should be near ( \Phi(1) - \Phi(-1) \approx 0.683 ). Now double the bin count; observe that bin heights shrink but the area stays the same. This is exactly the point of "density, not mass."

Read This Only If Stuck

In Introduction to Probability, find densities, normalization, CDFs, and quantiles using the book contents or search. Generated chunk boundaries do not always match textbook sections; this link deliberately opens the book index.

Use the module reading guide to choose a specific reinforcement task, then solve a changed example without the text. For alternate proof explanations, consult the probability portion of Mathematics for Computer Science.