Grinstead-Snell-Probability · Problem 10.1.6

Generating Functions

Mathematics · generating-functions-discrete

Problem

Let pp be the probability distribution p=(01201/32/3),p = \begin{pmatrix} 0 & 1 & 2 \\ 0 & 1/3 & 2/3 \end{pmatrix}, and let pn=p∗p∗⋯∗pp_n = p * p * \cdots * p be the nn-fold convolution of pp with itself. (a) Find p2p_2 by direct calculation (see Definition 7.1). (b) Find the ordinary generating functions h(z)h(z) and h2(z)h_2(z) for pp and p2p_2, and verify that h2(z)=(h(z))2h_2(z) = (h(z))^2. (c) Find hn(z)h_n(z) from h(z)h(z). (d) Find the first two moments, and hence the mean and variance, of pnp_n from hn(z)h_n(z). Verify that the mean of pnp_n is nn times the mean of pp. (e) Find those integers jj for which pn(j)>0p_n(j) > 0 from hn(z)h_n(z).

Related theory

Browse the problem library