Estimating a probability using finite memory

DOI10.1109/TIT.1986.1057250zbMath0616.60088OpenAlexW2158396815MaRDI QIDQ4725462

Ronald L. Rivest, Frank Thompson Leighton

Publication date: 1986

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1986.1057250

zbMATH Keywords

Markov chain tree theoremestimation proceduresfinite-memory

Mathematics Subject Classification ID

Non-Markovian processes: estimation (62M09) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Related Items (11)

The Stationary Distribution of a Markov Jump Process Glued Together from Two State Spaces at Two Vertices ⋮ Hitting time quasi-metric and its forest representation ⋮ Lower space bounds for randomized computation ⋮ Dynamic survival bias in optimal stopping problems ⋮ A note on two-way probabilistic automata ⋮ Statistical estimation with bounded memory ⋮ Directed forests and the constancy of Kemeny's constant ⋮ A proof of the Markov chain tree theorem ⋮ Unnamed Item ⋮ Forest matrices around the Laplacian matrix ⋮ The Buck-Passing Game

This page was built for publication: Estimating a probability using finite memory