Two particles A and B move randomly, at times t = 1,2,... on the set M = {1,...,m}, m≥ 3, reflecting from the boundary and preserving the order of their positions XÃ (t) and XÂ(†) (so that XÃ(t) ≤ XÂ(t)) according to the following rules. (a) If the distance between them is greater than 1 then at the next time they proceed independently according to the following criteria. (i) When a particle is not in a border site, 1 or m, it jumps to one of its nearest neighbours with probability 1/2. (ii) When a particle is in a border site, it either jumps to its nearest neighbour in M or remains at the same position, again with probability 1/2. (b) If they meet each other or are at distance one, they modify their behaviour. They both keep their positions if the jumps attempted would lead to interchanging their order, i.e. to the inequality XÃ > XB. (The probabilities of attempts are as before and the attempts are independent.) Otherwise they proceed according to their attempted moves. Determine the state space of the Markov chain formed by the pair (XÂ(†), XÂ(t)) and find its invariant distribution. Is the chain reversible?

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Two particles A and B move randomly, at times t = 1,2,... on the set M =
{1,...,m}, m≥ 3, reflecting from the boundary and preserving the order of their
positions X₁ (t) and XÂ(t) (so that XÃ(t) ≤ XÂ(t)) according to the following rules.
(a) If the distance between them is greater than 1 then at the next time they proceed
independently according to the following criteria.
(i) When a particle is not in a border site, 1 or m, it jumps to one of its nearest
neighbours with probability 1/2.
(ii) When a particle is in a border site, it either jumps to its nearest neighbour
in M or remains at the same position, again with probability 1/2.
(b) If they meet each other or are at distance one, they modify their behaviour. They
both keep their positions if the jumps attempted would lead to interchanging their
order, i.e. to the inequality XÃ > XB. (The probabilities of attempts are as before and
the attempts are independent.) Otherwise they proceed according to their attempted
moves.
Determine the state space of the Markov chain formed by the pair (XÃ (t),XÂ(t))
and find its invariant distribution. Is the chain reversible?
Transcribed Image Text:Two particles A and B move randomly, at times t = 1,2,... on the set M = {1,...,m}, m≥ 3, reflecting from the boundary and preserving the order of their positions X₁ (t) and XÂ(t) (so that XÃ(t) ≤ XÂ(t)) according to the following rules. (a) If the distance between them is greater than 1 then at the next time they proceed independently according to the following criteria. (i) When a particle is not in a border site, 1 or m, it jumps to one of its nearest neighbours with probability 1/2. (ii) When a particle is in a border site, it either jumps to its nearest neighbour in M or remains at the same position, again with probability 1/2. (b) If they meet each other or are at distance one, they modify their behaviour. They both keep their positions if the jumps attempted would lead to interchanging their order, i.e. to the inequality XÃ > XB. (The probabilities of attempts are as before and the attempts are independent.) Otherwise they proceed according to their attempted moves. Determine the state space of the Markov chain formed by the pair (XÃ (t),XÂ(t)) and find its invariant distribution. Is the chain reversible?
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,