Genesis of Markov Chains by Circuits: The Circuit Chains

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

Abstract

In this chapter we shall show how Markovian dependence can arise from at most countable collections of overlapping weighted directed circuits. The corresponding processes are Markov chains, that is, discrete parameter Markov processes which, generated by circuits, will be called circuit chains.

Keywords

Markov Chain Nonnegative Matrice Forward Passage Finite Markov Chain Reversible Markov Chain 
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