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 | |
Results tagged with pr.probability
Search options not deleted
user 68757
Theory and applications of probability and stochastic processes: e.g. central limit theorems, large deviations, stochastic differential equations, models from statistical mechanics, queuing theory.
0
votes
A balls and urns model for a hashing problem
I think I missed something in the model. It seems to me that $r$ is uniform in $\{1,\dots,N\}$.
$$
\mathbb{P}(r=x)=\frac{N-1}{N}\times \frac{N-2}{N-1} \times \dots \frac{N-(x-1)}{N-x+2}\times \frac{1 …
- 1