官术网_书友最值得收藏!

Sampling with or without replacement

Let's now assume that there is a total of n items in the bucket and we must pick r of them. Then, let = {1, 2,…, r} be the list of items picked and let = {1, 2, …, n} be the total number of items. This can be written as a function, as follows:

Here, f(i) is the ith item.

Sampling with replacement is when we pick an item at random and then put it back so that the item can be picked again. 

However, sampling without replacement refers to when we choose an item and don't put it back, so we cannot pick it again. Let's see an example of both.

Say we need to open the door to our office and we have a bag containing n keys; they all look identical, so there's no way of differentiating between them. 

The first time we try picking a key, we replace each one after trying it, and we manage to find the correct key on the rth trial, implying we got it wrong r-1 times. The probability is then as follows:

Now, we know that our earlier strategy wasn't the smartest, so this time we try it again but without replacement and eliminate each key that doesn't work. Now, the probability is as follows:

主站蜘蛛池模板: 景泰县| 阳朔县| 肥东县| 塔河县| 甘泉县| 广东省| 天台县| 定边县| 兴仁县| 阜康市| 徐州市| 锦屏县| 金塔县| 泰和县| 舞阳县| 清原| 东乡县| 余庆县| 巍山| 阿拉善盟| 长丰县| 鹿邑县| 洪雅县| 石屏县| 鹤壁市| 岳池县| 普宁市| 开江县| 枣阳市| 云霄县| 逊克县| 三明市| 浙江省| 铁力市| 韩城市| 天全县| 柳河县| 赫章县| 义乌市| 盘锦市| 福清市|