Markov Chains

László Lakatos, László Szeidl and Miklós Telek
Additional contact information
László Lakatos: Eotvos Lorant University
László Szeidl: Obuda University
Miklós Telek: Technical University of Budapest

Chapter Chapter 3 in Introduction to Queueing Systems with Telecommunication Applications, 2019, pp 93-177 from Springer

Abstract: Abstract In the early twentieth century, Markov (1856–1922) introduced in Markov (Izvestiya Fiziko-matematicheskogo Obschestva pri Kazanskom Universitete 15:135–156, 1906) a new class of models called Markov chains, applying sequences of dependent random variables that enable one to capture dependencies over time.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-15142-3_3

Ordering information: This item can be ordered from
http://www.springer.com/9783030151423

DOI: 10.1007/978-3-030-15142-3_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().