/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q21E Let \({X_1},{X_2},...\)be a sequ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

Let \({X_1},{X_2},...\)be a sequence of i.i.d. random variables having the exponential distribution with parameter 1. Let \({Y_n} = \sum\limits_{i = 1}^n {{X_i}} \)for each \(n = 1,2,...\)

a. For each\(u > 1\), compute the Chernoff bound on \(\Pr \left( {{Y_n} > nu} \right)\).

b. What goes wrong if we try to compute the Chernoff bound when\(u < 1\).

Short Answer

Expert verified

a. The Chernoff bound for \(\Pr \left( {{Y_n} > nu} \right)\) is\({\left[ {u{e^{\left( {1 - u} \right)}}} \right]^n}\).

b. If \(u < 1\), then \(\Pr \left( {X \ge t} \right) \le \mathop {\min }\limits_{x > 0} \;\exp \left( { - st} \right)\psi \left( s \right)\) is minimized over \(s > 0\)near \(s = 0\),

which provides a useless bound of 1 for \(\Pr \left( {{Y_n} > nu} \right)\).

Step by step solution

01

Given information

Let \({X_1},{X_2},...\) is the sequence of i.i.d random variables follows exponential distribution with parameter 1.

02

Computing the Chernoff bound on \(\Pr \left( {{Y_n} > nu} \right)\)

The m.g.f of the exponential distribution with parameter 1 is\(\frac{1}{{1 - s}}\)for\(s < 1\).

Since, \({Y_n} = \sum\limits_{i = 1}^n {{X_i}} \) for each \(n = 1,2,...\)

Hence,

The m.g.f. of \({Y_n}\) is \(\frac{1}{{{{\left( {1 - s} \right)}^n}}}\) for\(s < 1\).

From theorem 6.2.7, The Chernoff bound is the minimum (over\(s > 0\)) of\(\frac{{{e^{ - nus}}}}{{{{\left( {1 - s} \right)}^n}}}\)

The logarithm of this is\( - n\left[ {us + \log \left( {1 - s} \right)} \right]\), which is minimized at \(s = \frac{{\left( {u - 1} \right)}}{u}\), which is positive if and only if \(u > 1\).

Therefore, the Chernoff bound for \(\Pr \left( {{Y_n} > nu} \right)\) is\({\left[ {u{e^{\left( {1 - u} \right)}}} \right]^n}\).

03

Computing the Chernoff bound on \(\Pr \left( {{Y_n} > nu} \right)\) when \(u < 1\)

If \(u < 1\), then \(\Pr \left( {{Y_n} > nu} \right) \le \mathop {\min }\limits_{x > 0} \;\exp \left( { - st} \right)\psi \left( s \right)\) is minimized over \(s > 0\)near \(s = 0\),

which provides a useless bound of 1 for \(\Pr \left( {{Y_n} \ge nu} \right)\)

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Suppose that the distribution of the number of defects on any given bolt of cloth is the Poisson distribution with a mean 5, and the number of defects on each bolt is counted for a random sample of 125 bolts. Determine the probability that the average number of defects per bolt in the sample will be less than 5.5.

How large a random sample must be taken from a given distribution in order for the probability to be at least 0.99 that the sample mean will be within 2 standard deviations of the mean of the distribution?

A random sample of n items is to be taken from a distribution with mean μ and standard deviation σ.

a. Use the Chebyshev inequality to determine the smallest number of items n that must be taken to satisfy the following relation:

\({\bf{Pr}}\left( {\left| {{{{\bf{\bar X}}}_{\bf{n}}}{\bf{ - \mu }}} \right| \le \frac{{\bf{\sigma }}}{{\bf{4}}}} \right) \ge {\bf{0}}{\bf{.99}}\)

b. Use the central limit theorem to determine the smallest number of items n that must be taken to satisfy the relation in part (a) approximately

Suppose that \({{\bf{X}}_{\bf{1}}}{\bf{,}}...{\bf{,}}{{\bf{X}}_{\bf{n}}}\) form a random sample from a normal distribution with unknown mean θ and variance \({{\bf{\sigma }}^{\bf{2}}}\). Assuming that \({\bf{\theta }} \ne {\bf{0}}\) , determine the asymptotic distribution of \({{\bf{\bar X}}_{\bf{n}}}^{\bf{3}}\)

Let\(\left\{ {{p_n}} \right\}_{n = 1}^\infty \)be a sequence of numbers such that\(0 < {p_n} < 1\)for all\(n\). Assume that\(\mathop {\lim }\limits_{n \to \infty } {p_n} = p\)with\(0 < p < 1\). Let\({X_n}\)have the binomial distribution with parameters\(k\)and\({p_n}\)for some positive integer\(k\)Prove that\({X_n}\)converges in distribution to the binomial distribution with parameters k and p.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.