A combinatorial method in the theory of Markov chains

DOI10.1016/0022-247X(64)90014-9zbMATH Open0275.60015OpenAlexW1981910622MaRDI QIDQ2265728FDOQ2265728

Authors: Lajos Takács 

Publication date: 1964

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(64)90014-9

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25) Combinatorial probability (60C05)

Cites Work

• A Combinatorial Method in the Theory of Queues
• A Generalization of the Ballot Problem and its Application in the Theory of Queues
• The Probability Law of the Busy Period for Two Types of Queuing Processes

Cited In (1)

• On normal semigroups

This page was built for publication: A combinatorial method in the theory of Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265728)