## Geostatistical Simulation: Models and Algorithms1. 1 Simulation versus estimation The following problem was raised by Alfaro (1979). A submarine cable has to be laid across the straits of Gibraltar. How can its length be predicted if the depth of the sea floor has been measured sparsely along its trajectory? Fig. 1. 1. Part of the actual trajectory and sample data points An exact determination of the length requires knowledge of the depth at each point of the trajectory. But these are mostly unknown. In a geostatistical set ting, they are considered as random and can be estimated by linear regression starting from the available data points. This suggests estimating the actual length as the length of the estimated trajectory. The results turn out to be disappointing. The length of the trajectory is seriously underestimated (see Figure 1. 2). Clearly, the estimated trajectory is much smoother than the actual one. Fig. 1. 2. Part of the actual trajectory and its estimate from linear regression. In this particular example, the estimated trajectory is piecewise linear because the linear regression has been carried out using an exponential covariance function 2 1. Introduction What is really questionable in this procedure is not the construction of an estimator for the length starting from the depth estimator, but the depth estimator itself. Linear regression estimation requires only the mean and the covariance function. But the covariance function does not tell us much about the length of the trajectories. Figure 1. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

2 | |

Notation | 13 |

Set notation | 20 |

Variographic tools | 21 |

Basic morphological concepts | 39 |

some basic notions 47 | 46 |

Basics about simulations | 57 |

the distribution of X is | 71 |

Rate of convergence of iterative algorithms 87 | 86 |

Exact simulations | 101 |

Point processes | 119 |

Tessellations | 133 |

Geomp Geometric distribution with parameter | 144 |

Boolean model | 153 |

Object based models | 167 |

Poisson 6 Poisson distribution with mean 6 | 64 |

distribution of X | 65 |

Iterative algorithms for simulation | 67 |

n iterate of the transition kernel | 235 |

256 | |

### Other editions - View all

### Common terms and phrases

acceptance-rejection method aperiodic avoiding functional boolean model chapter coding process compact subset conditioning data points considered convex convex set covariance function Cox process d-volume Definition denoted dilation domain eigenvalues estimate Example exponential Figure finite sequence formula gaussian random function geometric covariogram germs goto Hausdorff distance hitting functional hyperplanes independent integral range intensity function invariant isofactorial iterative algorithm Markov chain Matheron mean number Metropolis algorithm Minkowski functionals number of iterations number of objects number of points obtained parameter Poisson distribution Poisson point process Poisson tessellation population of objects probability process with intensity Proof Proposition random closed set random mapping random set random variable rate of convergence realization Remark shows simulation field spatial distribution stochastic subdomain substitution random function Suppose theorem tion top left Top right transition kernel turning bands Unif uniform point up-set variogram vector Voronoi tessellation