Processing math: 100%
Resampling Techniques, Bootstrap and Blocking
Contents
Overview of week March 17-21, 2025
Why resampling methods ?
Statistical analysis
And why do we use such methods?
Central limit theorem
Further remarks
Running many measurements
Adding more definitions
Further rewriting
The covariance term
Rewriting the covariance term
Introducing the correlation function
Computing the correlation function
Resampling methods: Blocking
Why blocking?
Blocking Transformations
Blocking transformations
Blocking Transformations
Blocking Transformations, getting there
Blocking Transformations, final expressions
More on the blocking method
Example code form last week
Resampling analysis
Rewriting the covariance term
We introduce now a variable
d
=
|
j
−
k
|
and rewrite
2
m
n
2
m
∑
i
=
1
n
∑
j
<
k
˜
x
i
j
˜
x
i
k
,
in terms of a function
f
d
=
2
m
n
m
∑
i
=
1
n
−
d
∑
k
=
1
˜
x
i
k
˜
x
i
(
k
+
d
)
.
We note that for
d
=
0
we have
f
0
=
2
m
n
m
∑
i
=
1
n
∑
k
=
1
˜
x
i
k
˜
x
i
(
k
)
=
σ
2
!
«
1
...
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
...
24
»