scientific article; zbMATH DE number 3854183

MaRDI QIDQ3322997zbMATH OpenFDO

Authors Ronald L. Rivest, F. Thomson Leighton

Publication date 1983

zbMATH Keywords

independent Bernoulli random variableslinear estimation proceduresMarkov chain tree theoremmean- square errorn-state deterministic estimation procedureprobabilistic estimation proceduretime-invariant finite-memory estimation procedures

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Statistical aspects of information-theoretic topics (62B10) Point estimation (62F10) Parametric inference (62F99)

Recommendations

• Estimating a probability using finite memory
• Estimation with finite memory
• Statistical estimation with bounded memory
• Sequential estimation of functions of p for Bernoulli trials
• On estimating the memory for finitarily Markovian processes

Cited in

(6)

• On the dependence of the existence of the positive steady states on the rate coefficients for deficiency-one mass action systems: single linkage class
• How much information can one bit of memory retain about a Bernoulli sequence?
• Estimating a probability using finite memory
• Memory and Probability
• Markov chains on trees: almost lower and upper directed cases
• Statistical estimation with bounded memory

This page was built for publication:

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