Analyzing Markov Chains using Kronecker Products
From MaRDI portal
Publication:2888773
DOI10.1007/978-1-4614-4190-8zbMath1262.60003OpenAlexW2504873065MaRDI QIDQ2888773
Publication date: 4 June 2012
Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-4190-8
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Foundations of stochastic processes (60G05)
Related Items (6)
Maximum queue lengths during a fixed time interval in the \(M/M/c\) retrial queue ⋮ On Vector-Kronecker Product Multiplication with Rectangular Factors ⋮ Matrix-analytic solutions in production lines without buffers ⋮ CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES ⋮ Resource optimization in \(MMAP[2/PH[2]/S\) priority queueing model with threshold \(PH\) retrial times and the preemptive resume policy] ⋮ Optimization of traffic control in \(MMAP[2/PH[2]/S\) priority queueing model with \(PH\) retrial times and the preemptive repeat policy]
Uses Software
This page was built for publication: Analyzing Markov Chains using Kronecker Products
