Symmetry. The distinct pair i, j of states of a Markov chain is called symmetric if P(Tj < Ti | Xo = i) = P(Ti < Tj | Xo = j), where Ti = min {n ≥ 1: Xn=i}. Show that, if Xo = i and i, j is symmetric, the expected number of visits to j before the chain revisits i i is 1.
Symmetry. The distinct pair i, j of states of a Markov chain is called symmetric if P(Tj < Ti | Xo = i) = P(Ti < Tj | Xo = j), where Ti = min {n ≥ 1: Xn=i}. Show that, if Xo = i and i, j is symmetric, the expected number of visits to j before the chain revisits i i is 1.
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 3 steps with 3 images
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