Counting process

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by 2.228.254.168 (talk) at 11:57, 10 May 2025 (fixed typo in the first line of the definition). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A counting process is a stochastic process {N(t),t≥0} with values that are non-negative, integer, and non-decreasing:

  1. N(t)≥0.
  2. N(t) is an integer.
  3. If s≤t then N(s)≤N(t).

If s<t, then N(t)−N(s) is the number of events occurred during the interval (s,t]. Examples of counting processes include Poisson processes and Renewal processes.

Counting processes deal with the number of occurrences of something over time. An example of a counting process is the number of job arrivals to a queue over time.

If a process has the Markov property, it is said to be a Markov counting process.

See also

References

  • Ross, S.M. (1995) Stochastic Processes. Wiley. Template:ISBN
  • Higgins JJ, Keller-McNulty S (1995) Concepts in Probability and Stochastic Modeling. Wadsworth Publishing Company. Template:ISBN