Recurrence times are insensitive to distributions. Let XO, X1, X2, ... be drawn i.i.d. p(x), X E X = {1, 2,...,m}, and let N be the waiting time to the next occurrence of XO. Thus N = min n{Xn = XO). (a) Show that EN = m. (b) Show that E log N≤ H (X). (c) (Optional) Prove part (a) for (Xi) stationary and ergodic.

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter1: Fundamental Concepts Of Algebra
Section1.2: Exponents And Radicals
Problem 90E
icon
Related questions
Question
Recurrence times are insensitive to
distributions. Let XO, X1, X2, ... be drawn
i.i.d. - p(x), x eX = {1, 2,...,m}, and let N
be the waiting time to the next
occurrence of XO. Thus N = min n{Xn =
XO). (a) Show that EN = m. (b) Show that
E log N< H (X). (c) (Optional) Prove part
(a) for {Xi} stationary and ergodic.
Transcribed Image Text:Recurrence times are insensitive to distributions. Let XO, X1, X2, ... be drawn i.i.d. - p(x), x eX = {1, 2,...,m}, and let N be the waiting time to the next occurrence of XO. Thus N = min n{Xn = XO). (a) Show that EN = m. (b) Show that E log N< H (X). (c) (Optional) Prove part (a) for {Xi} stationary and ergodic.
Expert Solution
steps

Step by step

Solved in 4 steps with 42 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell