Page 1 Next

Displaying 1 – 20 of 67

Showing per page

Tail approximations for samples from a finite population with applications to permutation tests

Zhishui Hu, John Robinson, Qiying Wang (2012)

ESAIM: Probability and Statistics

This paper derives an explicit approximation for the tail probability of a sum of sample values taken without replacement from an unrestricted finite population. The approximation is shown to hold under no conditions in a wide range with relative error given in terms of the standardized absolute third moment of the population, β3N. This approximation is used to obtain a result comparable to the well-known Cramér large deviation result in the independent case, but with no restrictions on the sampled...

Tail approximations for samples from a finite population with applications to permutation tests

Zhishui Hu, John Robinson, Qiying Wang (2012)

ESAIM: Probability and Statistics

This paper derives an explicit approximation for the tail probability of a sum of sample values taken without replacement from an unrestricted finite population. The approximation is shown to hold under no conditions in a wide range with relative error given in terms of the standardized absolute third moment of the population, β3N. This approximation is used to obtain a result comparable to the well-known Cramér large deviation result in the independent ...

Tessellations of random maps of arbitrary genus

Grégory Miermont (2009)

Annales scientifiques de l'École Normale Supérieure

We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing one to encode such structures by labeled maps with a fixed number of faces. We investigate the scaling limits of the latter. Applications include asymptotic enumeration results for quadrangulations, and typical metric properties of randomly sampled quadrangulations. In particular, we show that scaling limits of these...

Testing randomness of spatial point patterns with the Ripley statistic

Gabriel Lang, Eric Marcon (2013)

ESAIM: Probability and Statistics

Aggregation patterns are often visually detected in sets of location data. These clusters may be the result of interesting dynamics or the effect of pure randomness. We build an asymptotically Gaussian test for the hypothesis of randomness corresponding to a homogeneous Poisson point process. We first compute the exact first and second moment of the Ripley K-statistic under the homogeneous Poisson point process model. Then we prove the asymptotic normality of a vector of such statistics for different...

The almost sure central limit theorems for certain order statistics of some stationary Gaussian sequences

Marcin Dudziński (2009)

Annales UMCS, Mathematica

Suppose that X1, X2, … is some stationary zero mean Gaussian sequence with unit variance. Let {kn} be a certain nondecreasing sequence of positive integers, [...] denote the kn largest maximum of X1, … Xn. We aim at proving the almost sure central limit theorems for the suitably normalized sequence [...] under certain additional assumptions on {kn} and the covariance function [...]

The classic differential evolution algorithm and its convergence properties

Roman Knobloch, Jaroslav Mlýnek, Radek Srb (2017)

Applications of Mathematics

Differential evolution algorithms represent an up to date and efficient way of solving complicated optimization tasks. In this article we concentrate on the ability of the differential evolution algorithms to attain the global minimum of the cost function. We demonstrate that although often declared as a global optimizer the classic differential evolution algorithm does not in general guarantee the convergence to the global minimum. To improve this weakness we design a simple modification of the...

Currently displaying 1 – 20 of 67

Page 1 Next