Computer Assignment #3 - Stochastic Processes and Simulation I | MATH 5040, Assignments of Mathematics

Material Type: Assignment; Class: Stoch Proc,Simultn I; Subject: Mathematics; University: University of Utah; Term: Fall 2002;

Typology: Assignments

Pre 2010

Uploaded on 08/30/2009

koofers-user-coa
koofers-user-coa ๐Ÿ‡บ๐Ÿ‡ธ

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Computer Assignment 3
Math 5040 โ€“ Fall 2002
Due: Wednesday October 2 2002
Random Walk on
๎˜€
/r
๎˜€
Consider the Markov chain {Xn}on {0,1,2,...,rโˆ’1}with
Pk,j =(1
2if j=kยฑ1 mod r
0 otherwise
For which values of ris the chain aperiodic. Pick such a value greater than 10. Simulate
the Markov chain. Does each realization of the chain converge to a value? By simulation,
estimate the distribution of Xnfor large (say larger than 10000) n. What is happening to
the distribution of Xnfor large values of n.
Bernoulli-Laplace Model of Diffusion
There are two urns, each always with Nparticles. There are a total of Nwhite particles,
and a total of Nblack particles. At each unit of time, a particle is chosen from each urn
and interchanged.
Let Xnbe the number of white particles in the first urn. Then
P(k, k + 1) = ๎˜’1โˆ’k
N๎˜“2
P(k, k โˆ’1) = ๎˜’k
N๎˜“2
P(k, k) = 2 k
N๎˜’1โˆ’k
N๎˜“.
Simulate this Markov chain. For each realization of {Xn}, does it appear that Xnis
converging to something? What about the distribution of Xn. Estimate via simulation the
distribution of Xnfor large n. What is happening for nlarge?
1

Partial preview of the text

Download Computer Assignment #3 - Stochastic Processes and Simulation I | MATH 5040 and more Assignments Mathematics in PDF only on Docsity!

Computer Assignment 3

Math 5040 โ€“ Fall 2002 Due: Wednesday October 2 2002

Random Walk on

/r

Consider the Markov chain {Xn} on { 0 , 1 , 2 ,... , r โˆ’ 1 } with

Pk,j =

1 2 if^ j^ =^ k^ ยฑ^1 mod^ r 0 otherwise

For which values of r is the chain aperiodic. Pick such a value greater than 10. Simulate the Markov chain. Does each realization of the chain converge to a value? By simulation, estimate the distribution of Xn for large (say larger than 10000) n. What is happening to the distribution of Xn for large values of n.

Bernoulli-Laplace Model of Diffusion There are two urns, each always with N particles. There are a total of N white particles, and a total of N black particles. At each unit of time, a particle is chosen from each urn and interchanged. Let Xn be the number of white particles in the first urn. Then

P (k, k + 1) =

k N

P (k, k โˆ’ 1) =

k N

P (k, k) = 2

k N

k N

Simulate this Markov chain. For each realization of {Xn}, does it appear that Xn is converging to something? What about the distribution of Xn. Estimate via simulation the distribution of Xn for large n. What is happening for n large?