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 |
Theory and applications of probability and stochastic processes: e.g. central limit theorems, large deviations, stochastic differential equations, models from statistical mechanics, queuing theory.
19
votes
Accepted
What kind of probability distribution maximizes the average distance between two points?
The uniform distribution on the circle is optimal.
Every probability measure on the disc can be approximated by the sum of atomic measures with equal wieghts, that is, by measures of the form $\frac1 …
12
votes
Accepted
Product of random diagonals on the unit circle
To 2, the answer is yes. This is easy. Re-enumerate points according to their cyclic order. For every fixed $k$ ($1\le k<n$), the product
$$
D_k:= \prod_i |P_i P_{i+k}|
$$
(where the indices are take …
3
votes
Accepted
Distances between and among points in a region
One can show that $F(X)> c\cdot G(X)^{-2}$ for some $c>0$, provided that $G(X)$ is sufficiently small.
Let $G(X)=\varepsilon$. Divide the square into $\approx(100\varepsilon)^{-2}$ small squares of s …
6
votes
Accepted
Scale random variables in a way they have equal probabilities of being minimal
Such simple adjustment is not possible. First, take the logarithm: consider new random variables $y_i=\log x_i$. Their ordering is the same, but correction is now additive rather than multiplicative: …