Estimating a probability using finite memory

DOI10.1109/TIT.1986.1057250MaRDI QIDQ4725462zbMATH OpenOpenAlexFDO

Authors Ronald L. Rivest, F. Thomson 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

estimation proceduresfinite-memoryMarkov chain tree theorem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3854183
• Estimation with finite memory
• Statistical estimation with bounded memory
• Sequential estimation of functions of p for Bernoulli trials
• Estimating with partial statistics the parameters of ergodic finite Markov sources

Cited in

(16)

• A note on two-way probabilistic automata
• A proof of the Markov chain tree theorem
• Forest matrices around the Laplacian matrix
• Directed forests and the constancy of Kemeny's constant
• Hitting time quasi-metric and its forest representation
• Dynamic survival bias in optimal stopping problems
• scientific article; zbMATH DE number 3854183 (Why is no real title available?)
• The stationary distribution of a Markov jump process glued together from two state spaces at two vertices
• How much information can one bit of memory retain about a Bernoulli sequence?
• Lower space bounds for randomized computation
• On special properties of some quasi-metrics
• The buck-passing game
• Memory and Probability
• Statistical estimation with bounded memory
• The Game of Pass the Buck and the Markov Chain Tree Theorem
• On estimating the memory for finitarily Markovian processes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4725462)