Problem 4 Let X₁,...,Xn be independent random variables with values in (1,...,x) and probability mass function Px ifxe (1,...,x) else, respectively. Of course, p, € [0, 1] and p₁ +...+Px = 1. Now, for k = 1,...,x let för is p(x)= Nk:= [1(x,-k), i=1 i.e. N counts how many of the X, assume the value k. (a) Show that for any (n₁,...,nx) € (0, 1,...,n)* with n1 + ... + nx = n n! P{N₁= n₁,..., Nx = nx} = nin! Hint: The number of distinguishable rearrangements of the vector (1,...,1,2,...,2,. n₁ times n₂ times n! ni!…x! n, times ...p. because there are n! possible rearrangements in total, but n₁!--nx! of those rearrangements consist merely of permutations within the blocks of equal entries and thus lead exactly to the same sequence of numbers (i.e. are not distinguishable). (b) Suppose that x =2. Compute EN₁ and EN2.

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...
icon
Related questions
Question
Problem 4
(1,...,x) and probability mass function
Let X₁,...,Xn be independent random variables with values in
p(x)=-
respectively. Of course, p, € [0, 1] and P1 +
is
Px
0
...+Px 1. Now, for k= 1,...,x let
n
if x = (1,...,x)
else,
Nk:= [1(x,-k),
i=1
i.e. N counts how many of the X, assume the value k.
(a) Show that for any (n₁,...,nx) (0, 1,...,n)* with n₁ +...+nx = n
P{N₁ = n₁,..., Nx = nx}=
n!
nink!"
Hint: The number of distinguishable rearrangements of the vector
(1,...,1,2,...,2,
n₁ times n₂ times
n!
ni!…nx!
21
P1
K₂...,K
ng times
ng
PK
because there are n! possible rearrangements in total, but n₁!nk! of those rearrangements
consist merely of permutations within the blocks of equal entries and thus lead exactly to the
same sequence of numbers (i.e. are not distinguishable).
(b) Suppose that x =2. Compute EN₁ and EN₂.
Transcribed Image Text:Problem 4 (1,...,x) and probability mass function Let X₁,...,Xn be independent random variables with values in p(x)=- respectively. Of course, p, € [0, 1] and P1 + is Px 0 ...+Px 1. Now, for k= 1,...,x let n if x = (1,...,x) else, Nk:= [1(x,-k), i=1 i.e. N counts how many of the X, assume the value k. (a) Show that for any (n₁,...,nx) (0, 1,...,n)* with n₁ +...+nx = n P{N₁ = n₁,..., Nx = nx}= n! nink!" Hint: The number of distinguishable rearrangements of the vector (1,...,1,2,...,2, n₁ times n₂ times n! ni!…nx! 21 P1 K₂...,K ng times ng PK because there are n! possible rearrangements in total, but n₁!nk! of those rearrangements consist merely of permutations within the blocks of equal entries and thus lead exactly to the same sequence of numbers (i.e. are not distinguishable). (b) Suppose that x =2. Compute EN₁ and EN₂.
Expert Solution
steps

Step by step

Solved in 3 steps with 5 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
A First Course in Probability (10th Edition)
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON
A First Course in Probability
A First Course in Probability
Probability
ISBN:
9780321794772
Author:
Sheldon Ross
Publisher:
PEARSON