Embedded population systems in Markov set-chains (Q855539)
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 5077991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embedded population systems in Markov set-chains |
scientific article; zbMATH DE number 5077991 |
Statements
Embedded population systems in Markov set-chains (English)
0 references
7 December 2006
0 references
A finite Markov chain with \(n\)-states contains a population system if its probability transition matrices \(P(t)=(p_{ij}(t))\), \(t=1,2,3,\dots\), satisfy \(p_{ij}=k_{ij}(t)/\omega_i(t)\), \(1\leq i, j\leq n\), for some positive integers \(\omega_i(t)\) with \(\sum_i\omega_i(t)\) a constant (independent of \(t\)) and non-negative integers \(k_{ij}(t)\). The author shows some (sufficient) bound conditions for the transition matrices under which a Markov set-chain or a matrix set-chain contains a population system.
0 references
embedding
0 references
integer population systems
0 references
Markov set-chains
0 references
matrix set-chains
0 references
stochastic matrices
0 references
stochastic population matrices
0 references
0.7370801568031311
0 references
0.735243022441864
0 references
0.734956681728363
0 references
0.7250308394432068
0 references
0.7046633958816528
0 references
