6. Suppose that a random walk S₂ (in some graph/environment, such as Zd, but not necessarily) is recurrent when started from position x. That is, P(n ≥ 1, Sn=x|So = x) = 1. Moreover, suppose that there is positive probability that the walk will eventu- ally visit some other site y, when started from x. That is, P(n ≥ 1, Sny So=x) > 0. Argue that, in fact, the random walk will visit y infinitely often, when started from x. Hint: Try a proof by contradiction, using the Law of Large Numbers.
6. Suppose that a random walk S₂ (in some graph/environment, such as Zd, but not necessarily) is recurrent when started from position x. That is, P(n ≥ 1, Sn=x|So = x) = 1. Moreover, suppose that there is positive probability that the walk will eventu- ally visit some other site y, when started from x. That is, P(n ≥ 1, Sny So=x) > 0. Argue that, in fact, the random walk will visit y infinitely often, when started from x. Hint: Try a proof by contradiction, using the Law of Large Numbers.
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...
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON