Random Sieves and Generalized Leader-election Procedures
DOI:
https://doi.org/10.17713/ajs.v52iSI.1750Abstract
A random sieve of the set of positive integers N is an infinite sequence of nested subsets N = S0 ⊃ S1 ⊃ S2 ⊃ · · · such that Sk is obtained from Sk−1 by removing elements of Sk−1 with the indices outside Rk and enumerating the remaining elements in
the increasing order. Here R1 , R2 , . . . is a sequence of independent copies of an infinite random set R ⊂ N. We prove general limit theorems for Sn and related functionals, as n → ∞.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Congzao Dong, Alexander Marynych, Viacheslav Melnykov
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
The Austrian Journal of Statistics publish open access articles under the terms of the Creative Commons Attribution (CC BY) License.
The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed.
Copyright on any research article published by the Austrian Journal of Statistics is retained by the author(s). Authors grant the Austrian Journal of Statistics a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified.
Manuscripts should be unpublished and not be under consideration for publication elsewhere. By submitting an article, the author(s) certify that the article is their original work, that they have the right to submit the article for publication, and that they can grant the above license.
