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 stochastic-processes
Search options not deleted
user 148956
A stochastic process is a collection of random variables usually indexed by a totally ordered set.
5
votes
0
answers
789
views
How many balls should we throw into $m$ bins so that at least $k$ bins get at least $r$ ball...
Let $m,k,r\in\mathbb N$ and $\delta\in(0,1)$, such that $k\le m$.
Suppose that we throw balls uniformly and independently into $m$ bins.
I am looking for an upper bound $N_{m,k,r,\delta}$ on the num …
- 51