The recurrence of blocks for Bernoulli processes

MaRDI QIDQ1866575zbMATH OpenFDO

Authors Dong Han Kim

Publication date 8 January 2004

Published in Osaka Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.ojm/1153493042

zbMATH Keywords

data compression methodsergodic stationary information source

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Entropy and other invariants (28D20) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Convergence of recurrence of blocks for mixing processes
• Average convergence rate of the first return time
• A Central Limit Theorem for Non-Overlapping Return Times
• More on recurrence and waiting times
• Asymptotic recurrence and waiting times for stationary processes

Cited in

(4)

• A version of Maurer's conjecture for stationary  -mixing processes
• Convergence of recurrence of blocks for mixing processes
• A Central Limit Theorem for Non-Overlapping Return Times
• Lack of ground state for NLSE on bridge-type graphs

This page was built for publication: The recurrence of blocks for Bernoulli processes

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