ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0906.3952
82
2

Improvement of two Hungarian bivariate theorems

22 June 2009
Nathalie Castelle
ArXiv (abs)PDFHTML
Abstract

We introduce a new technique to establish Hungarian multivariate theorems. In this article we apply this technique to the strong approximation bivariate theorems of the uniform empirical process. It improves the Komlos, Major and Tusn\ády (1975) result, as well as our own (1998). More precisely, we show that the error in the approximation of the uniform bivariate nnn-empirical process by a bivariate Brownian bridge is of order n−1/2(log(nab))3/2n^{-1/2}(log (nab))^{3/2}n−1/2(log(nab))3/2 on the rectangle [0,a]x[0,b][0,a]x[0,b][0,a]x[0,b], 0<a,b<10 <a, b <10<a,b<1, and that the error in the approximation of the uniform univariate nnn-empirical process by a Kiefer process is of order n−1/2(log(na))3/2n^{-1/2}(log (na))^{3/2}n−1/2(log(na))3/2 on the interval [0,a][0,a][0,a], 0<a<10 < a < 10<a<1. In both cases, the global error bound is therefore of order n−1/2(log(n))3/2n^{-1/2}(log (n))^{3/2}n−1/2(log(n))3/2. Previously, from the 1975 article of Komlos, Major and Tusn\ády, the global error bound was of order n−1/2(log(n))2n^{-1/2}(log (n))^{2}n−1/2(log(n))2, and from our 1998 article, the local error bounds were of order n−1/2(log(nab))2n^{-1/2}(log (nab))^{2}n−1/2(log(nab))2 or n−1/2(log(na))2n^{-1/2}(log (na))^{2}n−1/2(log(na))2. We think that, in the d-variate case, the global error bound between the uniform d-variate nnn-empirical process and the associated Gaussian process is of order n−1/2(log(n))(d+1)/2n^{-1/2}(log (n))^{(d+1)/2}n−1/2(log(n))(d+1)/2, and that this result is optimal. The new feature of this article is to identify martingales in the error terms and to apply to them an exponential inequality. The idea is to bound of the compensator of the error term, instead of bounding of the error term itself.

View on arXiv
Comments on this paper