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.
0
votes
0
answers
15
views
Looking for a citation for this simple generalization of the Markov bound to non-negative su...
Does anybody know a reference for the following theorem?
Theorem 1. Let $(X_t)_{t=0}^\infty$ be a non-negative supermartingale.
Then, for any constant $c > 0$, the event $(\exists
> t)\, X_t \ge c$ h …
1
vote
Chernoff-type bounds for a stopped sum of independent random variables
The two answers so far may give the impression that bounds in the desired spirit (Chernoff-like bounds for sums with stopping times) are not possible. But useful bounds in this spirit can indeed be s …
2
votes
Does Multiplicative Version of Azuma's Inequality Hold?
Yes, such bounds are possible. You can adapt the proof of Azuma's inequality to the multiplicative-error case, if you set it up correctly.
For example:
Lemma 10 [this paper].
Let $Y=\sum_{t=1}^T x_t …
2
votes
0
answers
316
views
McDiarmid's Inequality bounding deviation with multiplicative error?
Fix $m$ arbitrary values $x_1, x_2, ..., x_m$ in $[0,1]$, and an integer $n$. Obtain $n$-set $S$ by drawing $n \le m$ times randomly without replacement from $\{1,2,..,m\}$. Define r.v. $X = \sum_{i …