Skip to main content

All Questions

1 vote
0 answers
48 views

Sort a group of distributions

Given a group of $n$ probability distributions, $P_1, P_2, \ldots, P_n$, we sample an outcome for each of the distributions $X_i \sim P_i, \forall i \in [n]$, and we want to compute the probability of ...
Vezen BU's user avatar
  • 2,150
1 vote
0 answers
38 views

Balanced splits in Randomized Quicksort

I am reading about usage of Chernoff bounds for bounding number of comparisons in a randomized Quicksort from here. What is proved is that ($n$ is number of elements in the array) $$\Pr[\text{Number ...
advocateofnone's user avatar
1 vote
0 answers
27 views

does it make sense to ask the expected value for discrete values ​in non-enumerable sets?

I want to know, is this question well formulated? If so, what is the answer? "Let randomly choose n numbers in a range [0,1], what is the expected value of the smallest number? if distribution ...
user avatar
1 vote
1 answer
525 views

Distribution probability of elements and pair-wise differences in a sorted list

Suppose a set of $m$ integers from $0$ to $n-1$. The integers are uniformly distributed and unique in the set ($n \gg m$). Then, put all the integers into a list an sort that list: $$x_0 < x_1 < ...
doc's user avatar
  • 1,307