高级算法 (Fall 2023)/Concentration of measure: 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.

10 October 2023

  • curprev 10:5310:53, 10 October 2023‎ Etone talk contribs‎ 41,013 bytes +41,013‎ Created page with "=Chernoff Bound= Suppose that we have a fair coin. If we toss it once, then the outcome is completely unpredictable. But if we toss it, say for 1000 times, then the number of HEADs is very likely to be around 500. This phenomenon, as illustrated in the following figure, is called the '''concentration''' of measure. The Chernoff bound is an inequality that characterizes the concentration phenomenon for the sum of independent trials. File:Coinflip.png|border|450px|cent..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2023)/Concentration_of_measure"