Randomized Algorithms (Spring 2010)/The probabilistic method: Difference between revisions
Jump to navigation
Jump to search
imported>WikiSysop |
imported>WikiSysop |
||
Line 1: | Line 1: | ||
== The Basic Idea == | == The Basic Idea == | ||
=== Counting | === Counting or sampling === | ||
{|border="1" | {|border="1" | ||
Line 15: | Line 15: | ||
{|border="1" | |||
|'''Theorem''' | |||
:Let <math>\mathcal{F}\subseteq{[n]\choose k}</math> and let <math>m=|\mathcal{F}|</math>. <math>\mathcal{F}</math> has a blocking set of size <math>\left\lceil\frac{n\ln m}{k}\right\rceil</math>. That is, there exists a set <math>T\subseteq[n]</math> of size <math>\left\lceil\frac{n\ln m}{k}\right\rceil</math> such that <math>T</math> intersects all <math>S\in\mathcal{E}</math>. | |||
|} | |||
=== Linearity of expectation === | === Linearity of expectation === |
Revision as of 08:35, 16 April 2010
The Basic Idea
Counting or sampling
Theorem
|
Theorem (Shannon)
|
Theorem
|
Linearity of expectation
Theorem
|
Theorem
|