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 order-statistics
Search options not deleted
user 192944
The order statistics of a sample are the values placed in ascending order. The i-th order statistic of a statistical sample is equal to its i-th smallest value; so the sample minimum is the first order statistic & the sample maximum is the last. Sometimes 'order statistic' is used to mean the whole set of order statistics, i.e. the data values disregarding the sequence in which they occurred. Use also for related quantities such as spacings.
8
votes
1
answer
532
views
a fast uniform order statistic generator
Can someone provide me with the mathematical expression for this code/function as a fast way to generate $n$ sorted $U[0,1]$ random numbers:
rsunif <- function(n) { n1 <- n+1
cE <- cumsum(rexp(n …
- 334k