-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlec25.typ
More file actions
145 lines (95 loc) · 3.22 KB
/
Copy pathlec25.typ
File metadata and controls
145 lines (95 loc) · 3.22 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#import "./misc.typ": *
== Lecture 25
[D] §3-3 -- Age & Residual Life.
$(N_t)$ a RP with inter-arrival times IID $tau_1, tau_2, dots$
In a RP we have to deal with inter-arrival times that *do not* have lack of memory.
#pagebreak()
$N_t$ = \# points by time $t$
*Recall*
each time a point arrives is a *renewal time*:
$
(N_t, t >= 0) =^d (N_(T_n + t) - N_(T_n), t >= 0)
$
[For $"PP"(lambda)$ this is true at *any* point $s$, not only arrival times $s = T_n$]
#pagebreak()
#figure[
#image(
"./figs/p25_05m.png",
width: 80%,
)
]
$
A_t & = t - T_(N_t) \
& = "Age of lightbulb in use at time" t \
Z_t & = T_(N_t + 1) - t \
& = "Residual lifetime of lightbulb in use at time" t
$
#pagebreak()
*Discrete case*
Assume inter-arrival times $tau_1, tau_2, dots$ IID only taking values in ${1, 2, 3, dots}$.
#figure[
#image(
"./figs/p25_10m.png",
width: 100%,
)
]
$therefore$ Enough to study one of $(A_k)$ or $(Z_k)$.
#pagebreak()
We choose $(Z_k)$.
Note: $Z_k = i > 0 => Z_(k+1) = i - 1$
If $Z_k = 0$ this is a renewal time.
$(Z_k)$ is a MC:
$
cases(
p_(0, j) = f_(j+1)#footnote[PMF of inter-arrival times] quad j >= 0,
p_(i, i-1) = 1 quad i > 0,
p_(i, j) = 0 quad "o/w"
)
$
#pagebreak()
We can find the SD of this MC using the "cycle trick".
(We discussed this in §1 -- see Theorem 1.24 3rd ed [D]).
Starting from 0, one visits any $i > 0$ at most once before returning and this happens $<=>$ first jump from 0 is to some $j >= i$.
$therefore mu_i = P(T > i)$ is a stationary measure.
#pagebreak()
Note $sum_i underbrace(P(T > i), mu_i) =#footnote[tail formula for expectation] E(tau)$.
$therefore pi_i = (P(tau > i)) / (E(tau))$ is SD.
[Assuming $E(tau) < oo$].
So by MC theory
#pagebreak()
*Theorem*
(Assuming $(Z_n)$ is *IRR* & *APER*) we have
$
lim_(n->oo) P(Z_n#footnote[Also for $A_n$] = i) = (P(tau >= i)) / E(tau)
$
This gives the limiting distribution of the $(Z_n)$ in terms of distribution of inter-arrival times $tau$.
#pagebreak()
*Continuous Case*
Done in detail in [D].
We'll just touch on it briefly.
In discrete case, we showed $pi_i = (P(tau > i)) / (E(tau))$ is limiting distribution for $(Z_k)$ [& also $(A_k)$].
#pagebreak()
Similarly, in the continuous case, one can show that
$
g(x) = (P(tau > x)) / (E(tau))
$
is limiting distribution for $(Z_s, s >= 0)$ & $(A_s, s >= 0)$.
Using this
#pagebreak()
*Inspection Paradox*
$
integral_0^oo z g(z) d z & = integral_0^oo z (P(tau > z)) / E(tau) d z \
& = 1 / (E(tau)) integral_0^oo z P(tau > z) d z \
& =#footnote[Recall: $E(tau) = integral_0^oo P(tau > z) d z$. Similarly, $E (tau^k) = integral_0^oo k z^(k-1) P(tau > z) d z$] 1 / E(tau) E(tau^2) / 2
$
#pagebreak()
$therefore$ For large $t$,
$
L_t#footnote[Lifetime of bulb in use at time $t$] & = A_t + Z_t \
therefore E(L_t)& approx cancel(2) dot 1 / (E(tau)) E(tau^2) / cancel(2) \
& = (E(tau^2)) / (E(tau)) > E(tau)
$
(since $E(tau^2) - (E(tau))^2 = Var(tau) > 0$#footnote[If $Var(tau) = 0$, then all $tau_i equiv c$. This case isn't interesting.])
#pagebreak()
This is an (*apparent*) paradox, since each lightbulb has mean $E(tau)$.
*However*, lightbulbs with longer lifetimes are more likely to be the ones in use when we happen to make an inspection.