INFINITE DAMS WITH INPUTS FORMING A MARKOV CHAIN.

Abstract

The report considers an infinite storage system in discrete time fed by inputs X sub t = 0, 1, ... ,r in the intervals (t, t+1) such that these form a positively regular Markov chain with a finite number of states. The release at the end of each interval is 1 or 0 depending on whether the dam content is positive or zero. Probabilities of first emptiness and of emptiness are found, and from these the probabilities of the dam content at time t can be evaluated. The report concludes with some stationary results. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 19, 1967
Accession Number
AD0660715

Entities

People

  • J. Gani
  • M. S. Ali Khan

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Intervals
  • Markov Chains
  • Markov Processes
  • Mathematics
  • Probability
  • Stationary

Readers

  • Hydrologic Risk Analysis and Mitigation.
  • Mathematical Modeling and Probability Theory.
  • Mathematics or Statistics