Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
3
votes
Determine individual score or ranking from group scores
This implies (among other things) that all the components $X(\omega)$ have the same expectation. … Since these components sum to the sample size $M,$ that common expectation must be
$$E[X(\omega)] = \frac{M}{\binom{N}{n}}.$$
In this case we can use the sample statistics $t_j$ to estimate the measures …
1
vote
Expected intersection between a random set and a collection of random sets
mathcal Y)\times 0 + \Pr(j \in \bigcup \mathcal Y)\times 1 = 1 - \pi_j.$$
The number of elements in $\bigcup \mathcal Y$ common to $A$ is just the sum of the $X_j$ for $j=1,2,\ldots, m,$ whence the expectation … For sampling with replacement, $p = m/n.$
For sampling without replacement, $p = 1-\left(1 - 1/n)\right)^m \approx 1-e^{-m/n}.$
The last approximation is excellent when $sm \ll n.$ …
7
votes
Accepted
Calculating % unsampled in sampling with replacement
So, the probability that a particular unit is not sampled, $P(Y_{i} = 0)$, is calculated from the binomial mass function as
$$ P(Y_{i} = 0) = (1 - 1/N)^{k} $$
So, the indicator of subject $i$ not being … Regardless of whether or not they are, linearity of expectation still holds so the expected proportion of the population that is not sampled is
$$ \mu_{k} = E \left( \frac{1}{N} \sum_{i=1}^{N} X_{i}\ …