1993 | OriginalPaper | Chapter
Markov Chains—Stationary Distributions and Steady State
Author : Marc A. Berger
Published in: An Introduction to Probability and Stochastic Processes
Publisher: Springer New York
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Let Nn(y) denote the number of visits of the Markov chain {Xn} to y during times m = 1,…,n. That is, $${N_n}(y) = \sum\limits_{m = 1}^n {{I_{\{ y\} }}({X_m})} $$