Small Ball Probabilities Around Random Centers of Gaussian Measures and Applications to Quantization

Let be a centered Gaussian measure on a separable Hilbert space (E, ). We are concerned with the logarithmic small ball probabilities around a -distributed center X. It turns out that the asymptotic behavior of –log (B(X,)) is a.s. equivalent to that of a deterministic function _R (). These new insights will be used to derive the precise asymptotics of a random quantization problem which was introduced in a former article by Dereich, Fehringer, Matoussi, and Scheutzow.⁽⁸⁾     

Approximation of maximum of Gaussian random fields

This contribution is concerned with Gumbel limiting results for supremum ${\mathbb{M}}_{\mathit{n}}={\sup }_{\mathit{t}\in [\mathbf{0},{\mathit{T}}_{\mathit{n}}]}?|X_{\mathit{n}}(\mathit{t})|$ with $X_{\mathit{n}},\mathit{n}\in {\mathbb{N}}^2$ centered Gaussian random fields with continuous trajectories. We show first the convergence of a related point process to a Poisson point process thereby extending previous results obtained in [8] for Gaussian processes. Furthermore, we derive Gumbel limit results for ${\mathbb{M}}_{\mathit{n}}$ as $\mathit{n}\to \infty$ and show a second-order approximation for $\mathbb{E}{\{{\mathbb{M}}_{\mathit{n}}^p\}}^{1/p}$ for any $p\ge 1$.     

Hausdorff-type Measures of the Sample Path of Gaussian Random Fields

Let φ be a Hausdorff measure function and A be an infinite increasing sequence of positive integers. The Hausdorff-type measure φ - mA associated to φ and A is studied. Let X（t）（t ∈ R^N） be certain Gaussian random fields in R^d. We give the exact Hausdorff measure of the graph set GrX（[0, 1]N）, and evaluate the exact φ - mA measure of the image and graph set of X（t）. A necessary and sufficient condition on the sequence A is given so that the usual Hausdorff measure function for X（[0, 1] ^N） and GrX（[0, 1]^N） are still the correct measure functions. If the sequence A increases faster, then some smaller measure functions will give positive and finite （ φ A）-Hausdorff measure for X（[0, 1]^N） and GrX（[0, 1]N）.     

Asymptotic Expansions for the Distribution of the Maximum of Gaussian Random Fields

Some asymptotic results are proved for the distribution of the maximum of a centered Gaussian random field with unit variance on a compact subset S of ^N . They are obtained by a Rice method and the evaluation of some moments of the number of local maxima of the Gaussian field above an high level inside S and on the border S. Depending on the geometry of the border we give up to N+1 terms of the expansion sometimes with exponentially small remainder. Application to waves maximum is shown.     

An Inequality for Tail Probabilities of Martingales with Bounded Differences

Let M _n =X₁+...+X_n be a martingale with bounded differences X_m=M_m-M_m-1 such that {|X_m| _m}=1 with some nonnegative _m. Write ²= ₁ ² + ... + _n ² . We prove the inequalities {M _nx}c(1-(x/)), {M _n x} 1- c(1- (-x/)) with a constant . The result yields sharp inequalities in some models related to the measure concentration phenomena.     

On the efficiency of Gaussian adaptation

Gaussian Adaptation (GA) is a stochastic process that adapts a Gaussian distribution to a region or set of feasible points in parameter space. As a result of the adaptation, GA becomes a maximum dispersion process extending the sampling over the largest possible volume in parameter space while keeping the probability of finding feasible points at a suitable level. For such a process, a general measure of efficiency is defined and an efficiency theorem is proved.     

广义高斯分布的参数估计及其收敛性质

广义高斯分布是一类以Gaussian分布、Laplacian分布为特例的对称分布 ,它在信号处理和图像处理等领域都有广泛的应用 .本文采用矩估计方法讨论广义高斯分布的形状参数和尺度参数的估计问题 ,首先导出了矩和参数的关系表达式 ,然后由此提出参数估计方法 ,并对参数估计的收敛性质进行了分析 ,最后利用模拟实验对本文所提方法进行了验证 .     

Almost Sure Asymptotics for Extremes of Non-stationary Gaussian Random Fields

In this paper, the authors prove an almost sure limit theorem for the maxima of non-stationary Caussian random fields under some mild conditions related to the covariance functions of the Gaussian fields. As the by-products, the authors also obtain several weak convergence results which extended the existing results.     

Towards a Faster Implementation of Density Estimation With Logistic Gaussian Process Priors

A novel method is proposed to compute the Bayes estimate for a logistic Gaussian process prior for density estimation. The method gains speed by drawing samples from the posterior of a finite-dimensional surrogate prior, which is obtained by imputation of the underlying Gaussian process. We establish that imputation results in quite accurate computation. Simulation studies show that accuracy and high speed can be combined. This fact, along with known flexibility of the logistic Gaussian priors for modeling smoothness and recent results on their large support, makes these priors and the resulting density estimate very attractive.     

Testing the covariance function of stationary Gaussian random fields

In many problems, a specific function like h(⋅) is considered as the covariance function. Based on the asymptotic distribution of the periodogram and Euler characteristic, three methods are introduced to test the equality of the covariance function with h(⋅). Our analyses prove the accuracy of the power and scaling laws for the covariance function of metal surfaces.     

Estimating the p-Variation Index of a Sample Function: An Application to Financial Data Set

