Which statements are true? Select one or more: a. Markov’s inequality is only useful if I am interested in that X is larger than its expectation. b. Chebyshev’s inequality gives better bounds than Markov’s inequality. c. Markov’s inequality is easier to use. d. One can prove Chebyshev’s inequality using Markov’s inequality with (X−E(X))2.

Which statements are true? Select one or more: a. Markov’s inequality is only useful if I am interested in that X is larger than its expectation. b. Chebyshev’s inequality gives better bounds than Markov’s inequality. c. Markov’s inequality is easier to use. d. One can prove Chebyshev’s inequality using Markov’s inequality with (X−E(X))2.

A First Course in Probability (10th Edition)

10th Edition

ISBN:9780134753119

Author:Sheldon Ross

Publisher:Sheldon Ross

Chapter1: Combinatorial Analysis

Section: Chapter Questions

Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...

See similar textbooks

Similar questions

i-0¹¹ for a - 1, 2; but ₁0¹i 3? • In the case d = 1,2 what is the expected length of a path returning to the origin? . In the case d = 1,2, what is the probability of two returns? Three returns? An infinity of returns to the origin? 7
3.) Johns Hopkins reports two numbers daily for all the US states: P(t): the total number of cases confirmed on day t or before N(t): number of new cases reported on day t a.) What is P(t+1)-P(t) in terms of N? b.) Compare (P(t+1))-(P(t))/1 with (P(t-Δ))-(P(t))/Δt What is the value of Δt and explain why P ≈ N in words.
3. The expectation operator E can be applied to a random vector. Specif- ically, if X = [X1 X2 …… Xn]", then EX = [EX1 EX2 .… EXn]". Show that E[(X – EX)(X – EX)"]= [cov(X¡, X;)]"j=1 •
The degree distribution of a network has the following functional form: Pk = Cak, Where a < 1 is a constant, and k ≥ 1 is the degree. a. Find out the value of C. b. Find out its probability generating function go(z) in compact form. C. Find out the corresponding generating function g₁(z) for its excess degree distribution in compact form. d. Find out the probability that a node in this network has zero 2nd neighbors. condition for a such that a giant component is present. e. Find out the f. When 1 - fraction of nodes are randomly removed, find out the critical value of when giant cluster emerges. g. What is the size of the giant cluster if it exists?
(a) (b) S = 5 12 (0·0·000} 1 Is S a spanning set for R¹? Justify your answer. 10 7 Is S linearly independent? Justify your answer.
Prove that f(n) = 1000n5 + 20000n2 + 32 is O(n6 ); Is this a tight upper bound? Why or why not?
Let X be a strictly positive r.v. with the following moment generating function:MX (t) = 1/(1 − 2t)^3(a) Use Markov’s inequality to find an upper bound for P (|X| ≥ 18).(b) Use Chebyshev’s inequality to find an upper bound for P (|X − 6| ≥ 12).(c) Find the lowest possible upper bound for P (X ≥ 18) you could get fromChernoff’s inequality.
3. Let Xi ∼ Poi(1), i = 1, . . . , n, be n = 20 independent Poisson r.v’s.Hint: you may use E(Y ) = λ and Var(Y ) = λ, for a Poisson r.v. Y ∼ Poi(λ). 3a. Use the Markov inequality to obtain a bound on Pr (Ln Xi > 30) (±0.05 is okay). 3b. Use the CLT to approximate the same probability (±0.01 is okay)