The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Replicant compression coding in Besov spaces”

On the asymptotic properties of a simple estimate of the Mode

Christophe Abraham, Gérard Biau, Benoît Cadre (2010)

ESAIM: Probability and Statistics

Similarity:

We consider an estimate of the mode of a multivariate probability density with support in d using a kernel estimate drawn from a sample . The estimate is defined as any in {} such that f n ( x ) = max i = 1 , , n f n ( X i ) . It is shown that behaves asymptotically as any maximizer θ ^ n of . More precisely, we prove that for any sequence ( r n ) n 1 of positive real numbers such that r n and r n d log n / n 0 , one has r n θ n - θ ^ n 0 in probability. The asymptotic normality of follows without further work.

Penultimate approximation for the distribution of the excesses

Rym Worms (2010)

ESAIM: Probability and Statistics

Similarity:

Let be a distribution function (d.f) in the domain of attraction of an extreme value distribution H γ ; it is well-known that , where is the d.f of the excesses over , converges, when tends to , the end-point of , to G γ ( x σ ( u ) ) , where G γ is the d.f. of the Generalized Pareto Distribution. We provide conditions that ensure that there exists, for γ > - 1 , a function which verifies lim u s + ( F ) Λ ( u ) = γ and is such that Δ ( u ) = sup x [ 0 , s + ( F ) - u [ | F ¯ u ( x ) - G ¯ Λ ( u ) ( x / σ ( u ) ) | converges to faster than d ( u ) = sup x [ 0 , s + ( F ) - u [ | F ¯ u ( x ) - G ¯ γ ( x / σ ( u ) ) | .