Back to search

Boston University

Finite Markov chains and recurrent events

Abstract

dc:description.abstract

Many processes or systems can be fully or partially described by using that part of the probability theory called "stochastic processes." The term stochastic process is usually used when a change of state of a process may occur with time. A Markov process is a stochastic process where the probability of the process being in some state in the future depends only on the state which the process is presently in. A Markov chain is a Markov process which may occupy only a finite number of a denumerably infinite number of states. [TRUNCATED]

Degree

thesis:*
Name thesis:degree_name
Master of Arts
Level thesis:degree_level
masters
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
Boston University
Year dc:date.issued
1961

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Hardie, Charles H.

Rights

dc:rights
Statement dc:rights
  • Based on investigation of the BU Libraries' staff, this work is free of known copyright restrictions.
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Other
b1456242x

Chain of custody

source
Harvested from
Boston University
Base URL
open.bu.edu/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Hardie, Charles H.. Finite Markov chains and recurrent events. masters thesis, Boston University, 1961. https://hdl.handle.net/2144/15538