Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-29T05:50:44.235Z Has data issue: false hasContentIssue false
  • English
  • Français

Composable Markov processes

Published online by Cambridge University Press:  14 July 2016

Tore Schweder
Tore Schweder*
Affiliation:
University of Oslo
Get access Rights & Permissions [Opens in a new window]

Extract

Many phenomena studied in the social sciences and elsewhere are complexes of more or less independent characteristics which develop simultaneously. Such phenomena may often be realistically described by time-continuous finite Markov processes. In order to define such a model which will take care of all the relevant a priori information, there ought to be a way of defining a Markov process as a vector of components representing the various characteristics constituting the phenomenon such that the dependences between the characteristics are represented by explicit requirements on the Markov process, preferably on its infinitesimal generator.

Type
Research Papers
Information
Journal of Applied Probability , Volume 7 , Issue 2 , August 1970 , pp. 400 - 410
Copyright
Copyright © Applied Probability Trust 1970 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Dynkin, E. B. (1965) Markov Processes. Springer Verlag.Google Scholar
Khintchine, A. Y. (1960) Mathematical Methods in the Theory of Queuing. Griffin, London.Google Scholar