Cycle Representations of Recurrent Denumerable Markov Chains

  • Sophia┬áL.┬áKalpazidou
Part of the Stochastic Modeling and Applied Probability book series (SMAP, volume 28)

Abstract

This chapter deals with the cycle generating equations defined by the transition probabilities of denumerable Markov chains ╬ż which are recurrent. The solutions (­Łĺ×, w c ) of cycles and weights to these equations will be called cycle representations of ╬ż.

Keywords

Markov Chain Weak Convergence Deterministic Algorithm Stochastic Matrix Probabilistic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

┬ę┬áSpringer Science+Business Media New York┬á1995

Authors and Affiliations

  • Sophia┬áL.┬áKalpazidou
    • 1
  1. 1.Department of MathematicsAristotle University of ThessalonikiThessalonikiGreece

Personalised recommendations