The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 1761 –
1780 of
10054
The Gauss−Minkowski correspondence in ℝ2 states the existence of a homeomorphism between the probability measures μ on [0,2π] such that ∫ 0 2 π e ix d μ ( x ) = 0 and the compact convex sets (CCS) of the plane with perimeter 1. In this article, we bring out explicit formulas relating the border of a CCS to its probability measure. As a consequence, we show that some natural operations on CCS – for example, the Minkowski sum – have natural translations in terms of probability measure operations,...
In extremal estimation theory the estimators are local or absolute extremes of functions defined on the cartesian product of the parameter by the sample space. Assuming that these functions converge uniformly, in a convenient stochastic way, to a limit function g, set estimators for the set ∇ of absolute maxima (minima) of g are obtained under the compactness assumption that ∇ is contained in a known compact U. A strongly consistent test is presented for this assumption. Moreover, when the true...
We study the compactness of Feller semigroups generated by second order elliptic partial differential operators with unbounded coefficients in spaces of continuous functions in .
En este trabajo se propone un análisis de supervivencia basado en un modelo Gamma. Se obtienen las condiciones teóricas bajo las cuales dos funciones de supervivencia Gamma están estocásticamente ordenadas. Estos resultados se utilizan para proponer un método sencillo que permite comparar dos poblaciones cuando, a priori, se conoce que sus curvas de supervivencia están estocásticamente ordenadas. Los resultados se ejemplifican con el análisis de un banco de datos reales sobre tiempos de desempleo....
En este trabajo se estudia la eficiencia de un conjunto de algoritmos, exactos e iterativos, para el problema de obtener la distribución estacionaria de una cadena de Markov homogénea, irreducible y finita. Se presentan los resultados computacionales obtenidos al resolver problemas de diferentes tipos y tamaños, aleatoriamente generados, así como el tratamiento estadístico realizado sobre los mismos. Se ha comparado la estabilidad de estos algoritmos frente a la pérdida de irreducibilidad y la existencia...
Let be two sequences of i.i.d. random vectors with values in and , , . Assuming that , , and the existence of a density of satisfying the certain conditions we prove the following inequalities:
where and are the total variation and Zolotarev’s metrics, respectively.
The aim of this paper is to compare various criteria leading to the central limit theorem and the weak invariance principle. These criteria are the martingale-coboundary decomposition developed by Gordin in Dokl. Akad. Nauk SSSR188 (1969), the projective criterion introduced by Dedecker in Probab. Theory Related Fields110 (1998), which was subsequently improved by Dedecker and Rio in Ann. Inst. H. Poincaré Probab. Statist.36 (2000) and the condition introduced by Maxwell and Woodroofe in Ann. Probab.28...
Currently displaying 1761 –
1780 of
10054