|
一开始我一直顺着原文的叙述试图理解概率为何为1/(k+1), 很困惑。谢谢数值分析坛友的提醒,终于想明白了。下面试着用同一思路但不同的语言叙述一下,作为总结。
2 o* s# L8 \$ x3 Z1 X. C( Z+ k* [( w; V) c' n% p* M4 g! w
Let S be the set of the n elements in which there are k and only k elements that have value x. For each element w, let I be the indicator if w is examined or not, that is, I(w) = 1 if w is examined and 0 if w is not examined. X, the number of elements being examined, will be the sum of I(w) for all w in S. Accordingly, E[X] will be the sum of E[I(w)]=P{I(w)=1}. 0 H4 V1 P7 c1 {5 N. k) f& G2 c
4 B0 \0 e2 N( X
For w that has a value x, the chance of w being examined is the chance that w is at the first position of a permutation of k x-valued elements. Therefore it's 1/k.
) I. X8 D# |% y6 \& Z8 K I
' e2 y& n, T- s" F4 k- @4 wFor w that has a value not being x, the chance of x being examined is the chance that w is at the first position of a permutation of all k x-valued elements plus w. Therefore it's 1/(k+1).1 h4 ^8 k% D/ k6 `( }1 ]. Y
+ K9 _7 _( a6 [- B$ y) UThere are k elements that have value x and n-k elements that are not equal to x, so the sum of all these probabilities will be k*(1/k) + (n-k)*(1/(k+1)) = (n+1)/(k+1). @( x! L8 P' j% K9 ]6 H
5 r2 Z# O) S$ d0 D, y4 g U; J
理解上述解法的一个关键点是对于所有不等于x的element,它能不能有机会被查验取决于而且只取决于它与k个值为x的elements的相对位置。 |
评分
-
查看全部评分
|