Transition matrices with equal germs (Q678379): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5524074 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5604247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5512461 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4697411 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circuit duality for recurrent Markov processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Andrei Nikolaevich Kolmogorov (1903-1987) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Kendall's Conjecture Concerning 0<sup>+</sup> -Equivalence of Markov Transition Functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5516366 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5620934 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Kendall's ‘Germ’ Conjecture for Markov Chains / rank | |||
Normal rank |
Latest revision as of 12:12, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Transition matrices with equal germs |
scientific article |
Statements
Transition matrices with equal germs (English)
0 references
17 April 1997
0 references
By proving the following theorem Kendall's conjecture, stating the opposite, is rejected: There exist two transition matrices \((p_{i,j}(t))\) and \((r_{i,j}(t))\), which are such that for some numbers \(T_{i,j}>0\) we have \( p_{i,j}(t) = r_{i,j}(t)\) for \(0\leq t\leq T_{i,j}\), for all \(i, j\), but which are not identical, i.e., \( p_{i,j}(t)\neq r_{i,j}(t)\) for some \(i,j\) and \(t\). In order to give a constructive proof of the above theorem, a special class of continuous time Markov processes with infinitely many states are studied. Such processes must allow an infinite number of transitions within a short period of time and their distributions obey a particular graph representation.
0 references
death process
0 references
first entrance time
0 references
Kendall's conjecture
0 references
Markov chain
0 references
\(Q\)-matrix
0 references
\(0^ +\)-equivalence
0 references
0 references