A general class of Markov processes with explicit matrix-geometric solutions (Q1088296): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5524074 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semi-explicit solutions for M/PH/1-like queueing systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Moment formulas for the Markov renewal branching process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3923308 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The busy period of queues which have a matrix-geometric steady state probability vector / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Operator-geometric stationary distributions for markov chains, with application to queueing models / rank | |||
Normal rank |
Revision as of 17:40, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A general class of Markov processes with explicit matrix-geometric solutions |
scientific article |
Statements
A general class of Markov processes with explicit matrix-geometric solutions (English)
0 references
1986
0 references
We consider a class of Markov chains for which the stationary probability vector, when it exists, is of the matrix-geometric form. The essential step in the computational algorithm usually is the evaluation of a matrix R. We consider two general cases for which that matrix is explicitly determined.
0 references
stationary probability vector
0 references
matrix-geometric form
0 references
0 references