Limiting distributions of maxima under triangular schemes

A well-known result in extreme value theory indicates that componentwise taken sample maxima of random vectors are asymptotically independent under weak conditions. However, in important cases this independence is attained at a very slow rate so that the residual dependence structure plays a significant role.In the present article, we deduce limiting distributions of maxima under triangular schemes of random vectors. The residual dependence is expressed by a technical condition imposed on the spectral expansion of the underlying distribution.     

A Compact Law of the Iterated Logarithm for Random Vectors in the Generalized Domain of Attraction of the Multivariate Gaussian Law

For a sequence of independent identically distributed random vectors, we prove that the limiting cluster set of the appropriately operator normed partial sums is, with probability one, the closed unit euclidean ball. The result is proved under the hypotheses that the law of the random vectors belongs to the Generalized Domain of Attraction of the multivariate Gaussian law and satisfy a mild integrability condition. The two conditions together are still weaker than finite second normed moment and are necessary and sufficient.     

Extreme Values and the Multivariate Compact Law of the Iterated Logarithm

For a sequence of independent identically distributed Euclidean random vectors, we prove a compact Law of the iterated logarithm when finitely many maximal terms are omitted from the partial sum. With probability one, the limiting cluster set of the appropriately operator normed partial sums is the closed unit Euclidean ball. The result is proved under the hypotheses that the random vectors belong to the Generalized Domain of Attraction of the multivariate Gaussian law and satisfy a mild integrability condition. The integrability condition characterizes how many maximal terms must be omitted from the partial sum sequence.     

Strong convergence of multivariate point processes of exceedances

We study the asymptotic behavior of vectors of point processes of exceedances of random thresholds based on a triangular scheme of random vectors. Multivariate maxima w.r.t. marginal ordering may be regarded as a special case. It is proven that strong convergence—that is convergence of distributions w.r.t. the variational distance—of such multivariate point processes holds if, and only if, strong convergence of multivariate maxima is valid. The limiting process of multivariate point processes of exceedances is built by a certain Poisson process. Auxiliary results concerning upper bounds on the variational distance between vectors of point processes are of interest in its own right.The author was supported by the Deutsche Forschungsgemeinschaft.     

φ-混合重尾随机向量序列的Chover型重对数律

本文讨论同分布的φ-混合随机向量序列其共同分布属于某个没有Gauss分量的广义的半稳定律的吸引场部分和的积分检验的极限结果,由此可推出相应的Chover型重对数律.     

On the Distribution of the Number of Fixed Vectors for the Finite Classical Groups

Motivated by analogous results for the symmetric group and compact Lie groups, we study the distribution of the number of fixed vectors of a random element of a finite classical group. We determine the limiting moments of these distributions, and find exactly how large the rank of the group has to be in order for the moment to stabilize to its limiting value. The proofs require a subtle use of some q-series identities. We also point out connections with orthogonal polynomials.     

Multidimensional Limit Theorems Allowing Large Deviations for Densities of Regular Variation

The sums of i.i.d. random vectors are considered. It is assumed that the underlying distribution is absolutely continuous and its density possesses the property which can be referred to as regular variation. The asymptotic expressions for the probability of large deviations are established in the case of a normal limiting law. Furthermore, the role of the maximal summand is emphasized.     

Extreme behavior of multivariate phase-type distributions

This paper investigates the limiting distributions of the componentwise maxima and minima of suitably normalized iid multivariate phase-type random vectors. In the case of maxima, a large parametric class of multivariate extreme value (MEV) distributions is obtained. The flexibility of this new class is exemplified in the bivariate setup. For minima, it is shown that the dependence structure of the Marshall-Olkin class arises in the limit.     

A General Darling–Erdős Theorem in Euclidean Space

We provide an improved version of the Darling–Erd?s theorem for sums of i.i.d. random variables with mean zero and finite variance. We extend this result to multidimensional random vectors. Our proof is based on a new strong invariance principle in this setting which has other applications as well such as an integral test refinement of the multidimensional Hartman–Wintner LIL. We also identify a borderline situation where one has weak convergence to a shifted version of the standard limiting distribution in the classical Darling–Erd?s theorem.     

Hit-and-run algorithms for the identification of nonredundant linear inequalities

Two probabilistic hit-and-run algorithms are presented to detect nonredundant constraints in a full dimensional system of linear inequalities. The algorithms proceed by generating a random sequence of interior points whose limiting distribution is uniform, and by searching for a nonredundant constraint in the direction of a random vector from each point in the sequence. In the hypersphere directions algorithm the direction vector is drawn from a uniform distribution on a hypersphere. In the computationally superior coordinate directions algorithm a search is carried out along one of the coordinate vectors. The algorithms are terminated through the use of a Bayesian stopping rule. Computational experience with the algorithms and the stopping rule will be reported.     

算子稳定随机向量序列的一些极限结果

对于独立同分布的没有Gauss分量的指数为可逆线性算子A的算子稳定的R~d值随机向量序列,本文通过积分检验讨论了其部分和及加权和(包括一些经典的加权和,如Cesàro加权和,后置和方式,Euler可和方式,Borel可和方式,几何加权和等)的极限结果.由此得到了部分和及加权和在相对于A的谱分解下的Chover型重对数律,这是与A的特征值的实部有关的结果.     

Cauchy-Schwarz不等式的推广

