liveBook · Manning

Sampling without replacement

As explained in Timeless Algorithms, The Foundational Ideas

Sampling without replacement is a sampling procedure in which each selected item is not returned to the sample space before the next trial.

Sampling without replacement leaves each selected item out of the sample space. Because each draw changes what remains, later probabilities depend on earlier outcomes. section 2.3.4

Drawing cards

After drawing an ace and not returning it, the chance of drawing a king next is 4 out of 51, not 4 out of 52. The first draw changes the probability of the second. section 2.3.4

P(A∩B)=P(A)    × P(B | A)

For dependent draws, multiply the probability of the first event by the conditional probability of the second. section 2.3.4

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines changing sample spaces and dependence, then illustrates conditional probability with a card draw.
Examples
Uses an ace followed by a king drawn from a deck without returning the first card.
What you can do after
Evaluate whether successive events are dependent and apply the corresponding multiplication rule.
How it connects
Connects sampling to dependent events, conditional probability, and the multiplication rule.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.