Cox processes Flashcards

(31 cards)

1
Q

Describe the motivation for introducing Cox processes

A

Suppose we want to model a point pattern of trees by an inhomogeneous Poisson process. The intensity will depend on soil quality. But what if we don’t know the soil type? Or if there are other covariates that we are unaware of?

Solution: Consider a Poisson process with a random intensity, i.e. Cox process.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a random field?

A

A random field is a random function Z : S → R such that each
Z(u), u ∈ S, is a random variable.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Define a Cox point process

A

Let Z be a non-negative measurable random field which is locally integrable with probability 1. A Cox process with random intensity function Z is a point process X such that given Z = z, X is a Poisson process with intensity z.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Define the intensity, product density and the pair correlation function for a Cox process

A

ρ(u) = E Z(u),
ρ^(2)(u, v ) = E [Z(u) Z(v)],
g (u, v ) = E [Z(u) Z(v)] / E Z(u) E Z(v).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is Cox processes typically used for?

A

Modelling of clustering

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What functional summary statistics can be performed with Cox processes?

A

Often for specific Cox process models, g, the pair correlation, is expressible on closed form. Hence K and L can be calculated (at least numerically).
In general, F , G , J are hard to obtain.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How can a Cox process be simulated?

A

Two-step procedure:
Simulate a realization z of Z .
Given the result Z = z, simulate X as an inhomogeneous Poisson process with intensity z.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What are the void probabilities of a Cox process?

A

P(X ∩ B = ∅) = E [P(X ∩ B = ∅|Z )] = E [exp( - ∫_B Z(u) du) ]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a Neyman-Scott process?

A

A Neyman-Scott process is a Poisson cluster process X such that
▶ C is a homogeneous Poisson process with intensity κ.
▶ Given C, the clusters X_c , c ∈ C, are independent.
▶ X_c is an inhomogeneous Poisson process with intensity function
u → αk(u − c),
where α > 0 and k is a kernel (pdf).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a Matérn cluster process?

A

Neyman-Scott process with uniform density kernel on b(0, r):
k(u) = 1{∥u∥ ≤ r } / (ω_d r^d)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is a Thomas process?

A

Neyman-Scott process with d-dimensional gauss pdf kernel with mean 0 and covariance matrix ω^2I:
k(u) = 1 / (2πω^2)^{d/2} exp(−∥u∥^2 / 2ω^2)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the pair correlation function of a Neyman-Scott process?

A

g (u, v ) = g (u − v ) = 1 + 1 / κ ∫_{R^d} k(w) k(u − v + w) dw.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How can a Neyman-Scott process be simulated?

A

Use extended window W_{ext} ⊇ W, as we otherwise miss clusters with center outside the window. Should be chosen large enough, relative to κ and ω.

Simulate centre process C ∩ W_{ext} as a homogeneous Poisson process with intensity κ on W_{ext}.
For each c ∈ C ∩ W_{ext} , simulate its cluster X_c:
▶ Simulate the number N of points in the cluster, N ∼ po(α).
▶ Simulate n i.i.d. points with density k(· − c).
Return ∪_{c∈C ∩ W_{ext}} X_c ∩ W as a simulation X ∩ W .

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is shot-noise Cox processes?

A

It is the collection of 3 generalizations of the Neymann-Scott process.

  1. More flexible cluster sizes: For each center c ∈ C, could replace α by independent random variables γ > 0.
    Model the process of centers and expected cluster size by a Poisson process Φ = {(c, γ) ∈ Rd × (0, ∞) | c ∈ C}.
  2. Allow kernel to depend on c by using a kernel k(c, ·) which depends on c.
  3. Allow inhomogeneous center process.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the pair correlation function for the shot-noise Cox processes?

A

For X a SNCP and
β(u, v ) = ∫ ∫ γ^2 k(c, u) k(c, v) ζ(c, γ) dc dγ
a locally integrable function on R^d × R^d ,

g (u, v ) = 1 + β(u, v ) / ρ(u)ρ(v )

In particular, g ≥ 1.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is minimum contrast estimation?

A

It is a method for fitting a model from a family parametrized by θ based on an observed point pattern x.
Compute a non-parametric functional summary statistic ˆT (r ) from the data and let T_θ(r) be its theoretical value under the model parametrized by θ.
Estimate θ such that T_θ(r ) is as close as possible to ˆT (r) for a range of r -values.
Find the minimum contrast estimate ˆθ which minimises the contrast
d(ˆT , T_θ) = ∫_{a_1}^{a^2} [ˆT(r) − T_θ(r) ]^2 dr
for some chosen 0 ≤ a1 < a2.

17
Q

What is the pair correlation function for a Thomas process?

A

g_θ(r) = g_{(κ,ω2)} (r) = 1 + exp(−r^2 / (4ω^2) ) / (4πω^2 κ)

18
Q

What is a Gaussian random field?

A

Let S ⊆ R^d be a region. A random field Y : S → R is a Gaussian random field, if the vector (Y (u_1), . . . , Y (u_n))^T follows a multivariate normal distribution for any n ≥ 1 and u_1, . . . , u_n ∈ S, i.e.
∑_{i=1}^n a_i Y_i,
for a_i ∈ R.

19
Q

What is a log-Gaussian random field?

A

If Y is a Gaussian random field then Z = exp(Y) is a log-Gaussian random field

20
Q

What is a log-Gaussian Cox process?

A

An LGCP is a Cox process whose random intensity function is a log-Gaussian random field.

21
Q

How can a GRF be split into two GRF’s?

A

Y = m + Y_0 where
m is the mean function (the ”systematic part”),
Y_0 is a mean zero GRF with covariance function c (the ”random part”).

We may use a constant mean if we know nothing of the underlying distribution, but also a non-constant mean if we have some useful information.

22
Q

What is the covariance function of a GRF?

A

A function c : S × S → R that is symmetric and positive definite.

23
Q

What is the power exponential covariance function?

A

c(u, v ) = σ^2 exp( −∥u − v∥^δ / α ) ,
for σ, α > 0 and 0 ≤ δ ≤ 2.

δ = 1:
The exponential covariance function. Has ”jagged” realizations.
δ = 2:
The Gaussian covariance function. Has very smooth realizations.

24
Q

What is necessary for a complex covariance function of a GRF?

A

A function c : S × S → C is a covariance function if and only if it is hermitian and positive semi-definite.

25
How can the Fourier transform be used to construct real covariance functions?
If you have a symmetric function and then take the Fourier transform, then you have a symmetric and positive semi-definite function, hence a real covariance function.
26
What is the tent function and how is it used for constructing covariance functions?
The tent function ∆_R : R → [0, ∞) is given by `∆_R (u) =` `1 − |u|/R, |u| ≤ R`, `0, |u| > R` The idea is to construct covariance functions from limits and conical combinations of the tent function. The power exponential covariance function for δ ∈ [0, 1] is an example.
27
What is the intensity of a log-Gaussian Cox process?
`ρ(u) = exp(m(u) + c(u, u) / 2)`
28
What is the pair correlation function for a log-Gaussian Cox process?
g (u, v) = exp(c(u, v ))
29
How is the mean and covariance function in a log-Gaussian Cox process defined in regards to the intensity and pair correlation function?
Completely, which then completely determines the LGCP, `m(u) = log(ρ(u)) − 1 / 2 log(g(u, u))` `c(u, v) = log(g(u, v))`
30
How can a log-Gaussian Cox process be simulated?
Simulate a log GRF Z . Given Z = z, simulate an inhomogeneous Poisson process of intensity z. To simulate Z = e^Y : One possibility is to approximate the GRF Y on a regular grid: 1. Make a fine grid `u_1, ... , u_n ∈ S` 2. Simulate (Y (u_1), . . . , Y (u_n)) as a multivariate normal distribution with mean vector and covariance matrix with entries `μ_i = m(u_i) and ∑_{ij} = c(u_i , u_j)` 3. Assume that Y (u) for u not in the grid is equal to Y (u_i) for the closest grid point u_i . This process may be time consuming.
31
Give an overview of the Cox processes from the course
▶ LGCP ▶ SNCP: ▶ Neyman-Scott: ▶ Thomas process ▶ Matérn cluster process