Skip to main content

Cycle Representations of Recurrent Denumerable Markov Chains

  • Chapter
Cycle Representations of Markov Processes

Part of the book series: Stochastic Modeling and Applied Probability ((SMAP,volume 28))

  • 199 Accesses

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 ξ.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kalpazidou, S.L. (1995). Cycle Representations of Recurrent Denumerable Markov Chains. In: Cycle Representations of Markov Processes. Stochastic Modeling and Applied Probability, vol 28. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3929-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3929-9_3

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-3931-2

  • Online ISBN: 978-1-4757-3929-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics