Homework Help is Here – Start Your Trial Now!
Math
Statistics
0) As a preliminary helper result, show by induction that for events E₁, E2,..., EM, M P(E₁ or E₂ or ... or EM) ≤ ΣP(Em). SË m=1 (2)

0) As a preliminary helper result, show by induction that for events E₁, E2,..., EM, M P(E₁ or E₂ or ... or EM) ≤ ΣP(Em). SË m=1 (2)

MATLAB: An Introduction with Applications
MATLAB: An Introduction with Applications
6th Edition
ISBN:9781119256830
Author:Amos Gilat
Publisher:Amos Gilat
Chapter1: Starting With Matlab
Section: Chapter Questions
Problem 1P
See similar textbooks
icon
Related questions
Question
5) For N = 100, what is the smallest k that 3.4 indicates the probability of having k-winners is less than 1? Code or Mathematica to evaluate your answer in 3.4 is fine. 6) For N = 100 and k as in 3.5, argue that there exist possible tournaments with no k-winners. Bonus: Using the Chernoff bound to bound the relevant probabilities, show that for a > 1/2 the probability of there being any aN-winners goes to 0 as N → ∞. Conclude therefore that there exist tournaments without aN-winners, for all sufficiently large N.
Transcribed Image Text:5) For N = 100, what is the smallest k that 3.4 indicates the probability of having k-winners is less than 1? Code or Mathematica to evaluate your answer in 3.4 is fine. 6) For N = 100 and k as in 3.5, argue that there exist possible tournaments with no k-winners. Bonus: Using the Chernoff bound to bound the relevant probabilities, show that for a > 1/2 the probability of there being any aN-winners goes to 0 as N → ∞. Conclude therefore that there exist tournaments without aN-winners, for all sufficiently large N.
Problem 3: Attournamento 0) As a preliminary helper result, show by induction that for events E1, E2,..., Em, P(E1 or E2 or .. or EM) < P(Em). (2) m=1 Consider a tournament between N teams, each team playing each of the other teams. 1) How many games will be played in total, in the tournament? We can represent the results of this tournament by a directed graph: node i represents team i, and an edge exists i → j if team i beat team j. 2) Show (by example) there is a tournament that might occur, where every team is beaten by some team. The above problem suggests that it may be impossible to declare an absolute winner, as everyone may be beaten by somebody. We could relax this slightly in the following way: let's call team i a k-winner if there is a group of k-many teams that were each beaten by team i. Other teams may have beaten team i, but there is at least a group of size k that was roundly beaten by i. 3) If the results of each game are decided by fair coin flip, what is the probability that a given team i is a k-winner? 4) Using result 3.0, bound the probability that there exists a k-winner in a tournament of size N? Write it nicely as you can but don't beat yourself up too much with it.
Transcribed Image Text:Problem 3: Attournamento 0) As a preliminary helper result, show by induction that for events E1, E2,..., Em, P(E1 or E2 or .. or EM) < P(Em). (2) m=1 Consider a tournament between N teams, each team playing each of the other teams. 1) How many games will be played in total, in the tournament? We can represent the results of this tournament by a directed graph: node i represents team i, and an edge exists i → j if team i beat team j. 2) Show (by example) there is a tournament that might occur, where every team is beaten by some team. The above problem suggests that it may be impossible to declare an absolute winner, as everyone may be beaten by somebody. We could relax this slightly in the following way: let's call team i a k-winner if there is a group of k-many teams that were each beaten by team i. Other teams may have beaten team i, but there is at least a group of size k that was roundly beaten by i. 3) If the results of each game are decided by fair coin flip, what is the probability that a given team i is a k-winner? 4) Using result 3.0, bound the probability that there exists a k-winner in a tournament of size N? Write it nicely as you can but don't beat yourself up too much with it.
Expert Solution
steps

Step by step

Solved in 3 steps with 20 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
MATLAB: An Introduction with Applications
MATLAB: An Introduction with Applications
Statistics
ISBN:
9781119256830
Author:
Amos Gilat
Publisher:
John Wiley & Sons Inc
Probability and Statistics for Engineering and th…
Probability and Statistics for Engineering and th…
Statistics
ISBN:
9781305251809
Author:
Jay L. Devore
Publisher:
Cengage Learning
Statistics for The Behavioral Sciences (MindTap C…
Statistics for The Behavioral Sciences (MindTap C…
Statistics
ISBN:
9781305504912
Author:
Frederick J Gravetter, Larry B. Wallnau
Publisher:
Cengage Learning
Elementary Statistics: Picturing the World (7th E…
Elementary Statistics: Picturing the World (7th E…
Statistics
ISBN:
9780134683416
Author:
Ron Larson, Betsy Farber
Publisher:
PEARSON
The Basic Practice of Statistics
The Basic Practice of Statistics
Statistics
ISBN:
9781319042578
Author:
David S. Moore, William I. Notz, Michael A. Fligner
Publisher:
W. H. Freeman
Introduction to the Practice of Statistics
Introduction to the Practice of Statistics
Statistics
ISBN:
9781319013387
Author:
David S. Moore, George P. McCabe, Bruce A. Craig
Publisher:
W. H. Freeman
SEE MORE TEXTBOOKS