2000 character limit reached
$L_p$ and almost sure convergence of estimation on heavy tail index under random censoring
Published 24 Aug 2018 in math.ST and stat.TH | (1808.08320v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.