论文信息 - More on recurrence and waiting times

More on recurrence and waiting times

W,,P(Zj1) is approximately distributed as an exponential random variable with mean 1. We use a Poisson heuristic to provide a very simple intuition for this result, which is then formalized using the Chen-Stein method. We then rederive, with remarkable brevity, most of the known asymptotic

Abraham J. Wyner

[1] P. Shields. The Ergodic Theory of Discrete Sample Paths , 1996 .

[2] A. Barbour,et al. Poisson Approximation , 1992 .

[3] Paul C. Shields,et al. Waiting times: Positive and negative results on the Wyner-Ziv problem , 1993 .

[4] Philippe Jacquet,et al. Autocorrelation on Words and Its Applications - Analysis of Suffix Trees by String-Ruler Approach , 1994, J. Comb. Theory A.

[5] Serap A. Savari,et al. On the entropy of DNA: algorithms and measurements based on memory and rapid convergence , 1995, SODA '95.

[6] Benjamin Weiss,et al. Entropy and data compression schemes , 1993, IEEE Trans. Inf. Theory.

[7] Ioannis Kontoyiannis,et al. Asymptotic Recurrence and Waiting Times for Stationary Processes , 1998 .

[8] Aaron D. Wyner,et al. On the Role of Pattern Matching in Information Theory , 1998, IEEE Trans. Inf. Theory.

[9] P. Shields. Entropy and Prefixes , 1992 .

[10] Abraham J. Wyner. The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm , 1997, IEEE Trans. Inf. Theory.