On the strong law of large numbers for -dimensional arrays of random variables.
Upper estimates are presented for the universal constant in the Katz-Petrov and Osipov inequalities which do not exceed 3.1905.
A partitioning algorithm for the Euclidean matching problem in is introduced and analyzed in a probabilistic model. The algorithm uses elements from the fixed dissection algorithm of Karp and Steele (1985) and the Zig-Zag algorithm of Halton and Terada (1982) for the traveling salesman problem. The algorithm runs in expected time and approximates the optimal matching in the probabilistic sense.
The aim of this paper is to introduce a central limit theorem and an invariance principle for weighted U-statistics based on stationary random fields. Hsing and Wu (2004) in their paper introduced some asymptotic results for weighted U-statistics based on stationary processes. We show that it is possible also to extend their results for weighted -statistics based on stationary random fields.
We consider a model of random walks on ℤ with finite range in a stationary and ergodic random environment. We first provide a fine analysis of the geometrical properties of the central left and right Lyapunov eigenvectors of the random matrix naturally associated with the random walk, highlighting the mechanism of the model. This allows us to formulate a criterion for the existence of the absolutely continuous invariant measure for the environments seen from the particle. We then deduce a characterization...