No label defined (Q3973375)

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 16690
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 16690

      Statements

      26 June 1992
      0 references
      \(Q\)-matrix problem
      0 references
      \(Q\)-processes
      0 references
      existence and uniqueness of honest \(Q\)-processes
      0 references
      existence and uniqueness results for maximal and reversible \(Q\)-processes
      0 references
      0 references
      [For the entire collection see Zbl 0724.00019.] The so-called ``\(Q\)-matrix problem'' refers to the problem of deciding if a given matrix \(Q\) (satisfying certain necessary conditions) is a \(Q\)- matrix -- the ``density matrix'' (component-wise derivative at \(t=0\)) of the transition matrix \(P(t)\) of some continuous time Markov chain -- and if so, under what conditions is this chain (the ``\(Q\)-process'') uniquely determined. In case the diagonal elements of \(Q\) are either all finite or all infinite, this problem was completely solved by the mid-`70's, principally through the contributions of Feller, Hou, and D. Williams. Work continues on other cases, as well as on the ``construction problem'': given a \(Q\)-matrix, find/construct all possible associated \(Q\)-processes. The author outlines (and in some cases, announces) recent results of Chinese probabilists in case the diagonal of \(Q\) contains both finite and infinite elements. The ``existence'' part of the problem (existence of a \(Q\)-process) is not yet completely solved for such \(Q\). The ``uniqueness'' part of the problem (if \(Q\) is a \(Q\)-matrix, find necessary and sufficient conditions for uniqueness of the \(Q\)-process) was recently solved, and is announced here. Results on the existence and uniqueness of it honest \(Q\)-processes are also discussed. In final sections, the author includes complementary material. In Section 5 he raises the issue of the ``type'' of the \(Q\)-process: processes are classified according to whether or not they are honest, and whether or not they satisfy the Kolomogorov backward or forward equations. Now the problem is to determine it how many (zero, one, finitely many, infinitely many) \(Q\)-processes of a specific type correspond to a given \(Q\)-matrix. Section 6 contains examples. Sections 7 and 8 present existence and uniqueness results for maximal and reversible \(Q\)-processes.
      0 references

      Identifiers