pith. sign in

arxiv: 1808.08320 · v1 · pith:XW5O7UT6new · submitted 2018-08-24 · 🧮 math.ST · stat.TH

L_p and almost sure convergence of estimation on heavy tail index under random censoring

classification 🧮 math.ST stat.TH
keywords estimatorindextailalmostassumptionscensoringconvergencefinite
0
0 comments X
read the original abstract

In this paper, we prove $L_p,\ p\geq 2$ and almost sure convergence of tail index estimator mentioned in \cite{grama2008} under random censoring and several assumptions. $p$th moment of the error of the estimator is proved to be of order $O\left(\frac{1}{\log^{m\kappa/2}n}\right)$ with given assumptions. We also perform several finite sample simulations to quantify performance of this estimator. Finite sample results show that the proposed estimator is effective in finding underlying tail index even when censor rate is high.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.