Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T07:15:58.114Z Has data issue: false hasContentIssue false

Discrete random Processes*

Published online by Cambridge University Press:  11 August 2014

Get access

Extract

If a variable assumes the discrete values xj (j = 1, 2, 3, …) with specified probabilities f(xj ), where f(xj ) it is said to be a discrete random variable. If a discrete random variable is also a function of a continuous (non-random) variable, for convenience usually assumed to be ‘time’, it is called a discrete random process.

A class of discrete random processes of particular interest to the pure mathematician and to the mathematical statistician has been called stochastically definite by Kolmogoroff (1931). Such a random process is distinguished by the fact that the probability that the random variable concerned assumes a given value n at time t depends only on the value m assumed by the variable at time s (s < t) and not on the values assumed at any intermediate or earlier points of time. This circumstance is allowed for by writing the probability of the value n at time t in the form Pmn (s, t).

Information

Type
Research Article
Copyright
Copyright © Institute of Actuaries Students' Society 1949

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.)

Article purchase

Temporarily unavailable