在非负定矩阵的偏序意义下讨论了对Cauchy-Schwarz不等式的推广,将随机变量情形下的Cauchy-Schwarz不等式推广到随机向量情形,而且两个随机向量的维数不要求相等,一个是随机变量另一个是随机向量是其中的一个特殊情形,另外还研究了有限维空间中的向量情形的Cauchy-Schwarz不等式在矩阵情形下的推广,得到一个十分简明的结果,并将此结果用于讨论一类随机向量簇的协方差阵的下界,不仅得到下界的具体表达式,而且给出能达到该下界的充分必要条件.     

Measurability criteria for fuzzy random vectors

Fuzzy random vector is a measurable map from a probability space to a collection of fuzzy vectors. Our aim in this paper is to discuss the measurability criteria for fuzzy random vectors, and show that under mild assumption, the measurability criteria for upper semicontinuous fuzzy random vectors can be expressed in several different but equivalent formulations. Finally, applying the obtained results, we resolve an open problem about the relationship between fuzzy random vectors and fuzzy random variables.     

Optimal estimates of random vectors using information criteria

Information criteria are applied for estimation of random vectors. Normal random vectors and random vectors with an unknown distribution are considered. Both linear estimates and estimates represented by a measurable function of observations are derived.Translated from Vychislitel'naya i Prildadnaya Matematika, No. 62, pp. 105–113, 1987.     

模糊随机向量凸集的结构和性质

在模糊随机向量凸集概念的基础上,分析了模糊随机向量凸集的结构,研究了模糊随机向量凸集的基本性质.     

Characteristics of multivariate distributions and the invariant coordinate system

We consider a semiparametric multivariate location–scatter model where the standardized random vector of the model is fixed using simultaneously two location vectors and two scatter matrices. The approach using location and scatter functionals based on the first four moments serves as our main example. The four functionals yield in a natural way the corresponding skewness, kurtosis and unmixing matrix functionals. Affine transformation based on the unmixing matrix transforms the variable to an invariant coordinate system. The limiting properties of the skewness, kurtosis, and unmixing matrix estimates are derived under general conditions. We discuss related statistical inference problems, the role of the sample statistics in testing for normality and ellipticity, and connections to invariant coordinate selection and independent component analysis.     

Volume of the polar of random sets and shadow systems

We obtain optimal inequalities for the volume of the polar of random sets, generated for instance by the convex hull of independent random vectors in Euclidean space. Extremizers are given by random vectors uniformly distributed in Euclidean balls. This provides a random extension of the Blaschke–Santaló inequality which, in turn, can be derived by the law of large numbers. The method involves shadow systems, their connection to Busemann type inequalities, and how they interact with functional rearrangement inequalities.     

An analysis of the velocity updating rule of the particle swarm optimization algorithm

The particle swarm optimization algorithm includes three vectors associated with each particle: inertia, personal, and social influence vectors. The personal and social influence vectors are typically multiplied by random diagonal matrices (often referred to as random vectors) resulting in changes in their lengths and directions. This multiplication, in turn, influences the variation of the particles in the swarm. In this paper we examine several issues associated with the multiplication of personal and social influence vectors by such random matrices, these include: (1) Uncontrollable changes in the length and direction of these vectors resulting in delay in convergence or attraction to locations far from quality solutions in some situations (2) Weak direction alternation for the vectors that are aligned closely to coordinate axes resulting in preventing the swarm from further improvement in some situations, and (3) limitation in particle movement to one orthant resulting in premature convergence in some situations. To overcome these issues, we use randomly generated rotation matrices (rather than the random diagonal matrices) in the velocity updating rule of the particle swarm optimizer. This approach makes it possible to control the impact of the random components (i.e. the random matrices) on the direction and length of personal and social influence vectors separately. As a result, all the above mentioned issues are effectively addressed. We propose to use the Euclidean rotation matrices for rotation because it preserves the length of the vectors during rotation, which makes it easier to control the effects of the randomness on the direction and length of vectors. The direction of the Euclidean matrices is generated randomly by a normal distribution. The mean and variance of the distribution are investigated in detail for different algorithms and different numbers of dimensions. Also, an adaptive approach for the variance of the normal distribution is proposed which is independent from the algorithm and the number of dimensions. The method is adjoined to several particle swarm optimization variants. It is tested on 18 standard optimization benchmark functions in 10, 30 and 60 dimensional spaces. Experimental results show that the proposed method can significantly improve the performance of several types of particle swarm optimization algorithms in terms of convergence speed and solution quality.     

A multivariate nonparametric test of independence

A new nonparametric approach to the problem of testing the joint independence of two or more random vectors in arbitrary dimension is developed based on a measure of association determined by interpoint distances. The population independence coefficient takes values between 0 and 1, and equals zero if and only if the vectors are independent. We show that the corresponding statistic has a finite limit distribution if and only if the two random vectors are independent; thus we have a consistent test for independence. The coefficient is an increasing function of the absolute value of product moment correlation in the bivariate normal case, and coincides with the absolute value of correlation in the Bernoulli case. A simple modification of the statistic is affine invariant. The independence coefficient and the proposed statistic both have a natural extension to testing the independence of several random vectors. Empirical performance of the test is illustrated via a comparative Monte Carlo study.     

The Probability Content of Cones in Isotropic Random Fields

This paper provides computable representations for the evaluation of the probability content of cones in isotropic random fields. A decomposition of quadratic forms in spherically symmetric random vectors is obtained and a representation of their moments is derived in terms of finite sums. These results are combined to obtain the distribution function of quadratic forms in spherically symmetric or central elliptically contoured random vectors. Some numerical examples involving the sample serial covariance are provided. Ratios of quadratic forms are also discussed.