(i) Let RW, = {(so.S1.. sn) : So = 0, Isi+1 – Si| = 1,i = 0, 1,...,n– 1} be the set of all possible paths of a simple random walk of length n. Show that #RW, = 2", or the number of paths in RW, is 2". (ii) Let Dn = {(So, S1,.., Sn) € RW, : Sn = 0}. Calculate the number of paths in D,?

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.7: Distinguishable Permutations And Combinations
Problem 29E
icon
Related questions
Question
4
Execise.
(i) Let
RW, = {(so, $1,..., Sn) : so = 0, |Si+1 – s;l = 1,i = 0, 1,...,n – 1}
%3D
be the set of all possible paths of a simple random walk of length n. Show that
#RW, = 2",
or the number of paths in RW, is 2".
(ii) Let
D, = {($o, S1,..., Sn) € RW, : Sn = 0}.
%3D
Calculate the number of paths in Dn?
Transcribed Image Text:Execise. (i) Let RW, = {(so, $1,..., Sn) : so = 0, |Si+1 – s;l = 1,i = 0, 1,...,n – 1} %3D be the set of all possible paths of a simple random walk of length n. Show that #RW, = 2", or the number of paths in RW, is 2". (ii) Let D, = {($o, S1,..., Sn) € RW, : Sn = 0}. %3D Calculate the number of paths in Dn?
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Elementary Linear Algebra (MindTap Course List)
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:
9781305658004
Author:
Ron Larson
Publisher:
Cengage Learning