The Probabilistic Method Week 4: The Basic Method Joshua Brody - PowerPoint PPT Presentation

The Probabilistic Method Week 4: The Basic Method Joshua Brody CS49/Math59 Fall 2015 images source: wikipedia, google

Clicker Question What does it mean for a tournament to have property S k ? (A) There is a set of k players that beat all other players. (B) For any set of k players, there is one player that beats them all. (C) There is a set of k players that are all beaten by one player. (D) For any set of k players, there is a player beaten by all of them

Clicker Question Which of the following sets are sum-free? (A) A = {1, 2, 4, 6} (B) B = {17, 19, 35, 47, 101} (C) C = {-14, 22, 57, 71} (D) multiple answers correct (E) no answers correct

Tournaments Definition: A tournament on n players is an orientation of K n (u,v) directed edge: “u beats v”

Property S k Definition: T has property S k if every set of k vertices there is another vertex that beats them all.

Property S k Definition: T has property S k if every set of k vertices there is another vertex that beats them all. Question: Are there always tournaments w/ S k ?

Tournaments with S k n-k ( ) (1-2 -k ) < 1 Theorem: If then there is a tournament n k on n vertices with property S k .

Tournaments with S k n-k ( ) (1-2 -k ) < 1 Theorem: If then there is a tournament n k on n vertices with property S k . Proof: • Choose random tournament on n vertices. • each edge u → v or v → u independently w/prob 1/2 .

Tournaments with S k n-k ( ) (1-2 -k ) < 1 Theorem: If then there is a tournament n k on n vertices with property S k . Proof: • Choose random tournament on n vertices. • each edge u → v or v → u independently w/prob 1/2 . • BAD K : event set of vertices K not dominated by another vertex

Tournaments with S k n-k ( ) (1-2 -k ) < 1 Theorem: If then there is a tournament n k on n vertices with property S k . Proof: • Choose random tournament on n vertices. • each edge u → v or v → u independently w/prob 1/2 . • BAD K : event set of vertices K not dominated by another vertex • BAD := ∪ K BAD K ; • GOOD:= ¬BAD

Clicker Question What is the probability that a set of k vertices does not get dominated? (A) 2 -k (B) (1-2 -k ) (C) 2 -k(n-k) (D) multiple answers possible (E) none of the above

Tournaments with S k n-k ( ) (1-2 -k ) < 1 Theorem: If then there is a tournament n k on n vertices with property S k .

Tournaments with S k n-k ( ) (1-2 -k ) < 1 Theorem: If then there is a tournament n k on n vertices with property S k . Proof: • Choose random tournament on n vertices. • each edge u → v or v → u independently w/prob 1/2 . • BAD K : event set of vertices K not dominated by another vertex • BAD := ∪ K BAD K ; GOOD:= ¬BAD

Tournaments with S k n-k ( ) (1-2 -k ) < 1 Theorem: If then there is a tournament n k on n vertices with property S k . Proof: • Choose random tournament on n vertices. • each edge u → v or v → u independently w/prob 1/2 . • BAD K : event set of vertices K not dominated by another vertex • BAD := ∪ K BAD K ; GOOD:= ¬BAD n-k (1-2 -k ) • Pr[BAD k ] = ( ) • # k vertex subsets: n k

Tournaments with S k n-k ( ) (1-2 -k ) < 1 Theorem: If then there is a tournament n k on n vertices with property S k . Proof: • Choose random tournament on n vertices. • each edge u → v or v → u independently w/prob 1/2 . • BAD K : event set of vertices K not dominated by another vertex • BAD := ∪ K BAD K ; GOOD:= ¬BAD n-k (1-2 -k ) union bound: • Pr[BAD k ] = n-k Pr[BAD] ≤ ( ) (1-2 -k ) < 1 n ( ) • # k vertex subsets: n k k

The Probabilistic Method

The Probabilistic Method Week 4: The Basic Method Joshua Brody - PowerPoint PPT Presentation

The Probabilistic Method Week 4: The Basic Method Joshua Brody CS49/Math59 Fall 2015 images source: wikipedia, google Clicker Question What does it mean for a tournament to have property S k ? (A) There is a set of k players that beat all

PROBABILISTIC METHOD Probabilistic Method Colouring Problem Theorem 1 Let A 1 , A 2 , . . . , A

The Probabilistic Method Techniques Union bound Argument from expectation Alterations The

Randomness in Computing L ECTURE 21 Last time Probabilistic method Sample and Modify

Chapter 0: Why? What? How? The Probabilistic Method Summer 2020 Freie Universitt Berlin

Chapter 2: Method of Alterations The Probabilistic Method Summer 2020 Freie Universitt Berlin

Randomness in Computing L ECTURE 22 Last time Probabilistic method The Second Moment

Advanced Algorithms (VII) Shanghai Jiao Tong University Chihao Zhang April 20, 2020 The

Randomness in Computing L ECTURE 23 Last time Probabilistic method Lovasz Local Lemma

The Probabilistic Method The Probabilistic Method Topics on Randomized Computation Topics on

The Probabilistic Method Week 8: Second Moment Method Joshua Brody CS49/Math59 Fall 2015

Chapter 1: Getting Started The Probabilistic Method Summer 2020 Freie Universitt Berlin

The Probabilistic Method Week 8: Second Moment Method Joshua Brody CS49/Math59 Fall 2015

Chapter 3: The Second Moment The Probabilistic Method Summer 2020 Freie Universitt Berlin

Randomness in Computing L ECTURE 24 Last time Probabilistic method Algorithmic LLL

The Probabilistic Method Week 6: Expectation, Variance, and Beyond Joshua Brody CS49/Math59

Probabilistic Inference and Learning with Steins Method Lester Mackey Microsoft Research New

Advanced Algorithms (VIII) Shanghai Jiao Tong University Chihao Zhang April 26, 2020 The

PRAMEA Probabilistic risk assessment method development and applications Presentation at the

USING PROBABILISTIC METHOD Rian Mahendra Taruna, Vrieslend Haris Banyunegoro, Gatut Daniarsyad

Chapter 5: Concentration The Probabilistic Method Summer 2020 Freie Universitt Berlin Chapter

The Probabilistic Method Week 1: Introduction to Probability Theory Joshua Brody CS49/Math59

The Probabilistic Method Week 3: Asymptotic Analysis Joshua Brody CS49/Math59 Fall 2015

The Probabilistic Method: Proof Through a Probabilistic Argument Compute n n n

The Probabilistic Method Joshua Brody CS49/Math59 Fall 2015 Traditional Lectures Little