Stats 3B

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/85

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 3:26 PM on 5/17/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

86 Terms

1
New cards

Correlation(X,Y), Corr(X,Y)

Cov(X,Y) / signa(X) sigma(Y)

2
New cards

Variance of X based on Covariance

3
New cards

Covariance Function, C(h)

4
New cards

Covariance Vector

5
New cards

Covariance Matrix

6
New cards

Simple Kriging Prediction (BLUP Simple Kriging, Best Linear unbiased predictor)

7
New cards

Simple Kriging system equation, weights equation

Or

8
New cards

Simple Kriging Variance

9
New cards

Simple Kriging confidence interval

10
New cards

Does Simple Kriging Variance depend on observed values Z. True or False

False

11
New cards

Semigram conversion to Covariance function C

12
New cards

Simple Kriging form, Z(s)

Where m is a known constant

13
New cards

What two assumptions are made for simple kriging

Known constant mean and Known constant variance

14
New cards

Steps for a simple kriging question and ordinary kriging

  1. Solve System Equation for weights λ(s0)

  2. Find predictior, Z^(s0)

  3. Find variance

  4. Confidence intervals

15
New cards

The kriging variance is the prediction error variance not the variance of s0

True

16
New cards
What is the interpolation property in kriging?
At an observed location, kriging reproduces the observed value exactly. If s_0=s_i, then \hat Z(s_0)=Z(s_i). The kriging weights become \lambda_i=1 and all others are 0, while the kriging variance becomes 0. Therefore kriging is an exact interpolator (without measurement error/nugget effect).
17
New cards

For non Gaussian processes is the kriging confidence intervals exact

False

18
New cards

How does the kriging hierarchy work? I.e what kriging is a special case of what kriging

Simple kriging is a special case of ordinary as ordinary assumes that the mean is constant but unknown and simple kriging assumes that the mean is know

Ordinary kriging is a special case of kriging where the number of basis functions, p=1, and that basis function f1(s) = 1

Universal

| k=0, f1(s) = 1

Ordinary

| mean is know

Simple kriging

By this simple kriging is a special case of universal where p = 1, f1(s) = 1 and the mean is known

19
New cards

What is different with filtered kriging

Filtered kriging adds tilda² to the covariance matrix, Σ

Simple kriging

20
New cards

What’s different with ordinary kriging

The mean is a constant but it is unknown

21
New cards

Ordinary kriging system equation

The mean μ could be written as μ(s0) but it is constant across all observations

22
New cards

Ordinary Kriging prediction

23
New cards

Ordinary Kriging Variance

24
New cards

The ordinary kriging variance σ2OK is always at least as large as the simple kriging variance σ2SK for the same data and prediction

True

25
New cards

What unbiasedness constraint is added in ordinary kriging?

26
New cards

Filtering kriging predicts the underlying process Y(s) not the noisy observation Z(s)

True, when doing filtering it it is Y hat (s0) not Z hat s0

27
New cards

Set up of the universal kriging system

where fi(s) are basis functions

28
New cards

F matrix, for universal kriging

29
New cards

F(s0) matrix

30
New cards

Universal Kriging system equation

31
New cards

Universal kriging variance using covariance function

32
New cards

What makes universal kriging unique compared to the other two?

That you don’t have to know the covariance function and it can be evaluated with the semivariogram

33
New cards

Universal kriging variance for semivariogram version

34
New cards

Predictive distribution and condition

Underlying process must be Gaussian

35
New cards

Conditional independence 3 functions X independent Y | Z

36
New cards

Conditional Partition where A and B are partition of the node set, A is the smaller set removed

37
New cards

Is X ⟂ Y | Z symmetric such that Y ⟂ X | Z

True, independence is symmetrical

38
New cards

Conditional distributions Xi | X-i

39
New cards

Markov Properties

40
New cards

What is the hierarchical structure of the Markov properties

If you have the one, you have the smaller ones.

I.e if you have local, local implies pairwise

41
New cards

If X is a GMRF, does X satisfies all 3 markov condtions

True

42
New cards

Precision Matrix of Disconnected graphs, A and B

43
New cards

Unweighted Diagonal and Adjacency Matrices

44
New cards

Weighted Laplacian, diagonal and adjacency matrix

Where wij > 0 describes the strength of the conditional dependence between neighbouring nodes

45
New cards

Weighted laplacian to precision matrix

Where M is any positive definite matrix and theta 1 and theta 2 are > 0

46
New cards

Unweighted laplacian

47
New cards

Definition of White Noise

48
New cards

Conditions for weakly stationary

49
New cards

Autocovariance function γ(τ )

50
New cards

Autocorrelation function

51
New cards

MA process order q, mean zero

Beta_0 is the coefficient of Z_t, but is often set to 1

52
New cards

MA process order q, mean non zero

53
New cards

Is MA(q) a weakly stationary process

True

54
New cards

Autocovariance function of MA(q)

The auto correlation function is found by just diving by tilda(0)

55
New cards

AR(p) process

56
New cards

Backwards shift operator version of AR(p)

57
New cards

Backwards shift operator definition

58
New cards

Backwards shift version of MA(q)

59
New cards

ARMA definition

60
New cards

What does a causal ARMA process mean and what is it?

The ARMA process can be written as a function of it’s past shocks, MA(inf) representation and is found if the absolute value roots of AR part of the ARMA are greater than 1

61
New cards

What does Invertible ARMA mean?

The ARMA process can be written as a product of the observed values X_t, written as a AR(inf) and the absolutely value of roots of the MA part are greater than 1

62
New cards

ARIMA formula

63
New cards

Random field weakly stationary

64
New cards

Covariate notation Between C(s,t) and C(h)

65
New cards

A Gaussian process with finite second moment that is either strictly stationary or weakly stationary implies the other

True

66
New cards

Kriging distribution for all kriging types

67
New cards

Mean and covariance completely determine all finite-dimensional distributions

True

68
New cards

General isotropy definition

69
New cards

Condition of isotropy if Zt is a weakly stationary process

The covariance function only depends on h via its norm ||h||

70
New cards

Three key conditions that the covariance function C(h) of a weakly stationary process must satisfy

71
New cards

Semivariogram formula

72
New cards

2 conditions of semivariograms

And conditional negative semi definite

73
New cards

Operations with semivariograms

If γ is a semivariogram than these are all also semivariograms

74
New cards

What is a nuggest

If a semivariogram has a discontinuity at 0, the size of the jump is called nugget

75
New cards

Covariance function definition

a function is a covariance function if it is symmetric and positive semi definite

76
New cards

Semivariogram conditional negative semidefinite

77
New cards

Brownian motion definition

78
New cards

Initial conditions for solving AR(2)

79
New cards

Real roots for AR(2) YW, b² -4ac > 0

80
New cards

AR(2) YW b² -4ac = 0

81
New cards

Complex roots AR(2) YW

Where roots are

82
New cards

Conditions for the roots in AR(2)

83
New cards
84
New cards
85
New cards
86
New cards