Efficient computation of the cdf of the maximum distance between Brownian bridge and its concave majorant - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Statistical Computation and Simulation Année : 2012

Efficient computation of the cdf of the maximum distance between Brownian bridge and its concave majorant

Résumé

In this paper, we describe two computational methods for calculating the cumulative distribution function and the upper quantiles of the maximal difference between a Brownian bridge and its concave majorant. The first method has two different variants that are both based on a Monte Carlo approach, whereas the second uses the Gaver-Stehfest (GS) algorithm for numerical inversion of Laplace transform. If the former method is straightforward to implement, it is very much outperformed by the GS algorthim, which provides a very accurate approximation of the cumulative distribution as well as its upper quantiles. This numerical work has a direct application in statistics: The maximal difference between a Brownian bridge and its concave majorant arises in connection with testing monotonicity of a density or regression curve on the unit interval, and hence it is of great importance to accurately approximate its true upper quantiles.
Fichier non déposé

Dates et versions

hal-00701836 , version 1 (26-05-2012)

Identifiants

  • HAL Id : hal-00701836 , version 1

Citer

Fadoua Balabdaoui, Filali Karim. Efficient computation of the cdf of the maximum distance between Brownian bridge and its concave majorant. Journal of Statistical Computation and Simulation, 2012, 82, pp.405-418. ⟨hal-00701836⟩
40 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More