On the recent-k-record of discrete random variables

From MaRDI portal
Publication:6407804




Abstract: Let X1,X2,cdots be a sequence of i.i.d random variables which are supposed to be observed in sequence. The nth value in the sequence is a krecordvalue if exactly k of the first n values (including Xn) are at least as large as it. Let denote the ordered set of k-record values. The famous Ignatov's Theorem states that the random sets are independent with common distribution. We introduce one new record named recentkrecord (RkR in short) in this paper: Xn is a j-RkR if there are exactly j values at least as large as Xn in Xnk,Xnk+1,cdots,Xn1. It turns out that RkR brings many interesting problems and some novel properties such as prediction rule and Poisson approximation which are proved in this paper. One application named "No Good Record" via the Lov{'a}sz Local Lemma is also provided. We conclude this paper with some possible connection with scan statistics.











This page was built for publication: On the recent-$k$-record of discrete random variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407804)