The number of visits to a subset of the state space by a discrete- parameter semi-Markov process (Q1344834)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 724096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of visits to a subset of the state space by a discrete- parameter semi-Markov process |
scientific article; zbMATH DE number 724096 |
Statements
The number of visits to a subset of the state space by a discrete- parameter semi-Markov process (English)
0 references
22 February 1995
0 references
A discrete-parameter irreducible semi-Markov process with a finite state space is considered. The state space is the union of two disjoint nonempty subsets \(A_1\) and \(A_2\). The distribution of a random number of transitions \(A_1 \to A_2\) during the first \(t + 1\) time instants \((t \geq 1)\) is investigated. A compact formula for this distribution in terms of the semi-Markov transition function is derived.
0 references
counting process
0 references
closed form expression
0 references
semi-Markov process
0 references
0 references
0 references
0.800666093826294
0 references
0.7962274551391602
0 references
0.7704853415489197
0 references
0.7586458325386047
0 references
