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 |
This tag is used if a reference is needed in a paper or textbook on a specific result.
1
vote
Accepted
Tails of sums of Weibull random variables
The affirmative answer can be found in this paper by A.V.Nagaev: essentially "the conjecture" is true for $\alpha = \varepsilon$ (which is clearly the best possible).
7
votes
2
answers
2k
views
Tails of sums of Weibull random variables
Suppose that $X_1, X_2, \ldots, X_n$ are i.i.d random variables distributed according to Weibull distribution with shape $0 < \epsilon < 1$ (it means that $\mathbf{Pr}[X_i \geq t] = e^{-\Theta(t^{\eps …
12
votes
6
answers
11k
views
Two reference requests: Pinsker's inequality and Pontryagin duality
Sorry for such a newbie post and for asking two unrelated references in one shot.
First, I am interested in any proof of Pinsker's inequality.
Second, I wonder what is the best place to read about P …
38
votes
10
answers
18k
views
Fast matrix multiplication
Suppose we have two $n$ by $n$ matrices over particular ring. We want to multiply them as fast as possible. According to wikipedia there is an algorithm of Coppersmith and Winograd that can do it in $ …