Example: marketing

FINITE-STATE MARKOV CHAINS - MIT OpenCourseWare

Chapter 3 FINITE-STATE MARKOV CHAINS 3.1 Introduction The counting processes {N(t); t > 0} described in Section 2.1.1 have the property that N(t) changes at discrete instants of time, but is defined for all real t > 0. The Markov chains to be discussed in this chapter are stochastic processes defined only at integer values of time, n = 0, 1,....At each integer time n ≥ 0, there is an ...

Tags:

  States, Mit opencourseware, Opencourseware

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Transcription of FINITE-STATE MARKOV CHAINS - MIT OpenCourseWare

Related search queries