In this paper we apply a real analysis approach to test continuous time stochastic models of financial mathematics. Specifically, fractal dimension estimation methods are applied to statistical analysis of continuous time stochastic processes. To estimate a roughness of a sample function we modify a box-counting method typically used in estimating fractal dimension of a graph of a function. Here the roughness of a function f is defined as the infimum of numbers p > 0 such that f has bounded p-variation, which we call the p-variation index of f. The method is also tested on estimating the exponent [1, 2] of a simulated symmetric -stable process, and on estimating the Hurst exponent H (0, 1) of a simulated fractional Brownian motion.     

An Inequality for Large Deviation Probabilities of Sums of Bounded i.i.d. Random Variables

We provide precise bounds for tail probabilities, say {M _n x}, of sums M _n of bounded i.i.d. random variables. The bounds are expressed through tail probabilities of sums of i.i.d. Bernoulli random variables. In other words, we show that the tails are sub-Bernoullian. Sub-Bernoullian tails are dominated by Gaussian tails. Possible extensions of the methods are discussed.     

Prediction and Inference for Truncated Spatial Data

Abstract

Spatial data in mining, hydrology, and pollution monitoring commonly have a substantial proportion of zeros. One way to model such data is to suppose that some pointwise transformation of the observations follows the law of a truncated Gaussian random field. This article considers Monte Carlo methods for prediction and inference problems based on this model. In particular, a method for computing the conditional distribution of the random field at an unobserved location, given the data, is described. These results are compared to those obtained by simple kriging and indicator cokriging. Simple kriging is shown to give highly misleading results about conditional distributions; indicator cokriging does quite a bit better but still can give answers that are substantially different from the conditional distributions. A slight modification of this basic technique is developed for calculating the likelihood function for such models, which provides a method for computing maximum likelihood estimates of unknown parameters and Bayesian predictive distributions for values of the process at unobserved locations.     

An Autoregressive Ordered Probit Model With Application to High-Frequency Financial Data

This article introduces a model that can be considered as an autoregressive extension of the ordered probit model. For parameter estimation we first develop a standard Gibbs sampler which however exhibits bad convergence properties. Using a special transformation group on the sample space we develop a grouped move multigrid Monte Carlo (GM-MGMC) Gibbs sampler and illustrate its fundamental superiority in convergence compared to the standard sampler. To be able to compare the autoregressive ordered probit (AOP) model to other models we further provide an estimation procedure for the marginal likelihood which enables us to compute Bayes factors. We apply the new model to absolute price changes of the IBM stock traded on December 4, 2000, at the New York Stock Exchange. To detect whether the data contain an autoregressive structure we then fit the AOP model as well as the common ordered probit (OP) model to the data. By estimating the corresponding Bayes factor we show that the AOP model fits the data decisively better than the common OP model.     

多层线性模型参数估计的MCEM算法

应用Monte Carlo EM(MCEM)算法给出了多层线性模型参数估计的新方法,解决了EM算法用于模型时积分计算困难的问题,并通过数值模拟将方法的估计结果与EM算法的进行比较,验证了方法的有效性和可行性.     

On High-Level Exceedances of Gaussian Fields and the Spectrum of Random Hamiltonians

We study the almost sure asymptotic structure of high-level exceedances by Gaussian random field (x), xV with correlated values, where {V} is a family of -dimensional cubes increasing to Z . The results are applied to the study of the asymptotic behaviour of extreme eigenvalues of random Schrödinger operator in V.     

Estimation of coefficient of variation in a weighted inverse Gaussian model

The coefficient of variation is an important parameter in many physical, biological and medical sciences. In this paper we study the estimation of the square of the coefficient of variation in a weighted inverse Gaussian model which is a mixture of the inverse Gaussian and the length biased inverse Gaussian distribution. This represents a rich family of distributions for different values of the mixing parameter and can be used for modelling various life testing situations. The maximum likelihood as well as the Bayes estimates of the parameters are obtained. These estimates are used to derive the estimates of the square of the coefficient of variation of the model under study. Several important data sets are analysed to illustrate the results. © 1996 John Wiley & Sons, Ltd.     

Continuous Contour Monte Carlo for Marginal Density Estimation With an Application to a Spatial Statistical Model

The problem of marginal density estimation for a multivariate density function f(x) can be generally stated as a problem of density function estimation for a random vector λ(x) of dimension lower than that of x. In this article, we propose a technique, the so-called continuous Contour Monte Carlo (CCMC) algorithm, for solving this problem. CCMC can be viewed as a continuous version of the contour Monte Carlo (CMC) algorithm recently proposed in the literature. CCMC abandons the use of sample space partitioning and incorporates the techniques of kernel density estimation into its simulations. CCMC is more general than other marginal density estimation algorithms. First, it works for any density functions, even for those having a rugged or unbalanced energy landscape. Second, it works for any transformation λ(x) regardless of the availability of the analytical form of the inverse transformation. In this article, CCMC is applied to estimate the unknown normalizing constant function for a spatial autologistic model, and the estimate is then used in a Bayesian analysis for the spatial autologistic model in place of the true normalizing constant function. Numerical results on the U.S. cancer mortality data indicate that the Bayesian method can produce much more accurate estimates than the MPLE and MCMLE methods for the parameters of the spatial autologistic model.     

Characterization and Statistical Estimation of a Discriminant Space for Gaussian Mixtures

The problem of classification of a multivariate observation X drawn from a mixture of Gaussian distributions is considered. A linear subspace of the least dimension containing all information about the cluster structure of X is called a discriminant space (DS). Estimation of DS is based on characterizations of DS via projection pursuit with an appropriate projection index. An estimator of DS is obtained merely by applying the projection pursuit with the projection index replaced by its nonparametric estimator. We discuss the asymptotic behavior of the estimator obtained in this way.