A leader-election procedure using records
Gerold Alsmeyer, Zakhar Kabluchko, Alexander Marynych

TL;DR
This paper analyzes a stochastic leader-election process based on record values, establishing limit theorems for the number of rounds until all but the first person are eliminated, with applications to Poisson-Dirichlet coalescent collisions.
Contribution
It introduces a new analysis of a record-based leader-election algorithm, including limit theorems and normalization techniques involving tetrations, and connects these results to coalescent collision counts.
Findings
The number of rounds T(M) is tightly concentrated around log-star M.
Normalized labels converge to a non-Poissonian point process.
Limit theorems describe the asymptotic behavior of the process.
Abstract
The study of the number of collisions in a Poisson-Dirichlet coalescent leads to the analysis of the following version of a stochastic leader-elec\-tion algorithm. Consider an infinite family of persons, labeled by , who generate iid random numbers from an arbitrary continuous distribution. Those persons who have generated a record value, that is, a value larger than the values of all previous persons, stay in the game, all others must leave. The remaining persons are relabeled by maintaining their order in the first round, and the election procedure is repeated independently from the past and indefinitely. We prove limit theorems for a number of relevant functionals for this procedure, notably the number of rounds until all persons among , except the first one, have left (as ). For example, we show that the sequence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
