Central Limit Theorem Variation for Chi Square distribution?

Click For Summary
SUMMARY

The discussion focuses on the application of the Central Limit Theorem (CLT) to a Chi-Square distribution in the context of an experiment repeated n times, resulting in k events. The key formula presented is D2 = Σ(i=1 to k) [(ni - npio)² / (npio)], which approximates a Chi-Square distribution with k-1 degrees of freedom when n is sufficiently large and pi equals pio. Participants suggest using the moment-generating function (mgf) of D2 for proof, while also considering the Principle of Mathematical Induction (PMI) as an alternative approach.

PREREQUISITES
  • Understanding of Central Limit Theorem (CLT)
  • Familiarity with Chi-Square distribution and its properties
  • Knowledge of moment-generating functions (mgf)
  • Basic principles of Mathematical Induction (PMI)
NEXT STEPS
  • Study the derivation of the Chi-Square distribution from the Central Limit Theorem
  • Learn how to calculate moment-generating functions for random variables
  • Explore applications of the Principle of Mathematical Induction in probability theory
  • Investigate the implications of large sample sizes on statistical distributions
USEFUL FOR

Statisticians, data analysts, and students studying probability theory who are interested in the relationship between the Central Limit Theorem and Chi-Square distributions.

dharavsolanki
Messages
77
Reaction score
0
Central Limit Theorem Variation for Chi Square distribution?

If this question fits into Homework Help, please move it over there. I'm not too sure.

I encountered the following problem:

An experiment E is performed n times. Each repetition of E results in one and only one of the events Ai, i = 1, 2, 3, ..., k. Suppose that p(Ai) = pi and Let ni be the number of times Ai occurs among the n repetitions of E, n1 + n2 + ... +nk = n.

Also, let D2 = Summation of i from 1 to k of \frac{(n_i - np_io)^2}{np_io}

If n is sufficiently large and if pi = pio then show that the distribution of D2 has approximately the chi square distribution with k-1 degrees of freedom.

Now, this problem seems fairly similar to a simple proof the central limit theorem. I am damn sure that this problem involves finding the mgf of D2, evaluating it and saying that it is the same as the mgf of a chi square function.

Can you help me out with setting up the equation? that'll be a big help! Thank you!

I've given it an attempt, but one attempt at setting up the mgf is all that i ask. Also, if there is any other way which does not involve mgf (i being wrong), please mentione that! Thank you!
 
Last edited:
Physics news on Phys.org


I have seen a proof of this theorem, which has been proved by assuming the value of the parameter k = 2. Essentially, it just means that the theorem has been proved using ony the asumption tht only two events may occur.

p1 + p2 = 1 and n1 + n2 = n

Using this and substituting in the value of D2, we arrive at a uncture where n1 is defined as sum of j from 1 to n of Yij, where Yij = 1 is A1 occurs on the jth repetition and 0 elsewhere.

Now, central limit theorem is used over the variable n1, and if n is large, it has approximately a normal distribution.


I distinctly remember someone mentioning the use of Principle of Mathematical Induction to solve this problem. Can anyone of you solve this problem using the PMI? Will be a big help! No mgf involved till now!
 


Begin by looking at the distribution of each

<br /> \frac{(n_i - np_io)}{\sqrt{np_io}}<br />

and not that even though there are n of them they satisfy one linear relationship.
 

Similar threads

  • · Replies 20 ·
Replies
20
Views
4K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
8K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
6K
  • · Replies 1 ·
Replies
1
Views
8K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
5K