liveBook · Manning

Support

As explained in Fabulous Adventures in Data Structures and Algorithms

The support of a probability distribution is the set of values that can occur with positive probability.

The support of a probability distribution is the set of outcomes that can occur. For a discrete distribution, it may be finite—such as 1 through 6 for a die—or infinite, such as the positive integers. A probability mass function assigns a probability to each member of the support; sampling returns one of those outcomes according to those probabilities. section 12.2

Support provides the domain that distribution operations work over:

  • Uniform sampling uses the support 0 through n−1; Random.Next(6) therefore samples six possible integers. section 12.3
  • A discrete distribution can enumerate its support, sample from it, and report each outcome’s weight. section 12.4
  • Projecting outcomes can merge several input values into one output, so the projected support may be smaller while its weights are summed. section 12.7
  • An empty distribution has no support: every outcome is impossible and every weight is zero. section 14.2

A colored die

Map a six-sided fair die to [green, blue, red, blue, red, blue]. The input support has six values, but the output support is {green, blue, red}; grouping inputs gives weights 1, 3, and 2. section 12.7

var rnd = new Random();
int roll = rnd.Next(6);

A minimal C# example makes the support of a uniform distribution visible: Random.Next(6) can return exactly the integers 0 through 5. section 12.3

How Fabulous Adventures in Data Structures and Algorithms covers it

How deep it goes
Explains finite and infinite discrete supports, then applies enumeration, projection, aggregation, and empty-support handling in C#.
Examples
Uses dice, coins, colored marbles, Random.Next(6), projected colors, and an empty distribution as concrete cases.
What you can do after
Evaluate/understand which outcomes a discrete distribution permits and how projections or filters change that outcome set.
How it connects
Connects support to probability mass functions, sampling, discrete distributions, weights, projections, and categorical distributions.

Also explained in

Compare how 2 books explain support →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Fabulous Adventures in Data Structures and Algorithms. The section links point to the parts of the book it draws on.