高级算法 (Fall 2022)/Basic tail inequalities: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

3 October 2022

  • curprev 15:4915:49, 3 October 2022‎ Etone talk contribs‎ 5,755 bytes +5,755‎ Created page with "=Markov's Inequality= One of the most natural information about a random variable is its expectation, which is the first moment of the random variable. Markov's inequality draws a tail bound for a random variable from its expectation. {{Theorem |Theorem (Markov's Inequality)| :Let <math>X</math> be a random variable assuming only nonnegative values. Then, for all <math>t>0</math>, ::<math>\begin{align} \Pr[X\ge t]\le \frac{\mathbf{E}[X]}{t}. \end{align}</math> }} {{Proo..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2022)/Basic_tail_inequalities"